Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,018 | #include "iostream"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)a = 14;
if (b == 1)b = 14;
if (a > b)cout << "Alice" << endl;
else if (a == b)cout << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 88 |
Project_CodeNet | 2,017 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <stack>
#include <queue>
#include <map>
using namespace std;
#define max_n 1000
#define max_m 100
#define max_w 10000
#define max_h 1000
#define max_k 10000... | 227 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b;
if(a==1) a=14;
if(b==1) b=14;
if(a>b) co("Alice");
else if(a==b) co("Draw");
else co("Bob");
return 0;
}
| 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a == b){
cout << "Draw";
}else if(a > b){
cout << "Alice";
}else{
cout << "Bob";
}
} | 90 |
Project_CodeNet | 2,017 | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 376 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else
{
if (a == 1 || b == 1)
cout << (a == 1 ? "Alice" : "Bob") << endl;
else
cout << (a > b ? "Alice" : "Bob") << endl;
}
} | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
string ans = "Draw";
if (a > b) ans = "Alice";
if (a < b) ans = "Bob";
... | 128 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if (A<B&&A!=1||B==1&&A!=1){
cout << "Bob" << endl;
} else if (A>B&&B!=1||A==1&&B!=1){
cout << "Alice" << endl;
} else {
cout << "Draw" << endl;}
}
| 96 |
Project_CodeNet | 2,019 | # include <bits/stdc++.h>
typedef long long ll;
#define pii pair<int,int>
#define vpii vector<pii>
#define vll vector<ll>
#define vi vector<int>
#define pb push_back
#define f first
#define s second
#define all v.begin(),v.end()
#define fio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
typedef un... | 186 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long A, long long B) {
if (A == B)
cout << "Draw";
else if (A == 1)
cout << "Alice";
else if (B == 1)
cout << "Bob";
else {
cout << ((A < B) ? "Bob" : "Alice");
}
cout << endl;
}
int main() {
ios_base::sy... | 154 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if (A < B){
if (A == 1) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
if (A > B){
if (B == 1) cout << "Bob" << endl;
else cout << "Alice" << endl;
}
if (A == B) cout << "Draw" << endl;
} | 111 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A==B) cout << "Draw" << endl;
else if(A>B){
if(B==1){
cout << "Bob" << endl;
}else {
cout << "Alice" << endl;
}
}else{
if(A==1){
cout << "Alice" << endl;
}else{
cout << "Bob" << ... | 114 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define FOR(x, z, y) for(int x = (z); y; x++)
#define rep(x, y) for(int x = 0; x < (y); x++)
#define REP(x, z, y) for(int x = (z); x < (y); x++)
#define all(x) x.begin(), x.end()
#define len(x) (sizeof(x) / sizeof(x[0]))
#define split_str(str, sp_word) istringstream stream(str); string res; FOR(... | 282 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define INF 1 << 29
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
void gen_sosuu(int sosuu[]){
REP(i,100010){
sosuu[i] = true;
}
sosuu[0] = false;
sosuu[1]... | 261 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int a,b;
cin>>a>>b;
if (a==b)
cout<<"Draw"<<endl;
else if (a==1<b)
cout<<"Alice"<<endl;
else if (b==1<a)
cout<<"Bob"<<endl;
else if (a<b)
cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
} | 101 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int power(int a){
int A;
if(a>=2 && a<=13)A=a-1;
else A=13;
return A;
}
int main(void){
int a,b;
cin>>a>>b;
int A=power(a);
int B=power(b);
if(A>B)cout<<"Alice"<<endl;
else if(B>A)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return 0;
} | 109 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << ((a + 11) % 13 > (b + 11) % 13 ? "Alice" : ((a + 11) % 13 < (b + 11) % 13 ? "Bob" : "Draw")) << endl;
return 0;
} | 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a!=1 && b!=1){
if(a>b){
... | 203 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a , b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else if(a == 1){
cout << "Alice" << endl;
}else if(b == 1){
cout << "Bob" << endl;
}else if(a > b)... | 122 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int poker(int& a){
int i = 0;
int pow[13] = {2,3,4,5,6,7,8,9,10,11,12,13,1};
for ( i = 0; i <13; ++i) {
if (pow[i] == a){
break;
}
}
return i;
}
int main() {
int a,b = 0;
int apow,bpow = 0;
cin >> a >> b;
apow = p... | 195 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >>a >>b;
string win;
if (a==b) win = "Draw";
else if (a==1) win = "Alice";
else if (b==1) win = "Bob";
else if (a>b) win = "Alice";
else win = "Bob";
cout <<win <<endl;
}
| 98 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b),a=(a+11)%13+1,b=(b+11)%13+1;
printf("%s\n",a>b ? "Alice" : a==b ? "Draw" : "Bob");
} | 66 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A > B) cout << "Alice" << endl;
if (A < B) cout << "Bob" << endl;
if (A == B) cout << "Draw" << endl;
} | 108 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<bits/stdc++.h>
typedef long long int ll;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for(int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b))
#define BIT(b, i) (((b) >> (i)) & 1)
#define LOG_F 1
#define LOG(...) if(LOG_F) fprintf(stderr, __V... | 231 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <set>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if ((A > B && B != 1) || (A == 1 && B != 1)) {
cout << "Alice" << endl;
... | 131 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<utility>
#include<cmath>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main(void) {
int a,b; cin >> a>>b;
if (a == b) {
cout << "Draw" << e... | 154 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a = (a==1) ? 14 : a;
b = (b==1) ? 14 : b;
cout << ((a > b) ? "Alice" : ((a==b) ? "Draw" : "Bob")) << endl;
} | 83 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A += 13;
if (B == 1) B += 13;
if (A == B) cout << "Draw" << endl... | 148 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 216 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw\n";
else if(a==1) cout<<"Alice\n";
else if(b==1) cout<<"Bob\n";
else if(a>b) cout<<"Alice\n";
else cout<<"Bob\n";
return 0;
}
| 84 |
Project_CodeNet | 2,017 | #pragma warning(disable:4786)
#pragma warning(disable:4996)
#include<list>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#... | 426 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int a, b;
cin >> a >> b;
if(a == 1)
a = 14;
if(b == 1)
b = 14;
if(a == b)
cout << "Draw" << flush;
else
cout << (a > b ? "Alice" : "Bob") << flush;
return 0;
}
| 103 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if( a == 13 && b == 1) cout << "Bob" << endl;
else if( b == 13 && a == 1) cout << "Alice" << endl;
else if( a < b) cout << "Bob" << endl;
else cout << "Alice" << end... | 120 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int a,b;
cin >> a >> b;
if( a==b ) cout << "Draw" << endl;
else {
if( a == 1 or b == 1)
cout << (a==1? "Alice":"Bob") << endl;
else
cout << (a>b? "Alice": "Bob") << endl;
}
return 0;
}
| 103 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 2e18;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
ll a, b;
cin >> a >> b;
if(a == 1){
a = INF;
}
if(b == 1){
b = INF;
... | 141 |
Project_CodeNet | 2,020 | #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>;
int main(){
int A, B;
cin >> A >> B;
if(A==B) cout << "Draw" << endl;
else if(A==1) cout << "Alice" << endl;
else if(B==1) cout << "Bob" << endl;
else if(A>B) cout << "Alic... | 126 |
Project_CodeNet | 2,019 | /*g++ file.cpp -o file.out*/
/*./file.out*/
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define Mod 1000000007
#define L_Mod 17100000013
int main()
{
... | 194 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <set>
#include <map>
#include <deque>
#define WMAX 10000
#define HMAX 10000
//コメントアウトするとdebug()を実行しない
#define DEBUG
using namespace std;
t... | 355 |
Project_CodeNet | 2,020 | #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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 320 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include<complex>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i+... | 270 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main( )
{
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw\n";
}
else if (a == 1) {
cout << "Alice\n";
}
else if (b == 1) {
cout << "Bob\n";
}
else if (a > b) {
cout << "Alice\n";
}
else {
... | 120 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a = (a+ 11)%13;
b = (b + 11) % 13;
if(a < b) cout << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else cout << "Draw" << endl;
return 0;
} | 87 |
Project_CodeNet | 2,019 | #include <iostream>
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 << "Alice" << endl;
}
else if (B > A){
cout << "Bob" << endl;
}
}
... | 152 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if((a+11)%13>(b+11)%13){cout<<"Alice";}
else if((a+11)%13<(b+11)%13){cout<<"Bob";}
else{cout<<"Draw";}
}
| 72 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>b;i--)
#define leng(n) (int)(log10(n)+1)
#define INF 9000000000000000000
using namespace std;
int gcd(int a,int b){re... | 225 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | 183 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
return 0;
}
else if(b!=1&&(b<a||a==1)){
cout << "Alice" << endl;
}
else
cout << "Bob" << endl;
} | 86 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define all(n) begin(n),end(n)
template<class... | 276 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A==1){
A=14;
}
if(B==1){
B=14;
}
if(A>B){
cout<<"Alice"<<endl;
}
else if(A<B){
cout<<"Bob"<<endl;
}
else{
cout<<"Draw"<<endl;
}
return 0;
} | 97 |
Project_CodeNet | 2,020 | //
// main.cpp
// test130
//
// Created by on 2019/06/16.
// Copyright © 2 All rights reserved.
//
//
// main.cpp
// new
//
// Created on 2019/06/09.
// Copyright All rights reserved.
//
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This fi... | 1,097 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1)
cout << "Alice" << endl;
else if (b == 1)
cout << "Bob" << endl;
else
cout << (a > b ? "Alice" : "Bob") << endl;
return 0;
} | 107 |
Project_CodeNet | 2,019 | #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 a,b;cin>>a>>b;
if (a==1)
{
/* code */
a=100;
}
if (b==1)
{
/* code */
b=100;
}
if (a>b)
{
/* code */
... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define D1(x) {cerr<<" [" <<#x<<": "<<x<<"]";cout << endl;}
#define D2(x) {cerr<<" [" <<#x<<": ... | 258 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) {
cout << "Alice";
}
else if (a < b) {
cout << "Bob";
}
else if (a == b) {
cout << "Draw";
}
return 0;
} | 102 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B){
if (A == 1) {
A += 13;
}
if (B == 1) {
B += 13;
}
if (A > B) {
cout << "Alice" << endl;
}
else if (B > A) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << ... | 192 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
// Here your code !
int a,b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
return 0;
}
if(a == 1) a += 14;
if(b == 1) b += 14;
if( a < b )
cout << "Bob" << endl;
else
cout <... | 110 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin >> A >> B;
if((A>13)||(B>13)){
return 0;
}
if((A<1)||(B<1)){
return 0;
}
if(A==1){
A=14;
}
if(B==1){
B=14;
}
if(A>B){
cout << "Alice";
}
if(B>A){
cout << "Bob";
}
... | 127 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define N 200006
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
if(a==b)return puts("Draw"),0;
if(a==1)return puts("Alice"),0;
if(b==1)return puts("Bob"),0;
if(a>b)return puts("Alice"),0;return puts("Bob"),0;
} | 86 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
if ((x == 1) && (y > 1))
cout << "Alice";
else if ((y == 1) && (x > 1 ))
cout << "Bob";
else if (x < y)
cout << "Bob";
else if (x > y)
cout << "Alice";
else if (x == y)... | 116 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <stack> // s.top()
#include <bitset>
#include <queue> // s.front()
using namespace std;
typedef long long Int;
typedef pair<Int,Int> P;
#define print(x) cout<<(x)<<endl... | 187 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if((A == 1 && B != 1)|| A > B && B != 1){
cout << "Alice" << endl;;
}
else if(A == B){
cout << "Draw" << endl;
}
else if((B == 1 && A != 1)|| B > A && A != 1){
cout << "Bob" << endl;
}
return 0;
} | 112 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A==B) cout << "Draw\n";
else if(A==1||(B!=1&&A>B)) cout << "Alice";
else cout << "Bob\n";
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw";
} else if (a == 1) {
cout << "Alice";
} else if (b == 1) {
cout << "Bob";
} else if (a > b) {
cout << "Alice";
} else if (a < b) {
cout << "B... | 119 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <cmath>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == 1) A += 13;
if(B ==... | 144 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void)
{
int a,b;
cin >> a >> b;
if(a == 1 || b == 1)
{
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a > b)
cout << "Alice" << endl;
else if(a < b)
cout << "Bob" << endl;
... | 161 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A += 13;
if (B == 1) B += 13;
if (A > B)
cout << "Alice" << endl;
else if (B > A)
cout << "Bob" << endl;
else
cout << "Draw" <<... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if (A == 1) {
A = 14;
}
if (B == 1) {
B = 14;
}
if (A > B) {
cout << "Alice" << endl;
}
if (A == B) {
cout << "Draw" << endl;
}
if (A < B) {
cout << "Bob" << endl;
}
} | 119 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define MAX_N 1000005
int a,b;
int main(){
cin>>a>>b;
if(a==b){
puts("Draw");
}
else if(a==1){
puts("Alice");
}
else if(b==1){
puts("Bob");
}
else {
puts(a>b?"Alice":"Bob");
}
return 0;
} | 101 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b ;
if (a == b){
cout << "Draw" << endl;
return 0;
}
if (a == 1) a = 14;
if (b == 1) b = 14;
if ( a < b) cout << "Bob" << endl;
else cout << "Alice" << endl;
return 0;
}
| 108 |
Project_CodeNet | 2,019 | //AtCoder ABC054 A - One Card Poker
#include <bits/stdc++.h>
using namespace std;
using ll=int64_t;
int main() {
int A,B;
cin>>A>>B;
int as=A==1?14:A;
int bs=B==1?14:B;
if(as==bs){
cout<<"Draw"<<endl;
}else if(as>bs){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
... | 111 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a == b) {
cout << "Draw" << endl;
} else if (a > b) {
cout << "Alice" << endl;
... | 122 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
cout << "Alice" << endl;
}
else if (a < b) {
cout << "Bob" << endl;
}
else {
cout << "Dra... | 116 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <bitset>
#include <time.h>
#include <set>
#include <algorithm>
#define ll long long
#define Inf 123372036854775806ll
using namespace std;
int main() {
map<int,int> ids;
int ct=0;
for(int i=2... | 175 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long ll;
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define SIZE(array) (sizeof(array) / sizeof(array[0]))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n... | 239 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main()
{
int A, B;
cin >> A >> ... | 200 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
a+=13;
}
if(b==1){
b+=13;
}
if(a>b){
cout<<"Alice"<<endl;
}
else if(a<b){
cout<<"Bob"<<endl;
}
else{
cout<<"Draw"<<endl;
}
return 0;
} | 98 |
Project_CodeNet | 2,018 | //OneCardPoker.cpp (A)
#include <iostream>
#include <string>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A>B) printf("Alice\n");
else if(A<B) printf("Bob\n");
else printf("Draw\n");
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1&&A!=B||A>B&&B!=1)cout<<"Alice"<<endl;
else if(A==B)cout<<"Draw"<<endl;
else cout<<"Bob"<<endl;
} | 77 |
Project_CodeNet | 2,018 | #include<cstdio>
int a,b;
int main(){
scanf("%d%d",&a,&b);
if(a==1)a=14;
if(b==1)b=14;
if(a<b)puts("Bob");
else if(a>b)puts("Alice");
else puts("Draw");
} | 65 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
typedef long long ll;
using namespace std;
int main()
{
int A, B;
cin >> A;
cin >> B;
if (A==1)
{
A = 14;
}
if (B == 1)
{
B = 14;
}
if (A>B)
{
cout << "Alice";
}
else if (A<B)
{
cout << "Bob";
}
else
... | 127 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){
A+=13;
}
if(B==1){
B+=13;
}
if(A==B){
cout<<"Draw"<<endl;
}else if(A<B){
cout<<"Bob"<<endl;
}else{
cout<<"Alice"<<endl;
}
} | 93 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a < b) {
cout << "Bob" << endl;
}
else if (a == b) {
cout << "Draw" << endl;
}
else {
cout << "Alice" << endl;
}
}
| 116 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <array>
#include <vector>
#include <math.h>
#include <algorithm>
#include <set>
#include <deque>
#include <utility>
#include <map>
#define ll long long int
#define MAX 1000000
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
if (a == b) {
cout << "D... | 186 |
Project_CodeNet | 2,019 | #include<stdio.h>
using namespace std;
int main()
{
int A, B;
scanf("%d %d", &A, &B);
if(A >= 1 && A <= 13 && B >= 1 && B <= 13){
if(A==B){
printf("Draw\n");
}
else if(A==1){
printf("Alice\n");
}
else if(B == 1){
printf("Bob\n");
}
else{
i... | 135 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <algorithm>
#include<string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int A, B;
cin >> A >> B;
if (A == 1 && B == 1) {
cout << "Draw" << endl;
} else if (A == 1) {
cout << "Alice" << endl;
} else if (B =... | 175 |
Project_CodeNet | 2,017 | #include <cstdio>
int main(){
int a, b;
scanf("%d%d", &a, &b);
a += 12, b += 12;
a %= 14, b %= 14;
if(a > b){
puts("Alice\n");
}
else if(a < b){
puts("Bob\n");
}
else{
puts("Draw");
}
return 0;
}
| 84 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 418 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pdd pair<double,double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#define ... | 303 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# ... | 283 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
long long int n,ans;
int a,b;
int main(){
cin >> a >> b;
if(a==b)cout<<"Draw"<<endl;
else if(a==1)cout<<"Alice"<<endl;
else if(b==1)cout<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else if(a<b)cout<<"Bob"<<endl;
} | 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
else if (a == 1) {
cout << "Alice" << endl;
}
else if (b == 1) {
cout << "Bob" << endl;
}
else if (a > b) {
cout << "Alice" << endl;
}
else {
cout << "Bo... | 124 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a = 14;
if (b == 1)
b = 14;
if (a > b) cout << "Alice"<<endl;
else if (a < b)cout << "Bob"<<endl;
else cout << "Draw" << endl;
return 0;
} | 90 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int ans, count;
int a, b, c;
string str;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a==b)cout<<"Draw"<<endl;
else if(a >b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 96 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | 452 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout<<"Alice\n";
else if(a==b) cout<<"Draw\n";
else cout<<"Bob\n";
return(0);
} | 87 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin>>A>>B;
if(A==B)cout<<"Draw"<<endl;
else if(A==1)cout<<"Alice"<<endl;
else if(B==1)cout<<"Bob"<<endl;
else if(A>B)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
} | 92 |
Project_CodeNet | 2,020 | /* #### #### # #### # ## # # # # ###### #####
# # # # # # # # ## ## ## ## # # #
#### # # # #### # # # # ## # # ## # ##### # #
# # # # # # # ###### # # # #... | 383 |
Project_CodeNet | 2,020 | #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... | 3,639 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}
else if(a == 1 || (a > b && b != 1)){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
| 88 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
} else if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else if (a > b) {
cout << "Alice" << endl;
}... | 125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.