code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
#define int long long
#define rep(i,a,n) for (int (i)=(a);(i)<(n);(i)++)
using namespace std... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include <sstream>
#include<iomanip>
#in... | 1 | 42,897,350 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<tuple>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
long long n;
int main() {
cin >> n;
vector<long long> a(n, 0);
... | 1 | 81,389,175 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, i;
cin >> n >> i;
cout << n - i + 1;
return 0;
} | # include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
cout << n+1-k <<'\n';
return 0;
} | 1 | 74,519,461 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll n, m, d;
cin >> n >> m >> d;
if(d == 0){
printf(... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | 1 | 78,401,873 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
void chmin(int &a, int b){a = min(a, b);}
int main() {
cin.tie(0);
cout.tie(0);... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | 1 | 100,694,957 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,q;
cin >> n >> q;
vector<vector<int>> to(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
to[x].push_back(y);
to[y].push_back(x);
}
queue<... | #include <bits/stdc++.h>
#include <algorithm>
#define int long long
using namespace std;
#define mod 1000000007
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int dis[100005] = {0};
void dfs(int node)... | 1 | 25,029,283 |
#pragma region RegionDefs
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define all(x) begin(x),end(x)
using namespace std;
const int INF = 1e9;
templat... | #include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5;
int main(int argc, const char * argv[])
{
ll n, a[maxn], sum[maxn] = {0}, x[maxn] = {0}, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
sum[i] = sum[i-1] + a[i];
x[i] = x... | 1 | 59,450,736 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
string y, ans = "";
cin >> a >> b;
if (a <= b) {
x = b;
y = to_string(a);
} else {
x = a;
y = to_string(b);
}
for (int i = 0; i < x; i++) ans += y;
cout << ans << endl;;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >>a>>b;
string s;
if(a<b) {
for(int i=0;i<b;i++) cout <<a;
cout <<endl;
}
else if(a>b){
for(int i=0;i<a;i++) cout <<b;
cout <<endl;
}
else if(a==b){
for(int i=0;i<a;i++) cout <<a;
cout <<endl;
}
} | 1 | 47,018,011 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,K;
cin>>N>>K;
int sum = 1;
for(int i = 0;i<N;i++){
if(sum<K){
sum+=sum;}
else{sum+=K;}
}
cout<<sum;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
int ans = 1;
for(int i = 0; i < n; i++)
{
... | 1 | 18,561,191 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,t ;
cin >> x >> t;
cout << (x-t < 0 ? 0 : x-t) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, t;
cin >> X >> t;
if(X == t || X < t) cout << 0 <<endl;
else cout << (X - t) <<endl;
} | 1 | 95,649,137 |
#include<iostream>
#include<vector>
#include<sstream>
#include<string>
using namespace std;
int main(){
string str;
getline(cin,str);
stringstream ss(str);
vector<string> v;
vector<int> n;
while(ss >> str){
bool f=false;
for(int i=0;i<v.size();i++){
if(str==v[i]) {
n[i]++;
f=true;
}
... | #include<iostream>
#include<cstring>
using namespace std;
struct word{
int len;
int num;
char w[32];
};
int main(){
word vo[1000];
char vol[32];
int k = 0,max[2]={0,0};
while(cin>>vol){
int i;
for(i=0; i<k; i++){
if(strcmp(vo[i].w,vol) == 0){
vo[i].num++;
break;
}
}
if(i == k){
strcpy(vo... | 1 | 75,687,917 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
string S, T;
cin >> S >> T;
bool ... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | 1 | 18,328,613 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define ll long long
#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)
using namespace std;
int gcd(int a, int b) {
if(a % b == 0) return b;
return gcd(b, a%b);
}
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, 0, n) cin... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) {
return a;
}
return gcd(b, a % b);
}
int main(void){
ios::sync_with_stdio(false);
cin.ti... | 1 | 7,446,374 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl "\n"
#define ll long long
#define MOD 1000000007
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define pii pair<int,int>
bool compare(const pii &a, const pii &b){
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
... | 1 | 955,419 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
bool ch[3];
int main() {
for(ll i=0;i<2;i++){
ll n;
cin>>n;
n--;
ch[n]=true;
}
for(ll i=0;i<3;i++){
if(ch[i]){
continue;
}
cout << i+1;
return 0;
}
return 0;
} | 1 | 19,685,197 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fi(v) get<0>(v)
#define se... | 1 | 96,459,696 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 100100100100100100;
const ll MOD = 1000000007;
ll combination(ll n, ll r){
if(n < r) return 0;
if(r == 0||r == n) return 1;
... | 1 | 26,143,715 |
#include<cstdio>
#include<cstring>
int main(){
char abc[27]="abcdefghijklmnopqrstuvwxyz";
int num[27]={};
char cha;
int i=0;
while (scanf("%c", &cha) !=EOF){
for (int k=0; k<26; k++){
if (cha==65+k || cha==97+k) num[k]++;
}
i++;
}
for (int k=0; k<26; k++){
printf("%c : %d\n", abc[k], num[k]);
}
r... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
char ch;
char s[27]={"abcdefghijklmnopqrstuvwxyz"};
int counter[27]={0};
int i,j=0;
while(cin >>ch){
... | 1 | 68,566,305 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
string s, t;
cin >> N >> s >> t;
for(int i = 0; i < N + 1; i++) {
if(s.substr(i, N - i) == t.substr(0, N - i)) {
cout << N + i << endl;
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 1 | 51,153,646 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define ... | 1 | 80,017,882 |
#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>;
using v = vector<int>;
using vv = vector<v>;
const int MOD = 998244353;
const int INF = 1001001001;
int main(){
string s;
cin >> s;
if(s.size()<15){
for(int i=s.si... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s,t="ooooooooooooooooooo";
cin>>s;
s+=t;
ll cnt=0;
for(int i=0;i<15;i++)if(s[i]=='o')cnt++;
cout<<(cnt>=8?"YES":"NO");
return 0;
} | 1 | 13,852,348 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){ _;
int n;
int count;
bool up,leftUp,rightUp;
string str;
while(cin>>n,n!=0){
count=0;
up=leftUp=rightUp=false;
REP(i,n){
cin>>str;
if... | #include <iostream>
#include <string>
using namespace std;
int main(){
bool l,r,u;
string s;
l=r=u=false;
int ans=0;
int n,i;
cin >> n;
while(n){
l=r=u=false;
ans=0;
for(i=0;i<n;i++){
cin >> s;
if(s=="lu")l=true;
if(s=="ld")l=false;
if(s=="ru")r=true;
if(s=="rd")r=false;
if(l==r){
if(u... | 1 | 63,501,518 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define PI acos(-1)
int main(){
int a,b;
while(cin>>a>>b,a||b){
rep(i,a){
rep(j,b){
if(i==0||i==a-1||j==0||j==b-1)cout<<"#";
else cout<<".";... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include<cstdio>
#include <vector>
#include<queue>
#include<limits.h>
#include<string.h>
#include<functional>
using namespace std;
signed main() {
int a, b;
while (cin >> a >> b, a | b) {
for (int c = 0; c < a; c++) {
for (int d = 0; ... | 1 | 98,381,277 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a;
vector<string> x(a);
for (int i = 0; i < a; i++) {
cin >> x[i];
}
cin >> b;
vector<string> y(b);
for (int i = 0; i < b; i++) {
cin >> y[i];
}
int count = 0;
vector<int> c(a);
if (a>b) {
for (int i = 0; i < a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
string s[N];
for (int i=0; i < N; i++){
cin >> s[i];
}
cin >> M;
string t[M];
for (int i=0; i < M; i++){
cin >> t[i];
}
int max = -M;
string str;
for (int i=0; i < N; i++){
str = s[i];
int cnt = 0;
... | 1 | 69,692,536 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,n) ... | 1 | 65,380,806 |
#include<stdio.h>
#include<string.h>
int main(void)
{
char a[21];
int i,n;
scanf("%s",&a);
n=strlen(a);
for(i=n-1;i>=0;i--){
printf("%c",a[i]);
}
printf("\n");
return 0;
} | #include <iostream>
using namespace std;
void reverseSequence()
{
char s[20];
cin >> s;
int i;
for (i = 0; i < 20; i++)
{
if (s[i] == '\0')
{
break;
}
}
for (int j = i - 1; j >= 0; j--)
{
cout << s[j];
}
cout << endl;
}
int main()
{
reverseSequence();
return 0;
} | 1 | 81,521,093 |
#include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | # include <iostream>
using namespace std;
int a, b, c;
int main() {
cin >> a >> b >> c;
int ans = c - a + b;
if (ans > 0) cout << ans << endl;
else cout << 0 << endl;
return 0;
} | 1 | 48,224,933 |
#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(N),B(N);
rep(i,N) cin >> A[i];
rep(i,N) cin >> B[i];
ll sumA = 0;
ll sumB = 0;
ll cnt... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef ... | 1 | 43,538,971 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) {
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int d(ll n) {
if(n == 0) return 1;
int count... | 1 | 100,308,414 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1;
int dy = y2 - y1;
int x3 = x2 - dy;
int y3 = y... | #include <iostream>
int main() {
int a, b, c, d; std::cin >> a >> b >> c >> d;
std::cout << c - (d - b) << " " << d + (c - a) << " " << a - (d - b) << " " << b + (c - a) << std::endl;
return 0;
} | 1 | 1,206,202 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include<numeric>
#include<cmath>
#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 INF 2e9
#define ALL(v) v.begin(), v.end... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
type... | 1 | 34,385,708 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int list[13] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1};
int anum, bnum;
for (int i = 0; i < 13; i++) {
if (a == list[i]) {
anum = i;
}
if (b == list[i]) {
bnum = i;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
if(N==1){
N=14;
}
if(M==1){
M=14;
}
if(N<M){
cout << "Bob" << endl;
}
else if(N==M){
cout << "Draw" << endl;
}
else{
cout << "Alice" << endl;
}
} | 1 | 50,446,841 |
#include <bits/stdc++.h>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mt make_tuple
#define ff first
#define ss second
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define repA(i,x,y) for(int i = (x) ; i <= (y) ; i+... | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifdef FASTIO
ios_... | 1 | 19,251,336 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
int count=0;
for(int a=0;a<=N/4;a++){
for(int b=0;b<=N/7;b++){
int sum=4*a+7*b;
if (sum==N){
count++;
}
}
}
if(count!=0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<en... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
bool yes = false;
for (int i = 0; i < 100; ++i) {
for (int j = 0; j < 100; ++j) {
if (4 * i + 7 * j == N) {
yes = true;
break;
}
}
if (yes) {
... | 1 | 72,398,356 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[100005] = {};
signed main() {
int N,A,B;
cin >> N >> A >> B;
cout << max(0LL,B*(N-1)+A-(A*(N-1)+B)+1) << endl;
} | #include <iostream>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
long long int ans = (long long int)b*(n-1)+a
- ((long long int)a*(n-1)+b) + 1;
if(ans >= 1) cout << ans << endl;
else cout << 0 << endl;
return 0;
} | 1 | 31,665,861 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 998244353
const ll INF=1... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,d,h=0,MOD=998244353,ans=1; cin>>N>>d;
if(d!=0){cout<<0<<endl; return 0;}
vector<ll>D(N);
for(int i=1; i<N; i++){cin>>d; D[d]++; h=max(h,d);}
if(D[0]!=0){cout<<0<<endl; return 0;}
for(int i=1; i<h; i++){
for(int j=0; j<D[i... | 1 | 75,489,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
int main(){
int a, b, x;
cin >> a >> b >> x;
if(a<=x && x<=a+b) cout << "YES" <<endl;
else... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x;
scanf("%d%d%d",&a,&b,&x);
if(a<=x && (a+b)>x)
printf("YES");
else
printf("NO");
} | 1 | 26,239,232 |
#include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> nums(n);
for (int &x: nums) {
cin >> x;
}
sort(nums.begin(), nums.end());
double temp = nums[... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
float t;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
t=(a[0]+a[1])/2.0;
for(int i=2;i<n;i++){
t=(t+a[i])/2.0;
}
cout<<t;
return 0;
} | 1 | 36,253,630 |
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int x[100005];
int main() {
int n;
cin>>n;
long long sum = 0;
for(int i = 1; i <= n; i++)
{
cin>>x[i];
sum+=abs(x[i]-x[i-1]);
}
sum+=abs(x[n]);
long long o = sum;
for(int i = 1; i <= n; i++)
{
o = sum;
o-=abs(x[i-1]-x[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
vector<int> vec(N);
rep(i,N){
cin >> vec[i];
}
int ans... | 1 | 40,130,928 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
int cnt = 0, ans = 0, tmp;
for (int i = 0; i < N; i++) {
int x; cin >> x;
if (i == 0) {
tmp = x;
continue;
}
if (tmp >= x) {
cnt++;
ans = max(ans, cnt);... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true... | 1 | 34,840,400 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FOR(i, m, n) for (int i = m; i < ... | 1 | 59,044,540 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
int main(void)
{
ll n, m;
cin >> n >> m;
ll a, b, ans;
a = min(n, m);
b = max(n, m);
if(a == 1) {
if(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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 rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 1 | 54,478,109 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
using namespace std;
using ll = long long;
int main(){
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
ll coin=0;
if(b-a>1){
for(ll i=0;i<k;i++){
if(coin>0){
ans+=b;
... | #include <bits/stdc++.h>
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 57,085,452 |
#include <iostream>
#include <string>
using namespace std ;
string YorN(bool a){if(a) return"YES" ; return "NO" ;}
int main(){
string s ; cin >> s ;
int cnt = 0 ;
for(int i=0;i<s.size();i++) if(s.at(i)=='x') cnt++ ;
cout << YorN(cnt<=7) << endl ;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int N=0;
for(int i=0;i<S.size();i++){
if(S.at(i)=='x') N++;
}
cout<<(N>=8? "NO":"YES")<<endl;
} | 1 | 82,405,298 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 1 | 73,688,708 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
const int MAX_num = 9;
const int min_num = 0;
int n = 0;
for(int i=1;cin.eof()==false;i++){
int count =0;
n = -1;
cin >> n;
if(n==-1) break;
for(int a = min_num; a < MAX_num+1; a++){
for(int b = min_num; b < MAX_... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 1 | 81,537,715 |
#include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | 1 | 93,817,419 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int INF = 1e6;
long long add(long long a, long long b) {
long long res = a + b;
if (res >= mod) res -= mod;
return res;
}
long long sub(long long a, long long b) {
long long res = a - b + mod;
if (res >= mod) res -= mod;
... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
long long n, res = 0, tmp, ka = 0, cnt = 1;
cin >> n;
for (int i = 1; i <= sqrt(n); i++)
{
ka = (n - 1) / cnt;
tmp = ka - i;
if (tmp >= 1) res += tmp * 2 + 1;
else if (tmp == 0) res += 1;
cnt++;
}
cout << res << end... | 1 | 51,918,852 |
#include <iostream>
using namespace std;
int A[3];
int main(){
while(cin >> A[0] >> A[1] >> A[2] && !(A[0] == -1 && A[1] == -1 && A[2] == -1)){
int a = A[0] + A[1];
if(A[0] == -1 || A[1] == -1) cout << "F" << endl;
else if(a>=80) cout << "A" << endl;
else if(a<80 && a>=65) cout << "B" << endl;
else if(a<65 &... | #include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
#define PI 3.141592653589
int main(){
int n, a, b, c, d;
char ss;
while(1){
cin >> a >> b >> c;
if(a == -1 && b == -1 && c == -1)break;
if(a == -1 || b == -1){
a = 0;
b = 0;
}
if(80 <= a + b)ss = 'A';
else if(65 <= a +... | 1 | 15,908,591 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const unsigned int M = 1000000007;
int main(){
int n;
while(cin>>n){
n<1200?cout<<"ABC"<<endl:cout<<"ARC"<<endl;
}
} | 1 | 41,235,195 |
#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 s; cin >>s;
int n = s.size()+1;
vector<int> a(n);
rep(i,n){
if(s[i]=='<'){
a[i+1] = max(a[i+1], a[i]+1);
}
}
for(int i = n-1; 0<=i; i--){
if(s[i]=='>'){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
long long n, r, l;
r = 0; l = 0;
n = S.size();
vector<long long> right(n+1), left(n+1);
left[0] = 0;
for(int i=0; i<n; i++){
if(S[i] == '<') l++;
else l=0;
left[i+1] = l;
}
right[n] = 0;
for(int i=n-1; i>=0; ... | 1 | 53,447,338 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long int n, m;
cin >> n >> m;
long int a, b, chk = 0;
vector<long int>cnct_a;
vector<long int>cnct_b;
for(long int i = 0; i < m; i++){
cin >> a >> b;
if(a == 1 && b == n){
chk = 1;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
int main()
{
int n, m;
cin >> n >> m;
set<int> s1;
vi v;
bool solve = 0;
f... | 1 | 71,198,274 |
#include<iostream>
#include<cstring>
#include<climits>
using namespace std;
int main(){
long long int n,a,b,mini;cin>>n;
mini=n-1;
for(long long int i=2;i<=n/i;i++){
if(n%i==0){
a=i;b=n/i;
if(a+b-2 < mini)mini=a+b-2;
}
}
cout<<mini;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 1 | 70,218,863 |
#include<iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int t;
cin >> t;
while (t--) {
int y, m, d;
cin >> y >> m >> d;
int res = (999 - y) * 200 + (10 - m) * 20 + (21 - d);
rep (i, 1000) if (i % 3 > 0) rep (j, 10) if (j % 2 == 1) {
if (y < i || (y ... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all... | 1 | 29,521,411 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a, b;
int main() {
cin >> a >> b;
if(a > b) swap(a, b);
puts(b-a < 2 ? "Brown" : "Alice");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long X, Y;
cin >> X >> Y;
if (abs(X-Y) <= 1) cout <<"Brown\n";
else cout << "Alice\n";
} | 1 | 32,183,799 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1e9+7
int main(){
string s,t;
cin >> s >> t;
reverse(s.begin(),s.end());
reverse(t.begin(),t.end());
rep(i,s.size()){
bool flag=tr... | #include<iostream>
#include<vector>
#include<string>
#include<set>
int main(){
std::string S, T;
std::cin >> S >> T;
std::vector<int> possible;
std::set<std::string> st;
for(int i = 0; i < S.size() - T.size() + 1; i++){
int j;
for(j = 0; j < T.size(); j++){
if(S[i + j] !=... | 1 | 34,359,383 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define rep(i,n,z) for(int i=z;i<n;i++)
#define rrep(i,z) for(int i=z;i>=0;i--)
#define nl cout<<endl
#define vi vector<int>
#define vlli vector<long long int>
#define umap un... | #include <bits/stdc++.h>
#define TYPE(c) remove_reference_t<decltype(c)>
#define REP(i, n) for(TYPE(n) i = 0; i < n; i++)
#define FOR(v, c) for(TYPE(c.begin()) v = c.begin(); v != c.end(); v++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(ALL(c), greater<TYPE(c)::value_ty... | 1 | 86,477,085 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,D,X;
cin >> N >> D >>X;
vector<int> vec(N);
for(int i=0;i<N;i++){
cin >>vec.at(i);
}
int count=0;
for(int j=0;j<N;j++){
if(vec.at(j)==1){
if(N==1){
count++;
continue;
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, d, x;
cin >> n >> d >> x;
vector<ll> A(n);
for (auto & a : A) cin >> a;
ll res = x;
for (auto a : A) {
res += 1 + ((d-1)/a);
}
cout << res << endl;
} | 1 | 64,855,794 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int N,K,ans;
cin >> N >> K;
ans = N+1-K;
cout << ans;
} | #include <iostream>
using namespace std;
int main()
{
int n,k,i,j;int count=0;
cin>>n>>k;
for(i=1;i<=n;i++)
{ int p=0;
for(j=i;j<=n;j++)
{ p++;
if(p==k)
break;
}
if(p==k)
count++;
}
cout<<count<<endl;
return 0;
} | 1 | 76,805,438 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int s;
cin >> s;
long long int n=1000000000;
cout << 0 << " " << 0 << " " << n << " " ;
long long int a=(s+n-1)/n,b=-s+n*a;
cout << b << " " << 1 << " " << a;
cout << endl;
} | #include<cstdio>
#include<cstdio>
#include<cstring>
#include<set>
#include<queue>
#include<algorithm>
#define N 1005
#define INF 0x3f3f3f3f
using namespace std;
long long int a,b,x,y;
long long int exgcd(long long int a,long long int b,long long int &x,long long int &y){
if(b==0){
x=1;
y=0;
return a;
}
long long int an... | 1 | 7,614,615 |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
class Dice
{
private:
int surf[6];
public:
void set_surf(int* input);
void roll(char orient);
void disp_top();
void disp_right(int tp, int fw);
};
void Dice::set_surf(int* input)
{
memcpy(surf, input, 6*sizeo... | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
class Dice {
public:
int n[6];
Dice() {
for (int i = 0;i<6;i++) {
cin >> n[i];
}
}
int N() {
int x;
x = n[0];
n[0] = n[1];
n[1] = n[5];
n[5] = n[4];
n[4] = x;
return n[0];
}
int E() {
int x;
x = n[0];
n[0] = ... | 1 | 11,412,634 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int,int> &a, pair<int,int> &b) {
if ( a.first==b.first ) {
return a.second < b.second;
}
return a.first>b.first;
}
int main() {
int n, h;
cin >> n >> h;
vector<pair<int,int>> v(n);
for ( int i=0; i<n; i++ ) {
cin >>... | #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 | 41,200,615 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef p... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbeg... | 1 | 98,025,512 |
#include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int math_number = 0;
cin >> math_number;
int total_math_number = math_number * math_number;
int white_math;
cin >> white_math;
int black_math = total_math_number - white_math;
cout << black_math << endl;
} | 1 | 65,767,929 |
#include<stdio.h>
int main(){
char input1[102];
char input2[102];
scanf("%s %s", input1, input2);
printf("%s%s\n", input2, input1);
return 0;
} | #include <iostream>
#include<map>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
string A,B;
cin >> A >> B;
cout << B << A << endl;
return 0;
} | 1 | 17,147,968 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
ll n,k;
pair<ll,ll> a[100005];
ll cnt;
signed main(){
ios_base::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int N;
long K;
cin >> N >> K;
vector<int> A(N);
vector<int> B(N);
vector<pair<int, int>> P(N);
int a;
int b;
rep(i, N)
{
cin >> a >> b;
P.at(i) = pair<i... | 1 | 56,491,422 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int N, K;
cin >> N;
cin >> K;
vector<long long int> P(N + 1);
vector<long long int> C(N + 1);
long long int i, j;
for (i = 1; i < N + 1; i++)
{
cin >> P[i];
}
for (i = 1; i < N + 1; i++)
{
ci... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 1 | 1,283,685 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
b -= a;
if (b <= 0) cout << "delicious";
else if (0 < b && b <= x) cout << "safe";
else cout << "dangerous";
} | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(c-b <= 0){
cout << "delicious" << endl;
}
else if(c-b > 0 && c-b <= a){
cout << "safe" << e... | 1 | 65,598,382 |
#include<bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forN(i, n) for(int i = 0; i <n ; ++i)
#define endl "\n"
#define noob (main)
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S="";
string T="";
cin >> N >> S;
if(N%2 == 0){
for (int i=0;i<N/2;++i){
T += S[i];
}
if(S == (T+T)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}else{
cou... | 1 | 77,945,797 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,A,B;
cin >> K;
cin >> A >> B;
for(int i=A;i<B+1;i++) {
if(i%K==0) {
cout << "OK" << endl;
exit(0);
}
}
cout << "NG" << endl;
} | 1 | 33,843,514 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define pi 3.1415926
#define eps 0.000001
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define rif(i, a, b) for (int i = a; i >= b; i--)
#define init_h m... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
#define int long long
using namespace std;
inline int read(){
int x=0,w=0;char c=getchar();
while(!isdigit(c))w|=c=='-',c=getchar();
while(isdigit(c))x=(x<<1)+(x<<3)+(c^48),c=getchar();
return w?-x:x;
}
int a,b,ans;
signed main(){
a=ans=read();... | 1 | 68,455,665 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(ll i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll a,b;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll A, B;
cin >> A >> B;
ll ans = 0;
ll N = 50;
ll x = 2;
ans = (((B+1) / 2) - (A/2)) % 2;
for (int i = 1; i < N; i++) {
ll a = 0, b = 0;
if (A % (x*2) >= x) {
a = x - (A % x);
}
if (B % (x*2) >= x) {
... | 1 | 47,465,082 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
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());
int sum = a[n - 1] - a[0];
for (int i = 1; i < n - 1; i++) {
sum += abs(a[i]);
}
... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
using std::cin;
using std::cout... | 1 | 47,114,440 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (b == 1) b = 14;
if (a == 1) a = 14;
if (a > b) cout << "Alice\n";
else if (b > a) cout << "Bob\n";
else cout << "Draw\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A != 1 && B != 1 && A > B) {
cout << "Alice" << endl;
} else if (A != 1 && B != 1 && A < B) {
cout << "Bob" << endl;
} else if (B == 1 && A > B) {
cout << "Bob" << endl;
} else if (B == 1 && A < B) {
cout... | 1 | 43,458,917 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
main() {
string s; cin >> s;
int opt{}, cur{};
vector<int> dp(1 << 26, INF);
dp[0] = 0;
for (auto&& c : s) {
cur ^= 1 << (c - 'a');
opt = dp[cur];
for (int i = 0; i < 26; i++) opt = min(opt, dp[cur ^ (1 << i)]);
dp[cur] = min(d... | #include <iostream>
#include <map>
#include <string.h>
#include <vector>
using namespace std;
const int MAX_N = 2e5;
int dp[1 + MAX_N];
char s[1 + MAX_N];
int bin[1 + MAX_N];
map<int, int> f;
const int SIGMA = 'z' - 'a' + 1;
int main() {
cin >> ( s + 1 );
int n = strlen( s + 1 );
for ( int i = 1; i <= n; i ... | 1 | 64,259,626 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
fastIO
ios::sync_with_stdi... | #include <bits/stdc++.h>
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 int ... | 1 | 48,756,415 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
#define PI 3.14159265358979323846264338327950L
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const ... | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
set<long long> a = {1,3,2};
long long b;
cin >> b;
long long c;
cin >> c;
a.erase(b);
a.erase(c);
cout << *a.begin() << '\n';
return 0;
} | 1 | 74,241,328 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef vector<int> vi;
const int mod = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(fa... | 1 | 3,084,178 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
ll A[100010];
int main()
{
... | #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> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
vector<ll> cum(n);
cum[0] = a[0];
for (int i = 1; i < n; ++i) cum[i... | 1 | 80,690,748 |
#include <bits/stdc++.h>
using ll = long;
using namespace std;
int main(){
ll m, k; cin >> m >> k;
if (1ll<<m <= k) { cout << -1 << "\n"; return 0; }
if (m == 1 && k == 1) { cout << -1 << "\n"; return 0; }
if(m == 1 && k == 0) { cout << "0 0 1 1" << "\n"; return 0; }
for (ll i = 0; i < (1ll<<m); i++) ... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | 1 | 12,422,361 |
#include<stdio.h>
int main(){
int a,b;
int i;
scanf("%d%d",&a,&b);
if(a>b){
for(i=0;i<a;i++){
printf("%d",b);
}
}else{
for(i=0;i<b;i++){
printf("%d",a);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ( a > b ) { swap(a, b); }
while ( b-- > 0 ) {
cout << a;
}
cout << endl;
return 0;
} | 1 | 7,561,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,k;
cin >> n >> k;
vector<int>a(n);
vector<int>b(200010);
rep(i,n)cin >> a.at(i);
rep(i,n) b.at(a.at(i))++;
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 1 | 57,976,564 |
#include <stdio.h>
int main(void)
{
int m,f,r;
int su;
do{
scanf("%d%d%d",&m,&f,&r);
su = m + f;
if(m == -1 && f == -1 && r == -1)
break;
else if(m == -1 || f == -1)
putchar('F');
else if(su >= 80)
putchar('A');
else if(su >= 65 && su < 80)
putchar('B');
else if... | #include <stdio.h>
int main(){
int m, f, r, som;
while(1){
scanf("%d", &m);
scanf("%d", &f);
scanf("%d", &r);
som = m + f;
if(m == -1 && f == -1 && r == -1)
return 0;
if(m == -1 || f == -1)
printf("F\n");
else if(som >= 80)
printf("A\n");
else if(80 > som && som >= 65)
printf("B\n");
else if(65 > so... | 1 | 29,208,480 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int ajou, asu, ari, aei, S ;
int bjou, bsu, bri, bei, T ;
scanf("%d%d%d%d", &ajou, &asu, &ari, &aei);
scanf("%d%d%d%d", &bjou, &bsu, &bri, &bei);
S = ajou + asu + ari + aei ;
T = bjou + bsu + bri + bei ;
if(S>T)
{
printf("%d\n",S);
}els... | #include<iostream>
using namespace std;
int main(){
int a[4];
int b[4];
int x=0,y=0;
for(int i=0;i<4;i++){
cin >> a[i];
x=x+a[i];
}
for(int t=0;t<4;t++){
cin >> b[t];
y=y+b[t];
}
if(x>=y){
cout << x;
}else{
cout << y;
}
cout << endl;
return 0;
} | 1 | 38,275,048 |
#include <iostream>
#include <cassert>
#include <queue>
#include <cmath>
#define INF 922337203685477580
typedef long long ll;
using namespace std;
typedef struct {
double x, y;
} Point;
void solve(int d, Point p1, Point p2) {
if (d == 0) return;
Point s, t, u;
t.x = (p1.x + 2 * p2.x) / 3;
t.y = (p1.y + 2 * p2... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 1 | 88,535,091 |
#pragma region
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i,... | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto i = 0; i < n; i++) cin >> a[i];
int64_t ans = INT64_MAX;
for (auto i = 0; i ... | 1 | 39,108,063 |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define endl '\n'
#define mid (l + r >> 1)
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define ls rt << 1
#define rs rt << 1 | 1
using namespace std;
typedef long long ll;
typedef uns... | #include<bits/stdc++.h>
using namespace std;
inline long long read()
{
long long f = 1,x = 0;
char ch;
do
{
ch = getchar();
if(ch == '-') f = -1;
}while(ch < '0' || ch > '9');
do
{
x = (x<<3) + (x<<1) + ch - '0';
ch = getchar();
}while(ch >= '0'&&ch <= '9');
return f*x;
}
long long n,x;
int main()
{
... | 1 | 65,980,323 |
#include<bits/stdc++.h>
#define ll long long
#define d double
#define ld long double
#define vi vector<int>
#define vul vector<ull>
#define vl vector<ll>
#define pb push_back
#define si set<int>
#define sl set<ll>
#define yes cout<<"YES\n"<<endl
#define no cout<<"NO\n"<<endl
#define ys cout<<"Yes\n"<<endl
#define test ... | #include<iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N,K,cnt = 0 ;
cin>>N>>K;
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
sort(a,a+N);
for(int i = 0;i<K;i++){cnt=cnt+a[i];}
cout << cnt ;
return 0;
} | 1 | 57,709,763 |
#include<iostream>
#include<set>
using namespace std;
int main(){
while(1){
int n;
cin>> n;
if(n==0) break;
string f[n];
for(int i=0; i<n; i++) cin>> f[i];
int left, right;
int up=1, down=0;
left=right=down;
int next=up;
int cnt=0;
... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;... | 1 | 52,639,502 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
int main(){
int K,X;
cin >> K >> X;
if(500*K>=X){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long long ull;
typedef long double ld;
int main(){
int a,b;
cin >> a >> b;
if(500*a>=b)
cout << "Yes";
else
cout << "No";
return 0;
} | 1 | 42,793,784 |
#include <iostream>
using namespace std;
char getgrade(int m, int f, int r){
char grade;
if (m == -1 || f == -1) {
grade = 'F';
} else if (m + f >= 80) {
grade = 'A';
} else if (m + f >= 65) {
grade = 'B';
} else if (m + f >= 50) {
grade = 'C';
} else if (m + f >= 30 ) {
if ( r >= 50) {
... | #include <iostream>
using namespace std;
int main(void){
int m,f,r;
while(1){
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1){
break;
}
else if(m == -1 || f == -1){
cout << "F";
}
else if(m + f >= 80){
cout << "A";
... | 1 | 82,114,323 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <typename T>
bool PN(T x)
{
if (x <= 1)
return false;
if (x == 2)
return true;
for (int i = 2; i < sqrt(x) + 1; i++)
if (x % i == 0)
return false;
return true;
}
const long long MOD = 1e9+7;
void solve()
{
ll n, k;... | 1 | 48,201,105 |
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
static const int N = 100;
static const int WHITE = 0;
static const int GREY = 1;
static const int BLACK = 2;
int n, m[N][N];
bool visited[N];
int d[N], dist;
void bfs(int i){
queue<int> q; q.push(i);
visited[i] = true;
while... | #include <cstdio>
void search(int (*A)[101], int *dis, int n){
int hoge;
int time=0;
for(int k=1;k<n;k++){
hoge = 1;
for(int i=1;i<=n;i++){
if(dis[i]==time){
for(int j=1;j<=n;j++){
if(A[i][j]&&dis[j]<0){
dis[j]=time+1;
... | 1 | 71,122,677 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
char str1[1000],str2[1000],str3[1000];
scanf("%s %s",str1,str2);
strcpy(str3,str1);
strcat(str1,str3);
if(strstr(str1,str2)==NULL) printf("No\n");
else printf("Yes\n");
return 0;
} | #include<iostream>
#include<cstring>
using namespace std;
int main(){
char s[200],p[100];
cin>>s>>p;
char s2[100];
strcpy(s2,s);
strcat(s,s2);
if( strstr(s,p)!=NULL)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 33,255,269 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#defin... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 1 | 25,741,380 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#de... | 1 | 37,069,038 |
#include <iostream>
#include <map>
int main(void){
std::string S, ans="yes";
std::cin >> S;
std::map<char, int> mp;
for (char c: S){
if (mp.find(c) == mp.end()){
mp[c] = 0;
} else {
ans = "no";
break;
}
}
std::cout << ans << std::endl;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 | 40,027,733 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main(){
ll n, k;
cin >> n >> k;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll ans = 0;
for(ll l = 0; l < k + 1; l++){
for(ll r = 0; r < k - l + 1; r... | 1 | 31,519,301 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n... | 1 | 77,653,493 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool ans = false;
if(S.at(0) == S.at(1) && S.at(2) == S.at(3) && S.at(0) != S.at(2)) {
ans = true;
}
else if(S.at(0) == S.at(2) && S.at(1) == S.at(3) && S.at(0) != S.at(1)) {
ans = true;
}
else if(S.at(0) == S.at(3) &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 1 | 61,622,063 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.