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>
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;
} | 88 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
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... | 99 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(void){
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 if(A < B)
cout << "Bob" << "\n";
retu... | 119 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<string>
using namespace std;
#define MAXN 100010
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a==b)
printf("Draw\n");
else if(b==1)
printf("Bob\n");
else if(a==1)
printf("Alice\n");
els... | 114 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if( (A > B) && (B!=1) ) {
cout << "Alice";
}
else if( (B > A) && (A!=1) ) {
cout << "Bob";
}
else if(A==1 && B > 1) {
cout<< "Alice";
}
else if(B==1 && A > 1) {
cout<<"Bob";
}
else if(A=B) {
cout ... | 136 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define vvec(m,n) vector<vector<int>> (int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main(){
int A, B;
cin >> A >> B;
if(A == 1){
if(B == 1){
cout << "D... | 226 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <numeric>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
string s;
if(a!=1&&b!=1&&a!=b){
cout << (a>b?"Alice":"Bob") << endl;
}
else if(a==b){
cout << "Draw" << endl;
}
el... | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
//typedef pair<int, int> P;
typedef pair<ll, ll> P;
//const double INF = 1e10;
const ll INF = LONG_LONG_MAX;
... | 373 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ill long long int
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
ill a, b;
cin >> a >> b;
if(a == b){
cout << "Draw\n";
retur... | 174 |
Project_CodeNet | 2,017 | #include <iostream>
int main()
{
int A, B;
std::cin >> A >> B;
if ( A == 1 ){
A = 14;
}
if ( B == 1 ){
B = 14;
}
if ( A > B ){
std::cout << "Alice" << std::endl;
}else if ( A < B ){
std::cout << "Bob" << std::endl;
}else{
std::cout << "Draw" << std::endl;
}
return 0;
} | 117 |
Project_CodeNet | 2,017 | #include<iostream>
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<B) cout<<"Alice";
else cout << "Bob";
}else{
if(A==B) cout<<"Draw" << endl;
else if(A<B) cout<<"Bob";
else cout << "Ali... | 100 |
Project_CodeNet | 2,020 | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
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) {
... | 146 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
a=(14-a)%13;
b=(14-b)%13;
if(a==b)cout<<"Draw"<<endl;
else if(a>b)cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
}
| 73 |
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+=13;
if(b==1) b+=13;
if(a>b) cout << "Alice";
else if(a<b) cout << "Bob";
else cout << "Draw";
} | 111 |
Project_CodeNet | 2,020 | #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){puts("Alice");}
else if(b>a){puts("Bob");}
else{puts("Draw");}
return 0;
} | 77 |
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;
else cout << "Bob" << endl;
} | 103 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)printf("Draw\n");
else if((a==1&&b!=1)|| a>b&&b!=1)printf("Alice\n");
else if((b==1&&a!=1)|| b>a&&a!=1)printf("Bob\n");
}
| 85 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <tuple>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <array>
#include <utility>
#include <valarray>
using namespace std;
int main()
{
int A, B;
scanf("%d %d\n", &A, &B);
if (... | 143 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <numeric>
#include <algorithm>
#include <utility>
using std::cout;
using std::cin;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a... | 321 |
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;
if (A<B) cout << "Bob" <<endl;
if (A==B) cout << "Draw" <<endl;
return 0;
} | 97 |
Project_CodeNet | 2,018 | // IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
// namespace
usi... | 747 |
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 if (a=b) {
cout << "Draw" << endl;
}
r... | 118 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A!=1&&B!=1){
if(A>B)cout<<"Alice";
else if(A==B)cout<<"Draw";
else cout<<"Bob";
}
else if(A!=1&&B==1)cout<<"Bob";
else if(A==1&&B!=1)cout<<"Alice";
else cout<<"Draw";
}
| 101 |
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;
return 0;
} | 107 |
Project_CodeNet | 2,020 |
// A - One Card Poker
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
int main() {
int A, B;
cin >> A >> B;
string ans;
if (A == B) ans = "Draw";
else if (A == 1) ans = "Alice";
else if (B == ... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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";
} | 68 |
Project_CodeNet | 2,020 | #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){
cout<<"Alice"<<endl;
}
else if(B==1){
cout<<"Bob"<<endl;
}
else if(A>B){
... | 127 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#include <cmath>
#define _USE_MATH_DEFINES
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i... | 238 |
Project_CodeNet | 2,017 | #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&&!(a==13&&b==1))cout<<"Alice"<<endl;
else if(!(a==1&&b==13))cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
return 0;
}
| 90 |
Project_CodeNet | 2,018 | #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&&a>b))
printf("Alice\n");
else
printf("Bob\n");
} | 69 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "YES" : "NO") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
//vector<string> split(string,string);
//template<typename T>
//void swap(T*,T*);
//char ToUpper (char... | 189 |
Project_CodeNet | 2,020 | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#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<<"Alice"<<endl;
}
else if (A < B) {
cout << "Bob" << endl;
}
else {
cout... | 118 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main () {
static 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... | 107 |
Project_CodeNet | 2,019 | #include <iostream>
int main(){int a,b;std::cin>>a>>b;(a==1?a=14:a=a);(b==1?b=14:b=b);std::cout<<(a==b?"Draw":a>b?"Alice":"Bob");} | 57 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sstream>
#include <un... | 253 |
Project_CodeNet | 2,017 | #include <iostream>
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(a < b) printf("Bob\n");
else printf("Draw\n");
return 0;
}
| 83 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
int a,b;
cin >> a;
cin >> b;
if(a == b)
cout<<"Draw";
else if(a==1)
cout<<"Alice";
else if(b==1)
cout<<"Bob";
else if(a!=1 && a>b)
cout<<"Alice";
else if(b!=1 && a<b)
cout<<"Bob";
return 0;
}
| 88 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include <queue>
#include <utility>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using namespace std;
string YorN(bool P) { if (P)return "Yes"; else return "No"; }
int main() {
int A,B;... | 143 |
Project_CodeNet | 2,020 | // ABC054A -
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
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 {
... | 132 |
Project_CodeNet | 2,018 | #include<iostream>
int main() {
int a, b,c;
std::cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
c = a - b;
if (c==0) {
std::cout << "Draw" << std::endl;
}
else {
if (c > 0) {
std::cout << "Alice" << std::endl;
}
else {
std::cout << "Bob" << std::endl;
}
}
} | 131 |
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 << "Bob" << endl;
else
cout << "Draw" << endl;
}
| 87 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int flag = 0;
if(a == 1 && b !=1){
cout<<"Alice"<<endl;
flag = 1;
}else if(b == 1 && a !=1){
cout<<"Bob"<<endl;
flag = 1;
}else if(a==1 && b==1){
cout<<"Draw"<<endl;
flag = 1;
}
if(flag == 0){
if(a > b){
cout<<"Alic... | 158 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
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 if(a == b) cout << "Draw" << endl;
} | 101 |
Project_CodeNet | 2,019 | /// Containers Start
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include... | 686 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <climits>
int main(int argc, char **argv) {
int a ,b;
std::cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a < b) {
... | 150 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;
int main(){
int a,b;
cin>>a>>b;
if(a<b&&!(a==1&&b==13)||a==13&&b==1) cout<<"Bob"<<endl;
el... | 135 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pw(x) (1LL << (x))
#define db(x) cerr << #x << " = " << x << endl
#define db2(x, y) cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"
#define db3(x, y, z) cerr << "(" << #x << ", " << #y << ... | 254 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
void hawawa()
{
unsigned int a, b;
cin >> a >> b;
a -= 2;
b -= 2;
if (a > b) {
cout << "Alice\n";
}
else if (a < b) {
cout << "Bob\n";
}
else {
cout << "Draw\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
hawawa();
r... | 120 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
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;
}
| 93 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<math.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 ;
... | 103 |
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;
return 0;
}
else if(a == b)
{
cout << "Draw" << endl;
return 0;
}
else
{
cout << "Bob" << endl;
return 0;
}
return 0;
} | 126 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int alice, bob;
cin >> alice >> bob;
if (alice == 1) {
alice = 14;
}
if (bob == 1) {
bob = 14;
}
if (alice == bob) {
cout << "Draw" << endl;
} else if (alice > bob) {
cout << "Alice" << endl;
} ... | 116 |
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 (a == b) cout << "Draw" << endl;
else cout << "Bob" << endl;
}
| 95 |
Project_CodeNet | 2,017 | #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 repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;
char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
i... | 493 |
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<<"Alice"<<endl;
else if(A<B)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
else if(A==1&&B!=1)cout<<"Alice"<<endl;
else if(A!=1&&B==1)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
| 111 |
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;
}
| 86 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
long long a,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}else{
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a>b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}
return 0;
} | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 176 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int a=0;
int b=0;
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;
} | 92 |
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 pii = pair<int,int>;
int main(){
int a,b;
cin >> a >> b;
if(a == 1)a = 14;
if(b == 1)b = 14;
if(a < b)cout << "Bob" << endl;
if(a == b)cout << "Draw" << endl;
if(a > b)cout ... | 122 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
//#define int long long
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;
}
| 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
A = A == 1 ? 14 : A;
B = B == 1 ? 14 : B;
if (A < B)
cout << "Bob" << endl;
else if (A > B)
cout << "Alice" << endl;
else
cout << "Draw" << endl;
return 0;
} | 106 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void)
{
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("Alice\n");
}
else if(a<b)
{
printf("Bob\n");
}
else
{
printf("Draw\n");
}
return 0;
}
| 117 |
Project_CodeNet | 2,019 | #include<iostream>
#include<math.h>
#include <algorithm>
#include<float.h>
#include <limits>
#include <vector>
#include <numeric>
#define rep(i,a,n) for(int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define ll long long
using namespace::std;
int main(){
... | 203 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = 2100100100;
co... | 412 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int a,b;
while(scanf("%d%d",&a,&b)==2)
{
if(a == 1)
a = 14;
if(b == 1)
b = 14;
if(a > b)
printf("Alice\n");
else if(a == b)
... | 112 |
Project_CodeNet | 2,017 | #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"<<endl;
}
}
... | 111 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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;
}
else if(B>A){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
} | 100 |
Project_CodeNet | 2,020 | #include <cstdio>
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");
}
else if (b > a)
{
printf("Bob");
}
else if (a == b)
{
... | 117 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_wit... | 197 |
Project_CodeNet | 2,017 | #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;
string res;
if (A > B)
res = "Alice";
else if (A < B)
res = "Bob";
else
res = "Draw";
cout << res << endl;
return 0;
}
| 100 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a > b) {
cout << "Alice\n";
} else if (b > a) {
cout << "Bob\n";
} else {
cout << "Draw\n";
}
return 0;
}
| 113 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int A,B;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl; return 0;
}
if(A==1) {
cout<<"Alice"<<endl; return 0;
}
if(B==1){
cout<<"Bob"<<endl; return 0;
}
if(A>B) cout<<"Alice"<<endl;
if(A<B) cout<<"Bob"<<endl;
}
| 110 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define INF 1000000007
#define LINF 1000000000000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int a, b;
int main(){
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a > b && b != 1 || a == 1) cout << "Alice" << endl;
else cout << "Bob" << endl... | 112 |
Project_CodeNet | 2,017 | #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define M... | 481 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a < b && a != 1) cout << "Bob" << endl;
else if(a > b && b != 1) cout << "Alice" << endl;
else if(a < b && a == 1) c... | 122 |
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;
} | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;string ans;
cin >>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a>b)ans="Alice";
if(a<b)ans="Bob";
if(a==b)ans="Draw";
cout << ans << endl;
} | 85 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define r(i,n) for(int i = 0; i<n; i++)
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;
} | 115 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N) for (int i = 0; i ... | 463 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int f(int a, int b) {
if (a == 1) {
if (b == 1) {
return 0;
} else {
return 1;
}
} else if (b == 1) {
return -1;
}
if (a > b) {
return 1;
}
if (a < b) {
return -1;
}
return ... | 190 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <string>
#include <iostream>
#include <map>
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 << "Draw" << endl;
return 0;
}
string str=a>b?"Alice":"Bob";
cout << str << endl;
return ... | 100 |
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 if (a < b)
cout << "Bob" << endl;
... | 118 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std ;
int main(void){
int a, b ;
scanf("%d %d",&a,&b) ;
if(a<b) {
if(a==1) printf("Alice\n") ;
else printf("Bob\n") ;
} else if(a>b) {
if(b==1) printf("Bob\n") ;
else printf("Alice\n") ;
} else if(a==b) printf("Draw\n") ;
return 0 ;
} | 100 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tupl... | 342 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a = (a-2+13)%13;
b = (b-2+13)%13;
cout << (a > b?"Alice": (a==b?"Draw":"Bob")) << endl;
return 0;
} | 74 |
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";
else if(a<b)
cout<<"Bob";
else
cout<<"Draw";
} | 78 |
Project_CodeNet | 2,017 | #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;
... | 106 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
int A, B; cin >> A >> B;
string ans;
if (A == B) {
ans = "Draw";
} else if (A == 1) {
ans = "Alice";
} else if (B == 1) {
ans = "Bob";
} else if (A > B) {
ans = "Alice";
} else {
... | 123 |
Project_CodeNet | 2,019 | #include<iostream>
#include <algorithm>
#include <string>
#define rep(i,n)for(i=0;i<n;i++)
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" << ... | 147 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw";
else if(a<b && a!=1)
cout<<"Bob";
else if(b==1)
cout<<"Bob";
else cout<<"Alice";
} | 72 |
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 << "Bob" << endl;
else cout << "Alice" << endl;
return 0;
}
| 98 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<climits>
#include<sstream>
#include<deque>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<bitset>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
type... | 156 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a>b and b!=1){
cout<<"Alice";
}
if(a<b and a!=1){
cout<<"Bob";
}
if(a==b){
cout<<"Draw";
}
if(a==1 and b!=1){
cout<<"Alice";
}
if(b==1 and a!=1){
cout<<"Bob";
}
} | 104 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 13 && b == 1)
cout << "Bob" << endl;
else if (a == 1 && b == 13)
cout << "Alice" << endl;
else if (a > b)
cout << "Alice" << endl;
else if (b > a)
cout << "Bob" << ... | 122 |
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)
{
cout<<"Alice"<<endl;
}
else if(A!=1&&B==1)
{
cout<<"Bob"<<endl;
}
else if(A>B){
... | 119 |
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;
cout << (a != b ? (a < b ? "Bob" : "Alice") : "Draw") << endl;
return 0;
}
| 78 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int list[13] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1};
int anum, bnum;
for (int i = 0; i < 13; i++) {
if (a == list[i]) {
anum = i;
}
if (b == list[i]) {
bnum = i;... | 186 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
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;... | 116 |
Project_CodeNet | 2,017 |
#include<iostream>
//#include<bits/stdc++.h>
#include<cmath>
#include<string>
#include<cstdio>
#include<cstring>
#include<queue>
#define pq priority_queue
#define Pi acos(-1.0)
using namespace std;
#define MOD 1000000007
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
printf("Draw\n");
else
{
... | 158 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.