code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw\n";}
else if((a<b&&a!=1)||b==1)
{
cout<<"Bob\n";
}
else
{
cout<<"Alice\n";
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> next(n), c(n);
for (int i = 0; i < n; ++i) {
cin >> next[i]; next[i]--;
}
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
long long ans = -1e17;
for (int i = 0; i... | 0 | 49,742,503 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, m, v, p;
vector <int> a;
bool check(int idx){
int tar = a[idx] + m;
if(tar < a.back()) return 0;
ll sum = 0;
for(int i = idx + 1 ; i < n ; i++){
sum += tar - a[i];
}
if... | 0 | 80,813,176 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<vector<int> > v(n,vector<int>(3));
for(int i=0;i<n-1;i++)
cin>>v[i][0]>>v[i][1]>>v[i][2];
int t;
for(int i=0;i<n-1;i++){
t=v[i][1];
for(int j=i;j<n-2;j++){
t+=v[j][0];
t=max(t,v[j+1][1]);
if(t%v[j+1][2]!=0)
t+=v[j+1][2... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
const ll MOD = 1e9 + 7;
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll ans = 0;
rep(bit, 61) {
int one = 0, zero = 0;
rep(i, n) {
if... | 0 | 20,595,341 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
const int INF = 100100100;
using namespace std;
int main()
{
int A,B;
bool res=false;
cin >> A>>B;
if(A%3==0) res=true;
if(B%3==0) res=true;
if((A+B)%3==0) res=true;
if(res) cout << "Possible" << endl;
else cout << "Impossible" << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
using namespace std;
static const int INF = 1e9;
int d[11];
struct edge
{
int from;
int to;
int cost;
};
void BellmanFord()
{
int n;
while (cin >> n, n)
{
vector<edge> E;
for (int i = 0; i < n; ++i)
{
int fr... | 0 | 5,574,410 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace st... | #include <bits/stdc++.h>
using namespace std;
int keta(int64_t x) {
int ans=0;
while (x>0) {
x /= 10;
ans++;
}
return ans;
}
int main() {
int64_t N;
cin >> N;
int64_t p;
int64_t sum=1;
int finish = 1;
int64_t INF = pow(10, 18);
vector<int64_t> V(N);
for (int64_t i=0; i<N; i++) {
cin ... | 0 | 18,458,912 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
int main()
{
abc_164a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && S[4] == S[5]) cout << "Yes\n";
else co... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 15,432,402 |
#include <bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define MK make_pair
#define PB push_back
#define fi first
#define se second
typedef long long LL;
typedef pair<int, int> PII;
const int N=1e5+10 ;
int a[1000][1000];
int main(){
#ifdef che
freopen("input.txt","rt",stdin);
f... | #include<bits/stdc++.h>
#define lld long long int
#define ld long double
#define mod 1000000007
#define modd 998244353
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(lld i=a;i<=b;i++)
#define repr(i,a,b) for(lld i=a;i>=b;i--)
#define ar array
#define pb push_back
#define mp make_pair
#define ios ios_base::sync... | 0 | 26,379,609 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pi> vpi;
typedef vector<vi> vii;
typedef map<int, int> mp;
typedef multiset<int> mset;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
ll n, a, b;
cin >> n >> a >> b;
if (a >= n) cout << n << endl;
else {
if (a + b >= n) {
cout << a << endl;
}
else {
ll ans = 0;
ans +... | 0 | 75,040,406 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
int L[100000], R[100000];
cin >> N >> M;
int min = 0;
int max = N;
for(int i = 0; i < M; i++)
{
cin >> L[i] >> R[i];
if (L[i] > min) min = L[i];
if (R[i] < max) max = R[i];
}
int total = 0;
if ((max - min) >= 0)
{
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
using namespace std;
int main()
{
int n;
cin >> n;
int one = n/100;
int two = n%100/10;
int three = n%100%10;
if(one == 1)
{
cout << 9;
}
else if(one == 9)
... | 0 | 2,403,134 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #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 rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 67,860,851 |
#include<iostream>
#include<deque>
#include<cmath>
#include<cstring>
#include<map>
#include<algorithm>
#include<vector>
#include<ios>
using namespace std;
#define ive(cris) int long long
#define in(out) long double
#define INF 100000007
int main(){
int a;
cin>>a;
if(a<1200){
cout<<"ABC"<<'\n';
}else{
c... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 93,930,827 |
#include<iostream>
using namespace std;
int makeFibonacci(int n) {
int a[100];
a[0] = 1;
a[1] = 1;
for (int i = 2;i <= n ;i++) {
a[i] = a[i - 2] + a[i - 1];
}
return a[n];
}
int main(void) {
int n;
cin >> n;
int ans = makeFibonacci(n);
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
ll n, m; cin >> n >> m;
vector<string> a(n); rep(i,n) cin >> a[i];
vector<string> b(m); rep(i,m) cin >> b[i];
if(n-m == 0 && a == b){
... | 0 | 35,032,119 |
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#includ... | #include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
int Q;
int main() {
cin >> Q;
for (int i = 0; i < Q; i++) {
ll A, B;
cin >> A >> B;
if (A == B) {
cout << (A - 1) * 2 << endl;
}
else {
ll root = sqrtl(A * B - 1);
ll ans = root * 2 - 1;
if ((A * B - 1) / root == root)... | 0 | 4,651,529 |
#include <iostream>
#include <cmath>
using namespace std;
void solve(long long even , long long odd , long long p , long long n){
long long ans = 0;
if(even == n){
if(p == 0){
ans = pow(2 , n);
}
else if(p == 1){
ans = 0;
}
}
else{
ans = pow(2 , n-1);
}
cout << ans << endl;
}
int main(){
long l... | #include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int,int> > vp;
int main()
{
while(1)
{
string s;
getline(cin,s);
if(s==".") break;
stack<cha... | 0 | 8,744,267 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define SaveTime ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mx *max_element
#define mi *min_element
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n;i++)
#define fm for(int j =0... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | 0 | 58,146,043 |
#include <iostream>
using namespace std;
int main() {
long long n;
cin >> n;
long long l_prev = 2;
long long l_curr = 1;
if (n == 0) {
cout << 2 << endl;
return 0;
}
if (n == 1) {
cout << 1 << endl;
return 0;
}
for (int i = 2; i <= n; i++) {
long long tmp = l_curr;
l_curr = l_c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-1; ... | 0 | 80,486,882 |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX_N = 100;
int max(int n, int a[]){
int j, k = 0;
for(j = 0; j < n; j++){
if(a[j] > k){
k = a[j];
}
}
return k;
}
int min(int n, int b[]){
int j, k = 100000000;
for(j = 0; j < n; j++){
if (b[j] < k) {
k = b[j];
}
}
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
int n = (N - 1) / (K - 1);
if ((N - 1) % (K - 1)) n++;
cout << n << endl;
} | 0 | 94,053,111 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
int main(){
ll s;
cin>>s;
set<ll> list;
list.insert(s);
ll size=list.size();
rep(i,1000000){
if(s%2==0)s=s/2;
else s=3*s+1;
list.insert(... | 0 | 78,033,253 |
#include<stdio.h>
int main()
{
int i,j,n,a[100000],z;
scanf("%d",&n);
if(n>0&&n<=9)
{
printf("%d\n",n);
}
else if(n>=10&&n<=99)
{
printf("9\n");
}
else if(n>=100&&n<=9999)
{
if(n<=999)
{
z ... | #include <string.h>
#include <stdio.h>
int main (){
char input[101],temp;
scanf ("%s",input);
for (int i=0; i < strlen(input);i++){
if (input[i]== ','){
printf(" ");
}
else {
printf("%c",input[i]);
}
}
return 0;
} | 0 | 18,013,119 |
#include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define tarce(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#defin... | #include <bits/stdc++.h>
using namespace std;
int main() {
long a,b;
cin >> a >> b;
vector<string> ans(100,"");
for(long i=0;i<100;i++) ans[0]+=".";
for(long i=0;i<100;i++) ans[99]+="#";
for(long i=1;i<99;i++) {
ans[i]=".";
for(long j=0;j<49;j++) {
ans[i]+="#";
}
for(long j=0;j<49;j++)... | 0 | 46,306,451 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
char b;
cin >> b;
if (b == 'A')
puts("T");
if (b == 'T')
puts("A");
if (b == 'C')
puts("G");
if (b == 'G')
p... | #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() {
int n;
ll sum = 0;
cin >> n;
v... | 0 | 88,789,230 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
ll mod_pow(ll x,ll n,ll mod) {
ll res=1;
while(n>0) {
if(n&1) {
res=res*x%mod;
}
x=x*x%mod;
n>>=1;
}
return res;
}
int main() {
ll X,Y;
cin>>X>>Y;
if(X>2*Y||Y>2*X) {
cout<<0<<endl;
return 0;
}... | #include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define Int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | 0 | 49,084,692 |
#include<bits/stdc++.h>
using namespace std;
#define rep(a,b) for(int i=a;i<b;++i)
int main() {
int N;
int cnt = 0;
cin >> N;
int max_cnt = -1;
int ans = -1;
rep(1, N+1) {
int cnt = 0;
int y = i;
while (y%2 == 0) {
y /= 2;
++cnt;
}
if (max_cnt < cnt) {
max_cnt = cnt;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 49,826,769 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d... | 0 | 3,185,332 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, ss=0, fin=0;
cin >> A >> B >> C;
set<int> S;
for (int i=1; i<=100000; i++) {
if (A*i%B==C) {
fin=1;
break;
}
}
if (fin==1) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} | #include<iostream>
int main(){
int dice[6],q,qnum[2];
for(int i=0; i<6; i++){
std::cin>>dice[i];
}
std::cin>>q;
for(int i=0; i<q; i++){
std::cin>>qnum[0]>>qnum[1];
if( qnum[0]==dice[3] && qnum[1]==dice[1]){
std::cout<<dice[0]<<std::endl;
}else if( qnum[0]=... | 0 | 75,199,560 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
char line[36][2],line2[36][2];
int time;
cin >> time;
for (int i = 0; i < time; ++i) {
cin >> line[i][0] >> line[i][1];
line2[i][0] = line[i][0];
line2[i][1] = line[i][1];
}
for (int i = 0; i < time - 1; ++i) {
for (int i2 = time - 1... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | 0 | 86,058,983 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> as(n + 1), bs(n);
rep(i, n + 1) cin >> as[i];
rep(i, n) cin >> bs[i];
ll ans = 0;
rep(i, n) {
ll l = min(as[i], bs[i]);
ans += l;
a... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,i,j,p,q;
cin>>n>>k;
set<int>x;
for(i=0;i<k;i++)
{
cin>>p;
for(j=0;j<p;j++)
{
cin>>q;
x.insert(q);
}
}
cout<<n-x.size()<<endl;
return 0;
} | 0 | 19,456,605 |
#include <bits/stdc++.h>
using namespace std;
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;
}
void solve()
{
int n; cin >> n;
int letter[n][26] ={};
for(int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
vector<ll> S(N+1, 0);
... | 0 | 72,734,037 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int64_t>A(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
sort(A.begin(),A.end());
int left=-1; int right=N; int mid;
while(1<right-left){
mid=left+(right-left)/2;
int64_t sum=0;
for(int i=0;i<=mid;i++)
sum+=A.at(i);... | #include <iostream>
#include <stdio.h>
using namespace std;
int ar[200], n;
long long findTotal(int val) {
long long int ans = 0;
for(int i = 0; i < n; i++){
ans += (val - ar[i]) * (val - ar[i]);
}
return ans;
}
int main() {
cin >> n;
int lo = 1e9, hi = -1;
for(int i = 0; i < n; i++) {
cin >> ar[i];
lo = a... | 0 | 32,530,980 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int N; cin >> N;
int A[N];
rep(i,N){
cin >> A[i];
}
double ans = 0;
rep(i,N){
ans += (double)1 / A[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll func2(ll n){
ll res = 0;
while(n%2 == 0){
n /= 2;
res++;
}
return... | 0 | 74,114,102 |
#include <iostream>
#include <string>
using namespace std;
string s, t;
int main() {
int N; cin >> N;
cout << 0 << endl;
cin >> s;
if(s == "Vacant") {
return 0;
}
int l = 0, r = N;
while(t != "Vacant") {
int mid = (l+r) / 2;
cout << mid << endl;
cin >> t;
if(mid % 2^s == t) l = mid;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
bool cmp1(PII p1, PII p2) {
if (p1.first < p2.first) return true;
if (p1.first > p2.first) return false;
return p1.second < p2.second;
}
bool cmp2(PII p1, PII p2) {
if (p1.first > p2.first) return true;
if (p1.first < p... | 0 | 34,861,810 |
#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 cnt_digits(ll N){
int digits=0;
while(N>0){
N/=10;
digits++;
}
return digits;
}
int main(){
ll N;
cin >> N;
int ans=cnt_digits(N);
for(ll A=1LL;A*A<=N;++A... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 | 41,839,699 |
#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 REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++... | 0 | 82,791,945 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n[4];
cin >> n[0] >> n[1] >> n[2] >> n[3];
sort(n,n+4);
if(n[0] == 1 && n[1] == 4 && n[2] == 7 && n[3] == 9){
cout << "YES" << endl;
} else{
cout << "NO" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , k , h[N] , f[N];
int main()
{
cin >> n >> k;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
f[i] = INT_MAX;
}
f[1] = 0;
for(int i = 2 ; i <= n; ++i)
{
for(int j = 1 ; j <= k; ++j)
{
... | 0 | 32,876,291 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a ;
b=a%1000;
c=a-a%10;
if(b%111==0||c%111==0)
{
cout << "Yes"<< endl;
}
else{
cout << "No"<< endl;
}
} | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(){
int n,m,pi;
cin >> n >> m;
int correct = 0, penalty = 0;
int done[n] = {};
string si;
for (int i=0; i<m;i++){
cin >> pi >> si;
if ((si == "AC") && (done[pi-1] != -1)) {
penalt... | 0 | 78,411,414 |
#include <iostream>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
int ans = 0;
int MAX = max(A, max(B,C));
int MIN = min(A, min(B,C));
int MED = A+B+C-MAX-MIN;
if((MAX%2) == ((A+B+C)%2)){
cout << MAX-MED+(MED-MIN)/2;
}else{
cout << MAX-MED+(MED-MIN)/2+2;
}
return 0;
} | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int N =1e4+5;
int n,k,x,y;... | 0 | 69,627,426 |
#include <iostream>
using namespace std;
int main()
{
int h, w;
while (1) {
cin >> h >> w;
if (!h && !w) break;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << "#";
}
cout << '\n';
}
cout << '\n';
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
vector<int> num ={2,5,5,4,5,6,3,7,6};
vector<bool> use(9,false);
const ll INF = ll(1e18)+5;
ll dp[int(1e4)+5];
ll dfs(ll N){
if(N<0){
return -INF;
}
if(N==0){
return 0;
}
if(dp[N] != -1){
return dp[N];
}
... | 0 | 1,813,667 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int string_distance(const string s, const string t) {
const auto n = s.size();
const auto m = t.size();
vector<vector<int>>dp(n + 1, vector<int>(m + 1, 0));
for (int i = 0; i <= n; i++) {
dp[i][0] = i;
}
for (int j = 1; j <= m; j++) {
... | #include<bits/stdc++.h>
using namespace std;
typedef complex<double> base;
typedef long double ld;
typedef long long ll;
#define endl "\n"
#define pb push_back
#define pii pair<int,int>
#define pll pair< ll , ll >
#define vi vector<int>
#define vvi vector< vi >
const int MAXN=(int)(2e5+5);
const ll MOD=(ll)(1e9+7);
int... | 0 | 53,389,910 |
#include <stdio.h>
int main()
{
while(true)
{
int w,h;
scanf("%d %d", &h, &w);
if(0==h&&0==w)
break;
for(int i = 0; i < h; ++i)
{
for(int j = 0; j <w; ++j)
{
if(i==0||i==h-1)
{
printf("#");
}
else
{
if(j==0||j==w-1) printf("#");
else printf(".");
}
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <tuple>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int n,m;
cin >> n >> m;
int ac_num=0,wa_num=0;
vector<int> judge(n);
vector<int> wa(n);
... | 0 | 16,242,144 |
#include<iostream>
#include<string>
#include<vector>
struct data_set
{
std::string str;
int appearance, length;
data_set(const std::string&_str)
{
str = _str;
for (auto&i : str)
{
if ('A' <= i && i <= 'Z')
{
i += 'a' - 'A';
}
}
appearance = 1;
length = static_cast<int>(str.length());
}
};
... | #include<cstdio>
#include<cstring>
using namespace std;
const int w=20003;
char s[10005];
int x,y,_x,len,p,sum,q,now=1;
bool ws[2][2][40009];
int main(){
register int i;
scanf("%s%d%d",s+1,&x,&y),len=strlen(s+1),x+=w,y+=w;
while(now<=len&&s[now]=='F')++now,++_x;
ws[0][0][w+_x]=1,ws[1][0][w]=1;
while... | 0 | 35,739,161 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct subject{
int math;
int info;
int science;
int eng;
};
int main(){
subject A,B;
cin >> A.info >> A.math >> A.science >> A.eng;
cin >> B.info >> B.math >> B.science >> B.eng;
cout << max(A.info+A.math+A.science+A.eng,B.info+B.m... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 0 | 65,628,768 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
unsigned long long N;
cin >> N;
int ans = 0;
int count = 0;
for (int n = 1; n <= sqrt(N); ++n)
{
if (N % n == 0)
{
int B = N / n;
for (int i = 0; ... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
ll g... | 0 | 87,322,263 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int a,x;
cin >> x >> a;
cout << (x < a ? 0 : 10) << endl;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
string s, t;
cin >> n >> s >> t;
for(int i = 0; i < n; ++i)
{
cout << s[i] ... | 0 | 42,481,159 |
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int q;
string X, Y;
int dp[1000][1000];
int solve(int idx_x, int idx_y) {
if (idx_x < 0 || idx_y < 0)
return 0;
if (dp[idx_x][idx_y] != -1)
return dp[idx_x][idx_y];
int ret;
if (X[idx_x] == Y[idx_y]) {
ret = solve(idx_x - ... | #include <iostream>
#include <algorithm>
int main(){
int x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
int dx, dy;
if ((x2 >= x1) && (y2 >= y1)){
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x3 - (x2 - x1);
y4 = y3 - (y2 - y1);
} else if ((x1 > x2) && ... | 0 | 11,756,948 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#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(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <math.h>
#include <queue>
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
v... | 0 | 36,828,692 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int inf =1000000000;
int main() {
int a[3];
rep(i,3) cin>>a[i];
sort(a, a+3);
int x = a[0] + a[2] - a[1];
if((a[2]-x)%2)
x = (a[2] - x) / 2 + 2;
else
x = (a[2] - ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) ((a+b-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define MOD 1000000007... | 0 | 97,594,822 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define itrdebug(x) cerr << #x ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
signed main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
rep(i, n) cin >> p[i], p[i]--;
rep(i, n) cin >> c[i];
ll ans = -1001001001;
rep (i, n) {
int now = i;
vector<ll> vs;
... | 0 | 80,673,505 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <math.h>
using namespace std;
typedef long long ll;
string beautify(string str) {
string ret = "";
for (int i = 0; i < str.size(); ++i) {
char c = str[i];
if ('a' <= c && c <= 'z') ret += c;
else if ('A' <= c && c <= 'Z') ret ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typename T>
static inline void chmin(T& ref, c... | 0 | 10,479,151 |
#include <bits/stdc++.h>
#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(i,0,(n))
#define REPS(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) RFOR(i,0,(n))
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2e3+10;
const int MOD = 1e9+7;
int s[MAX], t[MAX];
long long dp[MAX][MAX];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for(int i=1;i<=n;++i)
cin >> s[i];
for(int i=1;i<=m;++i)
cin >> ... | 0 | 57,234,322 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int a,b; cin >> a >> b;
if(a <= b){cout << "unsafe" << endl;}
else {cout << "safe" << endl;}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<... | 0 | 38,957,339 |
#include <bits/stdc++.h>
using namespace std;
class unionfind {
vector<int> par;
public:
unionfind(int n) {
for (int i = 0; i < n; i++) {
par.push_back(i);
}
}
int find(int n) {
if (n == par.at(n)) return n;
return par.at(n) = find(par.at(n));
}
void merge(int m, int n) {
m = find(... | #include <iostream>
#include <string>
using namespace std;
int main(){
char a[5] = {'a', 'e', 'i', 'o', 'u',};
char c; cin >> c;
for(int i = 0; i < 5; i++){
if(c == a[i]){
puts("vowel");
return 0;
}
}
puts("consonant");
return 0;
} | 0 | 61,831,963 |
#include<iostream>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
S.push_back(T.at(S.size()));
if(S == T){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || ... | 0 | 10,553,971 |
#include<iostream>
using namespace std;
int main(){
int n=0,kaisu=0;
while(cin>>n){
for(int a=0;a<10;a++){
for(int b=0;b<10;b++){
for(int c=0;c<10;c++){
for(int d=0;d<10;d++){
if(a+b+c+d==n){
kaisu++;
}
}
}
}
}
cout<<kaisu<<endl;
kaisu=0;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define MP make_pair
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tu... | 0 | 51,635,488 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
int x3=y1-y2+x2;
int y3=x2-x1+y2;
int x4=x3-(x2-x1);
int y4=y3-(y2-y1);
cout<<x3<<" "<<y3<<" "<<x4<<" "<<y4<<" "<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
scanf("%d %d", &n, &k);
int ans = 1;
for (int i = 1; i <= n; i++){
if (ans <= k)
ans <<= 1;
else
ans += k;
}
printf("%d\n", ans);
return 0;
} | 0 | 68,813,418 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | 0 | 41,179,723 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,a;
cin>>n;
vector<int>v;
double sum=0;
for(int i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
sum+=a;
}
int x=ceil(sum/n);
int y=flo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bo... | 0 | 41,600,955 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define F(x) for(int i=1;i<=(x);i++)
#define fer(i,n) for(int i=1;i<=(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
long long int dist[200005];
long long int visited[200005];
int main()
{
ll n,m;
cin >> n >> m;
vector< vector <ll > >adj(n);
for(ll i=0;i<n-1;i++)
{
ll x,y;
cin >> x >> y;
x--;
y--;
ad... | 0 | 96,617,002 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define SYNC std::ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define FRE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
typedef ... | 0 | 20,438,630 |
#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, m;
cin >> n >> m;
vector<int> b(n+1, 0);
rep(i,m) {
int t;
cin >> t;
b[t] = 1;
}
vector<int> dp(n+2);
dp[n] = 1;
for (int i = n... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | 0 | 73,510,101 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
struct edge {
int to, cost, num;
};
int main() {
int N, M;
cin >> N >> M;
vector<vector<edge>> graph(N);
vector<vector<ll>> dist(N, vector<ll>(N, 1e18));
for (int i = 0; i < M; i++) {
int a, b, c;
... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
long long hidari=0;
long long migi=N;
vector<int> card(N, 1);
for (long long i=0; i<M; i++) {
long long L, R;
cin >> L >> R;
for (long long i=hidari; i<L-1; i++) card.at(i) = 0;
... | 0 | 53,985,797 |
#include <cstdio>
void bubleSort(int a[],int n){
int i, j, tmp;
for(i=0; i <n-1; i++){
for(j=0; j <n-1; j++){
if(a[j]>a[j+1]){
tmp=a[j];
a[j] = a[j+1];
a[j+1] = tmp;
}
}
}
}
int main(){
int a,b,c;
scanf("%d %d... | #include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100001;
string s;
bitset<18001> b1;
bitset<18001> b2;
int main() {
cin >> s;
int v = 0;
int len = 0;
vector<int> m[2];
for(int i = 0;i < s.size();i++){
if(s[i] == 'T'){
m[v].push_back(len);
... | 0 | 245,690 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
int ans=(c-(a-b));
if(ans<0)
cout<<0<<"\n";
else
cout<<ans<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
int index=0;
bool flg=false;
for(int i=0;i<s.size();i++){
if(s[i]==t[0]||s[i]=='?'){
for(int j=0;j<t.size();j++){
if(s[i+j]!='?'&&s[i+j]!=t[j]){
break;
}
if(j==t.size()-1){
flg... | 0 | 35,825,402 |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int modpow(int b, int p){
long long int num = 1, power = b;
for(int i=0; i<=30; i++){
if((p>>i) & 1) num *= power;
num %= MOD;
power *= power;
power %= MOD;
}
return num;
}
int main... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 38,918,326 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
const int win = 3;
const int draw = 1;
string str;
cin >> str;
int n = stoi(str);
int taro = 0, hanako = 0;
string str_taro, str_hanako;
for(int i = 0; i < n; i++)
{
cin >> str_taro;
cin >> str_ha... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string com="keyence";
string ans="YES";
if(s==com){
cout << ans << endl;
return 0;
}
int a=s.size();
for(int i=0;i<a;i++){
for(int j=i;j<a;j++){
string str="";
fo... | 0 | 40,111,801 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(p,a,b) for(int p=a;p<b;p++)
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define INF 0x3f3f3f3f
int C(int n,int r)
{
int ans=1;
if(r>n-r)r = n-r;
for(int i=0 ; i<r ; i++)
{
ans *= ((n-i)/(i+... | 0 | 26,865,830 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val)... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | 0 | 98,379,295 |
#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>;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NIL 0
#define INF 1e18
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define pb push_back
#define F first
#define S second
... | 0 | 84,944,613 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
typedef struct {
int to;
long long cost;
} edge;
ll inf = 1e18;
void dijkstra(int n, vector<vector<edge> ... | 0 | 38,343,294 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define MOD (1000000007)
#define f first
#define s second
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) x.begin(), x.end()
#define print(vec,l,r) for(int i = l; i <= r; i++) cout << vec[i] <<" "; cout << endl;
#define forf(i,a,b) for(int i = (a); ... | 0 | 42,160,201 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
vector<string> s;
for(int i=0; i<n; i++){
string a;
cin >> a;
s.push_back(a);
if(i==0) continue;
if(s[i-1][s[i-1].le... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 83,987 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
#define int long long
#define mod(int)(1000000007)
using namespace std;
const int... | 0 | 48,673,169 |
#include<bits/stdc++.h>
#define lld long long int
#define pb push_back
#define in insert
#define mod 1000000007
#define pi 3.14159265358979
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
lld n,a,b;
cin>>n>>a>>b;
if((abs(a-b)-1)%2==0)cout<<"Borys"<<"\n";
else cout... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return tru... | 0 | 96,672,547 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int a, b, c;
cin >> a >> b >> c;
long long int k;
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i <(n); i++)
#define rep2(i,l,r) for (int i=(l); i<(r); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
templa... | 0 | 67,257,921 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <utility>
#include <climits>
#inc... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
void rot45(int &x,int &y){
int tmp = x + y;
x = x - y;
y = tmp;
}
signed main(){
int n; cin >> n;
vector<int> x(n),y(n);
vector<int> s(n);
for(int i = 0; i < n; i++){
cin >> x[i] ... | 0 | 13,211,618 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
int main... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functi... | 0 | 88,256,000 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
int sum(0);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
sum += a;
}
int ans = n - sum;
if (ans < 0) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<string> numbers;
for(int i = 0; i < 1000; i++) {
string x = to_string(i);
if(x.size() == 1) {
x = "00" + x;
}
else if(x.size() == 2) {
x = '0' + x... | 0 | 19,470,748 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
int main(){
vector<int> vec={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14... | #include <bits/stdc++.h>
#define A_MAX 1000000
#define A_MAX_HALF 500000
using namespace std;
int min_factor[A_MAX + 1];
int q[A_MAX + 1];
int a[A_MAX + 1];
int main() {
vector<int> primes{ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, ... | 0 | 41,683,775 |
#include <bits/stdc++.h>
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
int a, b, c; cin >> a >> b >> c;
if(b - a + c... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define MOD 1000000007
template<class T> inline bool chma... | 0 | 99,408,751 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <string>
#include <map>
#include <cmath>
#include <cstring>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ... | #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--... | 0 | 4,457,081 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
int p[N];
for(int i=0;i<N;i++){
cin >> p[i]; p[i]--;
}
int a[N];
int b[N];
int r[N];
for(int i=0;i<N;i++){
r[p[... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | 0 | 33,708,817 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int nowp,ans[10000];
char ch;
bool check(int x)
{
printf("? ");
for(int i=1;i<nowp;++i)
printf("%d",ans[i]);
printf("%d",x);
for(int i=1;i<=12-nowp;++i)
printf("0");
printf("\n");
fflush(stdout)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int extgcd(int a, int b, int& x, int& y) {
int d = a;
if (b != 0)... | 0 | 43,155,182 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,K,S;
cin >> N >> K >> S;
for(int i = 0; i < N; i++) {
if(i < K) {
cout << S;
}
else {
... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 22,606,775 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
#define debug(...) 42
#endif
#define sf scanf
#define pf printf
#define nl printf("... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x,y;
long long z;
cin >> x >> y;
long long A = x * y;
if (A < 0){
if (x < 0){
if (abs(x) <= abs(y)){
z = x + y + 1;
}
else {
z = - x - y + 1;
}... | 0 | 53,610,856 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define MAX 510000
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i+... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 70,678,347 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define REP(i,n) for (ll i=1;i<=(n);i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n+1);
vector<ll> num(n+1,0);
REP(i,n){
cin >> a[i];
num[a[i]]++;
}
ll def=0;
REP... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
if (... | 0 | 76,290,516 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
sort(s.begin(),s.end());
if(s[0]==s[2])cout<<"No"<<endl;
else cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#include <float.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | 0 | 36,078,130 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <cmath>
#include <cstdlib>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define MA(i,j) make_pair(i,j)
#define PA pair<int,int>
#define PB push_back
#def... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 79,822,825 |
#include <ios>
#include <iostream>
#include <vector>
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int main() {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i)
std::cin >> a[i];
int m = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000
int main(){
int M,K;
cin>>M>>K;
if((1<<M)<=K){
cout<<-1<<endl;
}else if(M>1){
cout<<K<<" ";
for(int i=0;i<(1<<M);i++){
if(i==K){
... | 0 | 44,707,756 |
#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
ll int MOD=1e9+7;
#define N 200000
using namespace std;
string alphabet("abcdefghijklmnopqrstuvwxyz");
main(){
ll int n,l,t,x[N]=... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<int,string> P;
#define repl(i,n... | 0 | 92,899,980 |
#include <iostream>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <string>
#include <functional>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); ... | 0 | 4,809,781 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int a,b,c,d;
cin>>a>>b>>c>>d;
int co=0;
co+=min(a,b)+min(c,d);
cout<<co;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i, n) FOR(i,0,n)
int main (void){
int N,K;
cin >> N >> K;
vector<int> d;
vector<vector<int>> A;
d.resize(K);
A.resize(K, vector<int>());
REP(i,K){
cin >> d[i];
... | 0 | 41,661,615 |
#include <stdio.h>
int main()
{
int apel,potonganapel,Totalkue;
scanf("%d %d",&apel,&potonganapel);
apel *= 3;
Totalkue = (apel+potonganapel)/2;
printf("%d",Totalkue);
return 0;
} | #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-9;
struct mint {
int n;
m... | 0 | 61,529,150 |
#include <bits/stdc++.h>
using namespace std;
bool isok(long long n) {
vector<int> v;
while (n) {
v.push_back(n % 10);
n /= 10;
}
auto v2 = v;
reverse(v2.begin(), v2.end());
return v == v2;
}
int main() {
int A, B;
cin >> A >> B;
int res = 0;
for (int n = A; n <= B; ++n) if (isok(n)) ++res;
... | #include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
for (int i = 1; i <= 1250; ++i) {
if (int(i * 8 / 100.0) == a && int(i / 10.0) == b) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
} | 0 | 97,861,006 |
#include <iostream>
#include <string>
#include <algorithm>
int main() {
std::string s, op;
std::cin >> s;
int q;
std::cin >> q;
int a, b;
while (std::cin >> op >> a >> b) {
if (op == "print") {
std::cout << s.substr(a, b - a + 1) << std::endl;
} else if (op == "rever... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
t... | 0 | 83,675,336 |
#include<iostream>
using namespace std;
int main(){
int n,m;
char moji,change[1000000][2];
while(1){
cin >>n;
if( n == 0)break;
for(int i=0 ; i < n ; i++){
cin >>change[i][0]>>change[i][1];
}
cin >>m;
for(int i=0 ; i < m ; i++){
cin >>moji;
for(int j=0 ; j < n ; j++){
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
char s[N]; int c[30];
int main() {
scanf("%s",s+1);
for(int i=1;s[i];i++) c[s[i]-'a']++;
LL n=strlen(s+1);
LL tot=n*(n-1)/2;
for(int i=0;i<26;i++){
tot=tot-1LL*c[i]*(c[i]-1)/2;
}
tot++;
cout<<tot<<endl;
} | 0 | 98,425,739 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
#include <deque>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typed... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B;cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else{
if(A!=1&&B!=1){
if(A<B){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
else if(A==1&&B!=1){
... | 0 | 73,106,132 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll x,y;
cin>>x>>y;
cout<<(abs(x-y)<=1 ? "Brown" : "Alice")<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> t(n), x(n), y(n);
for (int i = 0; i < n; i++)
{
cin >> t[i] >> x[i] >> y[i];
}
int time = 0;
int dx = 0, dy =... | 0 | 71,321,445 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string b;
cin >> b;
string ans;
switch (b[0]) {
case 'A':
ans = "T";
break;
case 'C':
ans = "G";
break;
case 'G':
ans = "C";
break;
case 'T':
ans = "A";
break;
}
c... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for(int i = 0; i < n; i++){
cin >> h[i];
}
int cnt = 0;
int i = 0;
while(i < n){
if(h[i] == 0){
i++;
continue;
}
int j = i;
while(j < n){
if(h[j] == ... | 0 | 82,437,331 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans =0;
int myans =0;
for(int i=3;i<=N;i++){
for(int j=1;j<=N;j++){
if (i%j ==0){
myans++;
}
}
if(myans == 8 && i % 2 !=0){
ans++;
}
myans = 0;
}
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
vector<vector<bool>> A(N, vector<bool>(N, false));
for (int i = 0; i < M; i++) {
cin >> a.at(i) >> b.at(i);
A.at(a.at(i) - 1).at(b.at(i) - 1) = true;
A.at(b.at(i) - 1).at(a.at(i) - 1) = true... | 0 | 55,733,577 |
#include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(){
int A,B;
map<int,int>mp;
for(int i = 0; i < 3;i++){
cin >> A >> B;
mp[A]++;
mp[B]++;
}
if(mp[1]<=2
&& mp[2]<=2
&& mp[3]<=2
&& mp[4]<=2)cout << "YES"<<endl;
else cout <<"NO"<<endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#i... | 0 | 79,249,987 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.