Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;
int main()
{
int A,B;
cin >> A >>B;
if(A==1){A=14;}
if(B==1){B=14;}
if(A==B){
... | 135 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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<<"Draw"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
} | 85 |
Project_CodeNet | 2,017 | #include <iostream>
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;
}
| 98 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main()
{
int a, b;
scanf("%d%d", &a, &b);
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
printf("Alice\n");
}
else if (b > a) {
printf("Bob\n");
}
else {
printf("Draw\n");
}
return 0;
}
| 103 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void)
{
int a, b;
scanf("%d%d",&a,&b);
if (a == 1) a+=13;
if (b == 1) b+=13;
if (a > b) {
puts("Alice");
} else if (a < b) {
puts("Bob");
} else {
puts("Draw");
}
return 0;
}
| 95 |
Project_CodeNet | 2,017 | #include <iostream>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define debug(x) cout << #x << " = " << x << endl;
using namespace std;
int main(void){
int A,B;
cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A > B){
cout << "Alice" << endl;
}els... | 149 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define fs first
#define sc second
#define mp make_pair
#define pb emplace_back
#define sz(s) ((int) s.size ())
#define all(s) s.begin (), s.end ()
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef unsigned long long ull;
const ll linf = (ll) 1e18;
const int pw ... | 317 |
Project_CodeNet | 2,017 | #include <cstdio>
int main(){
int a,b;
scanf("%d %d", &a, &b);
a = (a+11) % 13;
b = (b+11) % 13;
printf(a == b ? "Draw\n" : a < b ? "Bob\n" : "Alice\n");
return 0;
}
| 79 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
#if !ONLINE_JUDGE
freopen("in1.txt", "r", stdin);
freopen("out1.txt", "w" , stdout);
#endif
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
else if (a == 1)
{
cout << "Alice" << endl;
}
else if ... | 168 |
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 << "Bob" << endl;
return 0;
}else if(A>B){
cout << "Alice" << endl;
return 0;
}
cout << "Draw" << endl;
return 0;
} | 103 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
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,... | 222 |
Project_CodeNet | 2,019 | #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 (B > A) cout << "Bob" << endl;
else cout << "Draw" << endl;
}
| 98 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define INF INT_MAX;
typedef long long ll;
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1) a=14;
if(b==1) b=14;
if(a>b) puts("Alice");
else if(a<b) puts("Bo... | 125 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main (void) {
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;
} | 101 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
int num[]={13,1,2,3,4,5,6,7,8,9,10,11,12};
cout<<(num[a-1]>num[b-1]?"Alice":num[a-1]<num[b-1]?"Bob":"Draw")<<endl;
return 0;
} | 104 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define revrep(i, s) for (int i = s-1; i > 0; i--)
#define revrrep(i, s) for (int i ... | 315 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int X, Y;
cin >> X >> Y;
if(X == 1) X += 13;
if(Y == 1) Y += 13;
if(X > Y) cout << "Alice" << endl;
else if(X < Y) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 90 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, C, D, N, ans=0;
char tmp;
string S;
cin >> A >> B;
if(A==1)
A=14;
if(B==1)
B=14;
// ans = max(A*B, C*D);
// cout <<ans<<endl;
if(A < B)
cout << "Bob"<<endl;
else if(A>B)
cout <<"Al... | 183 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1 && b != 1){
cout << "Alice" << endl;
}
else if(b == 1 && a != 1){
cout << "Bob" << endl;
}
else if(a != 1 && b != 1 && a < b){
cout << "Bob" << endl;
}
else if(a != 1 && b != 1 && a > b){
... | 152 |
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 << "Draw" << endl;
}
else if (A > B) {
;cout << "Alice" << endl;
}
else {
;cout << "Bob" << endl;
}
;return 0;
}
| 129 |
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 << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
}
| 98 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A == 1 && B != 1) cout << "Alice" << endl;
else if(A != 1 && B == 1) cout << "Bob" << endl;
else if(A == B) cout << "Draw" << endl;
... | 135 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define nl '\n'
int main()
{
int a,b;
cin>>a>>b;
if(a!=1&&b!=1)
{
if(a>b)
cout<<"Alice";
else if(b>a)
cout<<"Bob";
else
cout<<"Draw";
}
else if(a==1&&b!=1)
cout<<"Alice";
else if(b==1&&a!=1)
... | 125 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
if ( A > B && B != 1 || A==1&&B!=1){
cout << "Alice" << endl;
}
else if ( A < B && A != 1 || B==1&&A!=1 ) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
} | 109 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d%d", &a, &b);
if(a == 1 && b != 1) {
printf("Alice\n");
}
else if(a != 1 && b == 1) {
printf("Bob\n");
}
else if(a == b) {
printf("Draw\n");
}
else if(a > b) {
printf("Alice... | 128 |
Project_CodeNet | 2,017 | #include<cstdio>
using namespace std;
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a==b) printf("Draw\n");
else if((a!=1)&&(b!=1))
{
if(a>b) printf("Alice\n");
else printf("Bob\n");
}
else if(a==1) printf("Alice\n");
else printf("Bob\n");
return 0;
}
| 95 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REP(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
c... | 219 |
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<<"Alice"<<endl;}
else if(a==b){cout<<"Draw"<<endl;}
else{cout<<"Bob"<<endl;}
}
| 85 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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)
cout<<"Alice"<<endl;
else if(a==b)
cout<<"Draw"<<endl;
else
cout<<"Bob"<<endl;
}
| 90 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A == 1 && B != 1) cout << "Alice" << endl;
else if (B == 1 && A != 1) cout << "Bob" << endl;
else if (A < B) cout << "Bob" << endl;
else if (A == B) cout << "Draw" << endl;
else cout << "Alice" << endl;
} | 112 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a[2];
for(int i = 0; i < 2; i++){
cin >> a[i];
if(a[i] == 1) a[i] = 14;
}
if(a[0] > a[1]) cout << "Alice" << endl;
else if(a[0] < a[1]) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 105 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>> a >> b;
if(a==1)
{
a+=13;
}
if(b==1)
{
b+=13;
}
if (a==1){
a+=13;
}
if (a>b)
cout << "Alice";
else if (a == b)
cout << "Draw";
else
cout <<"Bob";
}
| 90 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string w;
if (A == B) {
w = "Draw";
}
else if (B == 1) {
w = "Bob";
}
else if (A == 1) {
w = "Alice";
}
else if (A > B) {
w = "Alice";
}
else if (A < B) {
w = "Bob";
}
cout << w << end... | 127 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#includ... | 823 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int A,B;
cin >> A >> B;
if(A==1){
if(B==1)cout << "Draw";
else cout <<"Alice";
return 0;
}
if(B==1){
if(A==1)cout <<"Draw";
else cout <<"Bob";
return 0;
}
if(A==B)cout << "Draw";
else if(A>B)cout << "Alice";
else cout <<"Bob";
return 0;
} | 109 |
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 (b>a) cout << "Bob" << endl;
else cout<<"Draw"<<endl;
} | 85 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B; cin >> A >> B;
string ans;
if (A == 1 && B != 1) ans = "Alice";
else if (B == 1 && A!= 1) ans = "Bob";
else if (A == B) ans = "Draw";
else if (A > B) ans = "Alice";
else ans = "Bob";
cout << ans <<endl;
} | 108 |
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;
if (A == B) cout << "Draw" << endl;
if (A < B) cout << "Bob" << endl;
return 0;
}
| 102 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
const int N=2e5+3;
//string s,p;
//vector<int>v;
//map<int,int>mp;
int main()
{
ft
ll t,... | 196 |
Project_CodeNet | 2,020 | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
vector<int> v {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1};
int a, b;
cin >> a >> b;
if(find(v.begin(), v.end(), a) < find(v.begin(), v.end(), b)){... | 172 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
using namespace std;
int main() {
int a = 0;
int b = 0;
cin >> a;
cin >> b;
if (a == 1 && b != 1) {
cout << "Alice" << "\n";
}
else if (a != 1 && b == 1) {
cout << "Bob" << "\n";
}
else if (a < b) {
cout << "Bob" << "\n";
}
else if (b < a) {
cout << "Alice" << "\n"... | 150 |
Project_CodeNet | 2,020 | #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... | 231 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
} e... | 169 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if(a == 1) a += 20;
if(b == 1) b+= 20;
if(a> b){
cout << "Alice" << endl;
}else if(b > a){
cout << "Bob" << endl;
}el... | 134 |
Project_CodeNet | 2,019 | #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)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
constexpr ll MOD = (1e9+7);
constex... | 572 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<bitset>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<iomanip>
#include <functional>
using namespace std;
typedef long long ll;
const int mod = 1000... | 200 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
using namespace std;
int main()
{
const char *Alice = "Alice";
const char *Bob = "Bob";
const char *Draw = "Draw";
int A, B;
if (scanf("%d%d", &A, &B) < 2) return 0;
A = A == 1 ? A + 13 : A;
B = B == 1 ? B + 13 : B;
printf("%s\n", A =... | 130 |
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;
} | 77 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b;
if (a == 1 || b == 1) {
if (a == 1 && b == 1)
cout << "Draw" << endl;
else if (a == 1)
cout << "Alice" << ... | 170 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 154 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
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... | 141 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int c[14]={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
int a,b;
cin>>a>>b;
if(c[a]>c[b])cout<<"Alice"<<endl;
else if(c[a]<c[b])cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;... | 108 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if (x==y){cout<<"Draw";}
else if(x>y&&y!=1){cout<<"Alice";}
else if(x>y&&y==1){cout<<"Bob";}
else if(x<y&&x!=1){cout<<"Bob";}
else if(x<y&&x==1){cout<<"Alice";}
return 0;
}
| 96 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
const ll INF = 1LL << 60... | 182 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <functional>
using namespace std;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a += 13;
if (b == 1)
b += 13;
if (a ... | 137 |
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;
string ans;
if(a==b) ans = "Draw";
else if(a>b) ans = "Alice";
else ans = "Bob";
cout << ans << endl;
return 0;
} | 95 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == 1) {
if (b == 1) {
cout << "Draw" << endl;
}
else {
cout << "Alice" << endl;
}
}
else {
if (b == 1) {
cout << "Bob" << endl;
}
else {
if (a < b) {
cout << "Bob" << endl;
... | 166 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1 && b!=1)
{
cout<<"Alice"<<endl;
}
else if(b==1 && a!=1)
{
cout<<"Bob"<<endl;
}
else if(a!=1 && b!=1 && a>b)
{
cout<<"Alice"<<endl;
}
else if(a!=1 && b!=1 && b>a)
{... | 138 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a... | 330 |
Project_CodeNet | 2,020 | #include <stdlib.h>
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll=long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;}
inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,... | 313 |
Project_CodeNet | 2,020 | #include"bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string winner = "Alice";
if (A != B) {
if (B == 1 || (B > A && A != 1)) {
winner = "Bob";
}
cout << winner << endl;
return 0;
}
cout << "Draw" << endl;
return 0;
} | 95 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int a;
int 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{
cout<< "Draw";
}
} | 93 |
Project_CodeNet | 2,020 | #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() {
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (... | 146 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
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 cout<<(a<b?"Bob":"Alice")<<endl;
} | 80 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int ans=0,sum=0,n,p=1,i,j,a,b;
scanf("%d %d",&a,&b);
if(a==1)
{
if(b==1)
printf("Draw");
else
printf("Alice");
return 0;
}
if(b==1)
{
if(a==1)
printf("Draw");
else
printf("Bob");
return 0;
}
//if(a==1)
if(a>b)
printf("Alice");
... | 145 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
string str;
cin >> a >> b;
if (a == 1){
str = "Alice";
}
else if (b == 1){
str = "Bob";
}
else if (a < b){
str = "Bob";
}
else if (a > b){
str = "Alice";
}
if (a == b){
str = "Draw";
}
cout << str << e... | 120 |
Project_CodeNet | 2,019 | #include"bits/stdc++.h"
#include<boost/multi_array.hpp>
#include<boost/optional.hpp>
#include<boost/range/irange.hpp>
#include<boost/range/algorithm.hpp>
#include<boost/range/adaptors.hpp>
using namespace std;
namespace adaptor = boost::adaptors;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(i... | 261 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1||b==1){
if(a==b)
cout << "Draw" << endl;
else if(a==1)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
}
else{
if(a==b)
cout << "Draw" << endl;
else if(a>b)
cout <<... | 129 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(false);
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;
}
| 118 |
Project_CodeNet | 2,018 | //#include "bits/stdc++.h"
#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <complex>
#include ... | 426 |
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";
if(A<B)
cout<<"Bob";
if(A==B)
cout<<"Draw";
system("pause");
return 0;
} | 76 |
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 || b>a) cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
} | 80 |
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 << "Bob" << endl;
else if (A > B) cout << "Alice" << endl;
else cout << "Draw" << endl;
} | 96 |
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;
string ans = "Alice";
if (A < B)
ans = "Bob";
else if (A == B)
ans = "Draw";
cout << ans << endl;
return 0;
} | 100 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
int main()
{
int a, b;
scanf("%d%d", &a, &b);
a = (a + 11) % 13;
b = (b + 11) % 13;
if (a < b) printf("Bob\n");
else if (a > b) printf("Alice\n");
else printf("Draw\n");
return 0;
} | 94 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
return 0;
}
if (a == 1) {
cout << "Alice" << endl;
} else if (b == 1) {
cout << "Bob" << endl;
} else {
if (a < b) {
cout << "Bob" << endl;
} else {
cout << "Alice" << endl;
... | 128 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f... | 310 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw";
else if(a==1||b==1){
if(a==1) cout<<"Alice";
else cout<<"Bob";
}
else if(a>b) cout<<"Alice";
else if(b>a) cout<<"Bob";
cout<<endl;
ret... | 106 |
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 << "Bob" << endl;
else if (A > B) cout << "Alice" << endl;
else cout << "Draw" << endl;
return 0;
} | 90 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b; cin >> a >> b;
if ((a>b && b!=1) || (a==1 && b!=1)){
cout << "Alice" << endl;
} else if (a==b){
cout << "Draw" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
} | 94 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int i=m;i<n;i++)
using P=pair<int,int>;
int main(){
int a,b;
cin>>a>>b;
a=(a+11)%13;
b=(b+11)%13;
if(a==b) cout<<"Draw"<<endl;
else if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
} | 98 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
string a,b,c;
ll mod(ll a)
{
if(a<inf)return a;
else
return a%inf;
}
void test_cases()
{
ll a,b;
cin>>a>>b;
if(a==1&&b!=1)cout<<"Alice";
else if(a!=1&&b==1... | 177 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a,b,c=1;
cin>>a>>b;
if(a==1&&b==1&&a==b)
{
cout<<"Draw";
return 0;
}
if(a==1){
cout<<"Alice";
return 0;
}
if(b==1){
cout<<"Bob";
return 0;
}
if(a>b)
{
cout<<"Alice";
}
if(b>a){
cout<<"Bob";
}
if(a==b)
cout<<"Draw";
return 0;
} | 124 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d",&a);
scanf("%d",&b);
if(a==1) {
a=13+a;
}
if(b==1) {
b=13+b;
}
if(a>b) {
printf("Alice\n");
}
if(a<b) {
printf("Bob\n");
}
if(a==b) {
printf("Draw\n");
}
return 0;
}
| 109 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d %d",&a,&b);
if(a==b) {
printf("Draw\n");
}
else if(a==1) {
printf("Alice\n");
}
else if(b==1) {
printf("Bob\n");
}
else if(a>b) {
printf("Alice\n");
}
else if(a<b) {
printf("Bob\n");
}
return 0;
} | 100 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int a, b;
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if(b==1)cout<<"Bob"<<endl;
else if(a==1)cout<<"Alice"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else if(a<b)cout<<"Bob"<<endl;
return 0;
}
| 96 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int A,B;
int main(){
cin >> A >> B;
if(A == 1) A += 13;
if(B == 1) B += 13;
if( A < B )cout << "Bob" << endl;
else if( A == B)cout << "Draw" << endl;
else cout << "Alice" << endl;
} | 88 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a == 1 && b == 1) 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 << "Bob";
else cout << "Draw";
return 0;
} | 99 |
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 << "Alice" << endl;
} else if (a < b) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
} | 103 |
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<<"Draw"<<endl;
}
}
| 86 |
Project_CodeNet | 2,018 | #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 cout << "Bob" << endl;
return 0;
} | 89 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | 1,799 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
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;
}
... | 130 |
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 && B != 1) {
cout << ... | 140 |
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 if(a<b){
cout << "Bob" << endl;
}
}... | 113 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
int a, b;
int correct(int x){
return x != 1 ? x : 14;
}
int main(){
scanf("%d%d", &a, &b);
a = correct(a);
b = correct(b);
if(a == b){
puts("Draw");
}
else{
printf("%s\n", a > b ? "Alice" ... | 123 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
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 << "Bob";
}
... | 116 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main... | 156 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
cin>>n>>m;
if(n==1)
{
n=14;
}
if(m==1)
{
m=14;
}
if(n==m)
{
cout<<"Draw";
}
else if(n<m)
{
cout<<"Bob";
}
else
{
cout<<"Alice";
... | 109 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void) {
int a,b;
cin >> a >> b;
if (a == 1)a = 14;
if (b == 1)b = 14;
if (a > b) {
cout << "Alice" << std::endl;
}
else if (a < b)
{
cout << "Bob" << std::endl;
}
else
{
cout << "Draw" << std::endl;
}
return 0;
} | 109 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.