code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n,k=0,d[100],min;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&d[i]);
for(int i=0;i<n;i++){
min=i;
for(int j=i;j<n;j++)
if(d[j]<d[min]) min=j;
if(min!=i){
swap(d[i],d[m... | #include <bits/stdc++.h>
using namespace std;
int N, A[100], res;
void Out() {
cout << A[0];
for (int i = 1; i < N; i++)
cout << ' ' << A[i];
cout << endl;
}
void SelectionSort() {
for (int i = 0; i < N; i++) {
int minj = i;
for (int j = i; j < N; j++) {
if (A[j] < A[minj]) {
minj = j;
}
}
if (i... | 1 | 85,933,598 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a,c,e;
char b,d;
cin >> a >> b >> c >> d >> e;
if(c > 4){
cout << "TBD" << endl;
}else{
cout << "Heisei" << endl;
}
} | #include<iostream>
#include<stdio.h>
using namespace std;
int main(void) {
string S;
cin >> S;
int month = atoi(S.substr(5, 2).c_str());
printf(month <= 4 ? "Heisei\n" : "TBD\n");
return 0;
} | 1 | 7,354,389 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
float ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | 1 | 97,951,001 |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int main() {
int n , m , d ;
cin >> n >> m >> d;
if (d % 2 == 1) {
for (int i = 0 ; i < n ; ++ i) {
for (int j = 0 ; j < m ; ++ j) {
putchar("RG"[(i + j) & 1]);
}
puts("");
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, d;
cin >> h >> w >> d;
string s = "RYGB"... | 1 | 25,982,898 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
vector<pair<bool, int>> pairs(n,pair<bool, int>(false,0));
REP(i,m){
int p;
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 1 | 70,484,099 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) {
cout << "+" << endl;
} else if ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#incl... | 1 | 53,956,463 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N) for (int i =... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back
using namespace std;
int main() {
int n, tmp;
while (cin >> n, n) {
... | 1 | 56,549,557 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<int> A_m,A_p;
rep(i,N){
int A;
cin >> A;
if(A>=0) A_p.push_back(A);
else A_m... | 1 | 62,777,325 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
string n;
cin >> n;
for(int i = 0; i < n.length(); i++){
if(n[i] == '1') n[i] = '9';
else n[i] = '1'... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 1 | 88,820,036 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int H,W;
cin >> H >> W;
vector<string> S(H);
for(int i = 0;i < H; ++i){
cin >> S[i];
}
for(int i = 0; i < H; ++i){
cout << S[i] << endl;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 1 | 82,462,300 |
#include <iostream>
using namespace std;
int main()
{
char alph='0';
cin>>alph;
if(alph>=97 && alph<=122)
{
alph=alph+1;
cout<<alph;
}
return 0;
} | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = ... | 1 | 64,868,384 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
int main() {
string S, T; cin ... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string d, e, choose;
cin >> d >> e >> a >> b >> choose;
if(d == choose) {
a--;
} else {
b--;
}
cout << a << " " << b << endl;
} | 1 | 88,357,865 |
#include<iostream>
using namespace std;
int main()
{
int N, A, B, C, X;
int Y[100] = {};
while (true)
{
cin >> N >> A >> B >> C >> X;
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0)break;
for (int i = 0; i < N; i++)
{
cin >> Y[i];
}
int frame = 0;
int index = 0;
while (frame <= 10000)
{
... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
const i... | 1 | 93,099,451 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int gcd(int a, int b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
int lcm(int a, int b){
return a * b / gcd(a, b);
}
int main(){
int a... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a, b, k;
cin >> a >> b >> k;
int n = __gcd(a, b);
vector<int> as(0);
for(int i=1; i*i<=n; i++){
if(n%i == 0){
as.push_back(i);
if(i != n/i) as.push_bac... | 1 | 36,950,799 |
#include <iostream>
#include <stack>
#include <stdio.h>
#include <cmath>
#include <utility>
using namespace std;
int main()
{
int n;
while(cin>>n&&n){
int a[5000]={},sum[5000]={},m=-1000000;
for(int i=0;i<n;i++){
cin>>a[i];
sum[i+1]=sum[i]+a[i];
}
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
in... | #include <algorithm>
#include <iostream>
#include <string>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define FOR(i,k,n) for(int (i) = (k); (i) < (n); ++(i))
#define rep... | 1 | 24,058,414 |
#include<bits/stdc++.h>
using namespace std;
int main() {
char moji;
cin >> moji;
if(moji=='a'||moji=='i'||moji=='u'||moji=='e'||moji=='o') {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char a;
cin >> a;
switch (a) {
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
cout << "vowel\n";
break;
default:
cout << "consonant\n";
break;
... | 1 | 77,889,165 |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,k;
int main()
{
cin>>a>>b>>c>>k;
while(a>=b)
{
if(k==0)
{
cout<<"No";
return 0;
}
k--;
b*=2;
}
while(b>=c)
{
if(k==0)
{
cout<<"No";
return 0;
}
k--;
c*=2;
}
cout<<"Yes";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn=2e3+1000;
ll a,b,c,k;
string s;
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>a>>b>>c>>k;
ll ans=0;
while(b<=a){
b*=2;ans++;
}while(c<=b){
c*=2;ans++;
}if(ans<=k) cout<<"Yes"<<endl... | 1 | 49,900,559 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
int main(){
long long n;
cin>>n;
vector<int> hoge(n);
for(int i=0;i<n;i++) cin>>hoge.at(i);
sort(hoge.begin(),hoge.end());
long long ans=inf;
for(int a=hoge.at(0);a<=hoge.at(n-1);a++){
long long pre=0;
for(auto b:hoge){... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ll long long
#define ld long double
#defi... | 1 | 14,319,439 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <random>
#include <ioman... | 1 | 13,100,645 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int A, B, X;
cin >> A >> B >> X;
if (A + B >= X && X >= A)
cout << "YES\n";
else
cout << "NO\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b,x;
cin >> a >> b >> x;
if(a + b < x || a > x ) cout << "NO" << endl;
else cout << "YES" << endl;
return 0;
} | 1 | 30,363,766 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(10);
}
signed ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string key="keyence";
string s; cin >> s;
int mae=0;
while(s[mae]==key[mae]){
mae++;
}
int usiro=0;
while(s[s.size()-1 - usiro] == key[key.size() -1 -usiro]){
... | 1 | 99,357,060 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
string S; cin >> S;
int ans = 0;
int l = 0, r = S.size()-1;
while(l < r){
if(S[l] == S[r]) {
l++;
r--;
}
else{
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
const int iINF = 1001001001;
const long long llI... | 1 | 50,184,945 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int N,D;
cin >> N >> D;
vector<vector<int>> X(N,vector<int>(D));
for(int... | 1 | 41,508,519 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 1; i < n... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll mod_pow(ll x, ll n)
{
ll ret = 1;
while (n > 0)
{
if (n & 1)
ret = ret * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return ret;
}
vector<ll> fact;
vector<ll> i... | 1 | 49,266,760 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char a, b;
cin >> a >> b;
char ans = 'D';
if (a == b) ans = 'H';
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
char a,b;
cin >> a >> b;
if(a == b) cout << 'H' << endl;
else cout << 'D' << endl;
return 0;
} | 1 | 90,655,486 |
#include <stdio.h>
int main()
{
int a[3][3]={0};
for(int i=0; i<3; i++)
{
for(int j=0; j<3; j++)
{
scanf("%d", &a[i][j]);
}
}
int n, m;
scanf("%d",&n);
for(int i=0; i<n; i++)
{
scanf("%d",&m);
for(int j=0; j<3; j++)
{
for(int k=0; k<3... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
vector<int> a(9);
rep(i,9) {
cin >> a[i];
}
int n;
cin >> n;
vector<int> b(n);
rep(i,n) {
cin >> b[i];
}
rep(i,9) {
rep(j,n) {
if(a[i] == b[j]... | 1 | 49,712,623 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
typedef pair<int,int> P;
int main() {
int N; cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 1 | 86,185,391 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | 1 | 58,738,783 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s;
int k, cnt = 0, tmp = 0;
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 1 | 49,612,816 |
#include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define END(x) cout << x << endl; exit(0);
#define YN(x) x ? cout << "YES" << endl : cout << "... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcount(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namespac... | 1 | 81,243,985 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b; cin >> a >> b;
cout << a*b-a-b+1 << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int A, B;
cin >> A >> B;
cout << A * B - A - B + 1 << endl;
return 0;
} | 1 | 26,657,386 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, l = 0;
std::cin >> n >> l;
std::cin.ignore();
std::vector<std::string> v;
while (n--) {
std::string s;
std::getline(std::cin, s);
v.emplace_back(... | 1 | 100,083,373 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 92,151,681 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int a[1000], b[1000], i,s[1000];
i = 1;
while (1) {
cin >> a[i] >> b[i];
if (a[i] == 0 && b[i] == 0) { break; }
s[i] = 0;
i++;
}
for (int n = 1;n <= i - 1;n++) {
for (int j = 1;j <= a[n] - 2;j++) {
for (int k = j+1;k <= a[n] - 1;k+... | #include <iostream>
int solve(int n, int x) {
int n_combis = 0;
for (int a = 1; a <= n; a++) {
for (int b = a + 1; b <= n; b++) {
for (int c = b + 1; c <= n; c++) {
if (a + b + c == x) {
n_combis++;
}
}
}
}
retur... | 1 | 95,339,977 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmin(x,y) x=min(x,y)
int main(void){
int n,k;
cin>>n>>k;
vector<int> V(n);
rep(i,n) cin>>V[i];
int ans=0;
rep(l,n+1) rep(r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long K, std::vector<long long> V)
{
vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(N + 1, vector<ll>(N + 1)));
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (i + j >= K ||... | 1 | 52,767,085 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string deck;
cin>>deck;
while (deck != "-")
{
int m,h;
cin>>m;
for(int i=0;i<m;i++)
{
cin>>h;
string temp = deck + deck;
for(int j= 0;j<deck.length();j++)
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
int main(void) {
std::string str;
int m;
int h;
std::vector<std::string> ans;
std::cin >> str;
while (str != "-") {
std::cin >> m;
for (int i = 0; i < m; i++) {... | 1 | 60,835,787 |
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
double x1,y1,x2,y2,x3,y3,x4,y4;
scanf("%lf %lf %lf %lf %lf %lf %lf %lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
if((y2-y1)*(x4-x3)==(y4-y3)*(x2-x1))printf("YES\n");
else printf("NO\n");
}
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main(){
int n;
double x[4],y[4];
cin >> n;
while(n--){
cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2] >> x[3] >> y[3];
y[1]-=y[0];
x[1]-=x[0];
y[3]-=y[2];
x[3]-=x[2];
if(fabs(y[1]*x[3] - y[3]*x[1]) < 10e-12)cout << "YES";... | 1 | 93,418,111 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
#define br printf("\n")
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if(n <= m) {
cout << "unsafe" << endl;
}
else {
cout << "safe" << endl;
}
} | 1 | 55,573,951 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int i;
string s;
cin>>s;
set<char> t;
for (i=0;i<3;i++)
t.... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 10,309,266 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e16+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,A;
cin >> N >> A;
if(N%500 <= A) {
cout << "Yes" << endl;
}
else {
cout << "No" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,a;
cin >> n >> a;
if (n%500<=a) {
cout << "Yes" << endl;
}
if (n%500>a) {
cout << "No" << endl;
}
} | 1 | 8,888,951 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for... | 1 | 36,379,710 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int x = abs(B-A) + abs(C-B), y = abs(C-B) + abs(A-C), z = abs(A-C) + abs(B-A);
cout << min({x, y, z}) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << max(max(abs(a-b),abs(b-c)),abs(c-a));
} | 1 | 12,844,484 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
char s;
deque<char> dq;
while (cin >> s) {
if (s == '0') {
dq.push_back('0');
continue;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s, ans;
cin >> s;
for(int i=0; i<s.size(); i++){
if(s.at(i)!='B'){
ans+=s.at(i);
}
if(s.at(i)=='B'){
if(ans.size()>0) ans.pop_back();
}
}
cout << ans << endl;
} | 1 | 38,077,695 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, A, B;
cin >> N >> A >> B;
cout << max((int64_t)0, (A + B * (N - 1)) - (A * (N - 1) + B) + 1) << endl;
} | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N,A,B;
ci... | 1 | 23,741,326 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define PI 3.1415926535897932384626433832795028841971
#define INF 1000000000.0
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<double,double> P;
typedef pair<double,P> PQ;
int dp[50... | #include<iostream>
#include<algorithm>
using namespace std;
const int INF=(1<<22);
int dp[1000000];
int d[20];
int main()
{
int n, m; cin >> n >> m;
fill(dp, dp + n + 1 , INF);
for (int i = 0; i < m; ++i) {
cin >> d[i];
}
dp[0] = 0;
for (int i = 0; i < m; ++i) {
for (int j = d[i]; j <= n; ++j) {
dp[j] = mi... | 1 | 68,378,543 |
#include<bits/stdc++.h>
#define sin60 1.732050807568877/2
#define cos60 1.0/2
using namespace std;
int n;
void kohho(int d,double x1,double y1,double x2,double y2){
if(d==n){
printf("%f %f\n",x2,y2);
return;
}
double nx1=(2*x1+x2)/3,ny1=(2*y1+y2)/3,nx2=(x1+2*x2)/3,ny2=(y1+2*y2)/3;
double dx=nx2-nx1,dy=n... | #include <bits/stdc++.h>
using namespace std;
double deg60 = M_PI * 60.0 / 180.0;
struct Vec {
double x;
double y;
};
void printVec(Vec v) {
cout << fixed << setprecision(12) << v.x << ' ' << v.y << endl;
}
void koch(int d, Vec p1, Vec p2) {
if (d == 0) return;
Vec s, t, u;
s = Vec{(2 * p1.x + p2.x) / 3, (2... | 1 | 13,864,392 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
vector<int>cnt(a[n-1]+10,0);
for(int i=0;i<n;i++){
cnt[a[i]]++;
}
... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 1 | 62,035,265 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 100000005
#define MAX 5001
using namespace std;
int a[6] = {500, 100, 50, 10, 5, 1};
int solve(int n){
int ans = 0;
while(1){
for(int i = 0;i < 6;i++){
if(n >= a[i]){
n -= a[i];
ans++;
break;
}
}
if... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n&& n!=0){
int sum=0,pri=1000-n;
while(pri>=500){
pri -=500;
++sum;
}
while(pri>=100){
pri -=100;
++sum;
}
while(pri>=50){
pri -=50;
++sum;
}
while(pri>=10){
pri -=10;
+... | 1 | 21,215,165 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
string s;
cin >> s;
long int cnt_r, cnt_g, cnt_b;
cnt_r = cnt_g = cnt_b = 0;
rep(i,n) {
if(s[i] == 'R')
cnt_r++;
else if(s[i] == 'G')
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n;
cin >> n;
string s;
cin >> s;
vector<int> r, g, b;
for (int i = 0; i < n; i++) {
switch (s[i]) {
case 'R':
r.push_back(i);
break;
case 'G':
g.push_back(i);
break;
case 'B':
b.push_back(i);
break;
}
}
long ... | 1 | 44,110,800 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
int main(){
ll N,K;
cin>>N>>K;
if(K==1){
cout<<N*N*N<<endl;
}else if(K%2==1){
ll x=N/K;
cout<<x*x*x<<endl;
}else{
ll x=N/K;
ll y=N/(K/2)-x;
cout<<x*x*x+y*y*y<<endl;
}
} | 1 | 22,371,250 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
main() {
int64_t x, y;
cin >> x >> y;
if (x % y == 0) {
cout << -1 << endl;
} else {
cout << x << endl;
}
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int x, y; cin >> x >> y;
if (x % y) cout << x << '\n';
else cout << -1 << '\n';
return 0;
} | 1 | 95,583,690 |
#include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
lol a,b,x;
string s;
cin>>s;
if(s=="a" || s=="i" || s=="u" || s=="e" || s=="o") cout<<"vowel\n";
else cout<<"consonant\n";
return(0);
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
char c;
cin >> c;
cout << (c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o' ? "vowel" : "consonant") << endl;
} | 1 | 48,437,960 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int T,X;
cin>>T>>X;
double result=(double)T/(double)X;
cout<<result<<endl;
return 0;
} | 1 | 53,160,997 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<long long> s(N+1, 0);
map<long long, long long> nums;
for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
for (int i =... | 1 | 40,883,443 |
#include<iostream>
using namespace std;
char a[101][101];
bool dn[101];
bool dn1[101];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
if(a[i][j]=='#') {
dn[i]=true;
dn1[j]=true;
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(dn[i]&&dn1[j]){
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> a(h);
for(int i = 0; i < h; i++) cin >> a[i];
vector<bool> isliveh(h, true);
vector<bool> islivew(w, true);
for(int i = 0; i < h; i++){
bool isexist = fals... | 1 | 60,112,239 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> v(n), w(m);
forn(i, n) cin >> v[i];
forn(i, m) cin >> w[i];
sort(v.begin(), v.end());
sort(w.begin(), w.end());
bool flag_1 = v... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, m, x, y, t;
int main() {
cin >... | 1 | 3,999,000 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for(int i = 0; i < n; i++){
cin >> d.at(i);
}
n /= 2;
sort(d.begin(), d.end());
int a = d.at(n-1);
int b = d.at(n);
int counta = 0;
int countb = 0;
for(int i = 0; i < 2 * n; i++){
if(d.at(i) < a... | #include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | 1 | 90,760,409 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2020, dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
typedef pair<int, int> pii;
int n, m, dist[MAX_N][MAX_N];
char S[MAX_N][MAX_N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%s", S[i] + 1);
memset(dist, 0x3... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 1 | 41,176,351 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
long long t;
if(n==1)cout << k << endl;
else{
t=k;
for(int i=1;i<n;i++){
t*=k-1;
}
cout << t << endl;
}
} | #include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | 1 | 87,008,607 |
#include <iostream>
#include <cmath>
using namespace std;
int main(void)
{
int l;
cin >> l;
long double d = l / 3.0;
printf("%.10Lf\n", d * d * d);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll L;
cin >> L;
double x=(double)L/3.0;
cout << fixed << std::setprecision(10) << x*x*x <<endl;
} | 1 | 93,859,455 |
#include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(a) begin(a),end(a)
int main()
{
int N, M; cin >> N >> M;
vi c(N+1, 0);
rep(i, M) {
int a, b; cin >> a >> b;
c[a]++;
c[b]++;
}
cout << (all_of(all(c... | 1 | 40,228,944 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int i, j, k, l, n = 0;
int a[2], cnt;
vector<vector<int> > v;
while(1) {
cin >> a[0] >> a[1];
if(a[0] < 1 && a[1] < 1) break;
v.push_back(vector<int>(a, a+sizeof(int)));
++n;
}
for(i=0; i<n; +... | 1 | 47,542,842 |
#include<iostream>
#include<algorithm>
using namespace std;
int n,sz[1000000],par[1000000];
long long d[1000000],chdst[1000000];
pair<long long,int>id[1000000];
bool solve()
{
for(int i=0;i<n;i++)
id[i]=make_pair(d[i],i);
sort(id,id+n);
for(int i=0;i<n;i++)
{
sz[i]=1,par[i]=-2;
chdst[i]=0;
}
for(int i=n-1;i... | #include <bits/stdc++.h>
#define Stop { cout << "-1\n"; return 0; }
using namespace std;
typedef long long ll;
const int Nmax = 1e5 + 5;
map<ll, int> mp;
vector<int> v[Nmax];
ll d[Nmax], Sum;
int t[Nmax], w[Nmax], level[Nmax];
int n, i, node, dad, root;
void dfs(int node)
{
for(auto it : v[node])
{
leve... | 1 | 49,380,722 |
#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int f(int x){
return x*x ;
}
int main(){
int d;
while(cin >>d){
int sum = 0;
int x=0;
while(x < 600){
sum+=f(x)*d;
x+= d;
}
cout << sum <<endl;
}
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int i,j,d;
double ans=0;
while(cin >> d){
i=0;
ans=0;
while(i<600){
ans+=i*i*d;
i+=d;
}
printf("%.0lf\n",ans);
}
return 0;
} | 1 | 66,822,303 |
#include <stdio.h>
#define MAX_N 101
double t[MAX_N], v[MAX_N];
double max(double a, double b)
{
return a > b? a: b;
}
double min(double a, double b)
{
return a < b? a: b;
}
int main(void)
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lf", &t[i]);
for (int i = 0; i < n; i... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define deb... | 1 | 15,041,983 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M, P, X;
int i;
double rate, sum;
cin >> N >> M >> P;
while(N!=0 || M!=0 || P!=0){
vector<int> v;
sum=0.0;
rate=100-P;
for(i=0; i<N; ++i){
cin >> X;
sum+=100*X;
v.push_back(X);
}
sum=sum*rate/100/v[M-1];
if(v[M-1]==0) cout << 0... | #include<iostream>
#include<vector>
using namespace std;
int main(void){
int n,m,p;
while(cin>>n>>m>>p,n+m+p){
vector<int> stu(n);
int sum = 0;
for(int i = 0 ; i < n ; i ++){
cin>>stu[i];
sum += stu[i];
}
sum *= 100 - p;
if(stu[m-1]==0)cout<<0<<endl;
else cout<<sum/stu[m-1]<<... | 1 | 7,587,528 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
#include<vector>
#include <algorithm>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int v[55];
int ans=-9999999;
for(int i=0; i<n; i++)
{
cin>>v[i];
}
int a,b,c;
for(a=0; a<=k; a++)
{
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N, K;
cin >> N >> K;
deque<ll> D;
rep(i, N) {
ll v;
cin >> v... | 1 | 25,734,364 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
constexpr int MAX_N = 1e4;
int dp[MAX_N+10];
int A[9];
int main() {
int N, M;
ins(N, M);
rep... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | 1 | 61,336,676 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
int a,h,m,s,sum,r;
char c;
vector<pair<int,int> > vp;
pair<int,int> p;
while(1){
cin>>a;
vp.clear();
if(a==0)break;
for(int i=0;i<a;i++){
cin>>h>>c>>m>>c>>s;
h=h*3600+m*60... | 1 | 1,171,976 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a(n+1);
rep(i,n) cin >> a[i+1];
int ans = 0;
int light = 1;
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) cin >> arr[i];
bool visited[n];
memset(visited, false, sizeof(visited));
int buttons_pressed = 0;
queue<int> q({1});
... | 1 | 60,834,172 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef long long ll;
int main(void){
int n;ci... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
map<ll, int> stick;
vector<ll> length;
for (int i = 0; i < N; i++) {
ll x;
cin >> x;
stick[x]++;
if (stick[x] != 0 && !(stick[x] % 2)) {
length.push_back(x);
}
}
sort(length.begin(), ... | 1 | 35,767,572 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
string s;
cin >> s;
for (int i = 0; i < int(s.size()); ++i) {
if (s[i] == '1')
cout << '9';
else if (s[i] == '9')
cout << '1';
else
cout << s[i];
}
cout << '\n';
} | #include<vector>
#include <iostream>
#include<string>
#include <complex>
#include <algorithm>
#include<string>
#include <map>
#include <utility>
using namespace std;
int main(){
char n[3];
for(int i = 0 ;i < 3; i++){
cin >> n[i];
if(n[i] == '9'){
cout << '1';
}
else i... | 1 | 60,420,071 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int a[3];
cin >> a[0] >> a[1] >> a[2];
sort(a, a+3);
int ans = 0;
if((a[1] - a[0])%2) {
a[2]++;
a[0]++;
ans++;
}
ans += (a[1] - a[0])/2;
int x = a[2] - a[1];
if(x % 2){
ans++;
}
ans +... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
int p = min({A,B,C});
int r = max({A,B,C});
int q = A+B+C-p-r;
if (p==q) {
cout << r-q << endl;
return 0;
}
if (q==r) {
cout << (q-p+1)/2 + (q-p)%2... | 1 | 70,342,357 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn= 5e4+5;
#define mod 1000000007
ll INF = 1000000000000000005LL;
void rishabh(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int arr[mxn],n;
int query(int x, int y){
cout<<"? "<<x<<' '<<y<<en... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | 1 | 30,528,579 |
#include <bits/stdc++.h>
using namespace std;
signed main()
{
char a; cin>>a;
if('A'<= a && a<='Z'){cout << 'A';}
else{cout << 'a';}
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, s, n) for (int i = s; i < n; i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
#define mod 1000000007
using namespace std;
using ll = long long;
using vi = vector<int>;
using pll = pair<ll, ll>;
... | 1 | 64,772,101 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> v[100010];
int dfs (int nod, int tata)
{
int rez = 0;
for (auto &it : v[nod])
{
if (it == tata) continue;
rez ^= (dfs (it, nod) + 1);
}
return rez;
}
int main ()
{
int n;
scanf ("%d", &... | 1 | 86,550,265 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_bac... | 1 | 16,906,796 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
const int MAX = 1255;
int main(){
int a,b;
bool flag = true;
cin >> a >> b;
for(int i=0;i < MAX;++i){
if(int(i*0.08) == a && int(i*0.1) == b){
cout << i << endl;
flag = false;
break;
}
}
if(flag){
cout << -1 << endl;
}
... | 1 | 59,755,360 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
string s,t;
cin >> s >> t;
vector<int> transS(26,-1);
vector<int> transT(26,-1);
bool result = true;
for(int i = 0; i < (int)s.size(); ++i)
{
int a = s[i]-'a';
int b = t[i]-'a';
if((transS[a] != -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
string S, T; cin >> S >> T;
vector<int> s(26, -1);
vector<int> ... | 1 | 20,846,411 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n, ans;
double debt = 100000;
cin >> n;
for(int i = 0; i < n; i++)
{
debt = ceil((debt * 1.05) / 1000) * 1000;
}
ans = debt;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n,i;
int temp;
double ans = 100;
cin >> n;
for(i = 0;i < n;i++){
ans *= 1.05;
ans -= 0.01;
temp = (int)ans;
ans = (double)temp + 1;
}
cout << ans << "000" << endl;
return(0);
} | 1 | 95,377,573 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>... | #include <iostream>
using namespace std;
static const int MAX=100;
static const long long INFTY=(1LL<<32);
int n;
long long d[MAX][MAX];
void floyd()
{
for(int k=0;k<n;k++)
{
for(int i=0;i<n;i++)
{
if(d[i][k]==INFTY) continue;
for(int j=0;j<n;j++)
{
... | 1 | 99,527,978 |
#include<iostream>
using namespace std;
int fib[45] = {0};
void solve(int n) {
if (n == 0 || n == 1) {
fib[n] = 1;
return;
}
if (fib[n - 2] == 0) solve(n - 2);
if (fib[n - 1] == 0) solve(n - 1);
fib[n] = fib[n - 1] + fib[n - 2];
return;
}
int main() {
int n;
cin >> n;
... | #include <iostream>
#include <vector>
#define eol '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> list(n+1,0);
list[0] = list[1] = 1;
for (int i = 2; i <= n; i++) {
list[i] = list[i-1] + list[i-2];
}
cout << list[n] << eol;
return... | 1 | 14,708,192 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n, l;
int a[5... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
using namespa... | 1 | 46,181,031 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
int X = 100001;
int Y = 100001;
for(int i = 0; i < A; i++) {
cin >> a[i];
X = min(X,a[i]);
}
for(int i = 0; i < B; i++) {
cin >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,M,priceA,priceB,priceC;
cin>>A>>B>>M;
int a[A],b[B],x[M],y[M],c[M];
for(int i=0;i<A;i++){
cin>>a[i];
}
for(int i=0;i<B;i++){
cin>>b[i];
}
for(int i=0;i<M;i++){
cin>>x[i]>>y[i]>>c[i];
}
f... | 1 | 76,126,257 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int k = 0;
string s;
cin >> s;
for(int i = 0; i < s.size(); i++)
{
for(int j = i + 1; j < s.size(); j++)
{
if(s[i] == s[j])
k++;
}
}
if(k == 0)
cout <... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (x).end()
#define SUM(x) accumulate(x.be... | 1 | 92,542,415 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | #include <stdio.h>
#include <string.h>
int main()
{
char S[15], T[15], U[15];
int A, B;
scanf ("%s %s", S, T);
scanf ("%d %d", &A, &B);
scanf ("%s", U);
(strcmp (S,U) == 0) ? A-- : B--;
printf ("%d %d", A, B);
return 0;
} | 1 | 36,814,192 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define zero_pad(num) setfill('0') << std::right << setw(num)
const int MOD=1e... | 1 | 57,772,970 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,a=0;
cin>>A>>B;
for(int i=0;i<10000;i++){
if(int(i*0.08)==A && int(i*0.10)==B){
a=1;
cout<<i<<endl;
break;
}
}
if(a==0)
cout<<-1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x = (int) ceil(a / 0.08), y = (int) ceil(b / 0.1);
for (int i = min(x, y), n = max(x, y); i <= n; i++)
if (floor(0.08 * i) == a && floor(0.1 * i) == b) {
cout << i << endl;
return 0;
... | 1 | 58,842,991 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX_V = 1;
const ll MAX_E = 1;
struct edge {
ll from, to, cost;
};
edge ES[MAX_E];
vector<edge> G[MAX_V];
ll d[MAX_V];
ll prev_path[MAX_V];
ll V, E;
const ll MOD = (ll) 1e9 + 7;
const int MAX_INT = 1 << 17;
vector<bool> prime;
#define all(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const vector<vector<int>> dir4 = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
const vector<vector<int>> dir8 = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}, {1, 1}, {-1, 1}, {1, -1}, {-1, -1}};
int main()
{
int h = 100, w = 100;
int a, b; cin >> a >> b;
a--, b-... | 1 | 52,493,246 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
string S; cin>>S;
ll N=S.size();
ll count=0;
ll num=0;
rep(i,N)
{
if(S.at(i)=='W')
{
count++;... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
string S;
cin >>... | 1 | 9,538,941 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#def... | #include "iostream"
#include "vector"
#include "string"
#include "algorithm"
#include "math.h"
#include "cstring"
#include "stack"
#include "queue"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll> > mat;
int main()
{
int n, k;
cin >> n >> k;
... | 1 | 22,304,382 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> num(5, 0);
for(int i = 0; i < 3; i++){
int a, b;
cin >> a >> b;
num[a]++;
num[b]++;
}
int num1 = 0, num2 = 0;
for(int i = 1; i <= 4; i++){
if(num[i] == 1) num1++;
else i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int,... | 1 | 20,465,608 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n - 1);
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int t = 1; t < n; t++){
int sum1 = 0, sum2 = 0;
for(int j = 0; j < n; j++){
if(j + 1 <= t) sum1 += a[j];
else sum2 += a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
typedef pair<int,int> pii;
int main(){
int n;
cin>>n;
vector<int> w(n+1);
vector<int> sum_w(n+1,0);
REP(i,n){
cin>>w[i];
sum_w[i]=sum_w... | 1 | 53,784,069 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,r;
cin>>n>>r;
if(n>=10){
cout<<r<<'\n';
}
if(n<10){
cout<<r+(100*(10-n))<<'\n';
}
return(0);
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 1 | 5,362,127 |
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("intt.txt", "r", stdin);
freopen("outt.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
vector<pair<int, int> > v(n);
long long ans = 0;
for (int i = 0; i <... | 1 | 31,393,169 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,i,ci=0,h=0;
cin>>a>>b;
string s;
cin>>s;
for(i=0; i<s.size(); i++)
{
if(int(s[i])>=48 && int(s[i])<=58)
ci++;
if(s[i]=='-')
h++;
}
if(s[a]=='-'&& h==1 && ci==(a+b))
cout<<"Yes";
els... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
string x;
cin>>x;
int c1=0,c2=0,c3=0;
bool ck=true;
for(int i=0;i<x.length();i++)
{
if(ck==true)
if(isdigit(x[i]))
c1++;
if(ck==false){
if(isdigit(x[i]))
c2++;
}
... | 1 | 38,750,065 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return abs(a*b)/gcd(a,b);}
vector<ll> enum_div(ll n){vector<ll> ret;for(int i=1 ; i*i<=n ; i++){if(n%i == 0){ret.push_back(i);if(i!=1 && i*i!=n)ret.push_back(n/i);}}ret.push_back(n);return ret... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 41,412,197 |
#include <bits/stdc++.h>
using namespace std;
int calc(int node,int node_from,vector<vector<int>> &tree,vector<int> &xsum,vector<int64_t> &psum);
int main()
{
int n,q;
cin >> n >> q;
vector<int> a(n),b(n);
vector<int> p(q+1),x(q+1);
for (int i=1;i<n;++i)
{
cin >> a[i] >> b[i];
}
for (int i=1;i<=q;++i)
{
ci... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
struct Node {
int parent;
vector<int> children... | 1 | 81,175,226 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
vector<vector<int>> ans(h,vector<int>(w,0));
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if((i<b && j<a) || (i>=b && j>=a)){
ans[i][j]=1;
}
}
}
for(int i=0;i<h;++i){
for(int j=0;j<w... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
using namespace std;... | 1 | 53,995,675 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, ma, mi, p, q;
vector<int> nums;
cin >> n;
p = q = 0;
for (int i = 1; i <= n; i++){
nums.push_back(i);
}
for (int i = n; 0 < i; i--){
int num;
cin >> num;
p += pow(10, i-1)*num;
}
for (int i = n; 0 < i; i--){
i... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353a
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;
cin>>N;
vector<int>P(N);
vector<int>Q(N);
... | 1 | 84,824,681 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.