Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,017 | /*** Template Begin ***/
#define USING_BOOST
#define USING_NAMESPACE
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#includ... | 1,483 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... | 455 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
using namespace std;
#define 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";
if(a<b)cout << "Bob";
if(... | 107 |
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 argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if(a==1||b==1){
i... | 150 |
Project_CodeNet | 2,017 | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | 487 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define ... | 428 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <utility>
using namespace std;
#define fol(i,n) for (int i=0;i<n;i++)
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... | 123 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<string.h>
#include<queue>
#include<math.h>
#include<set>
#include<unordered_set>
#include<limits.h>
using namespace std;
typedef unsigned long long ll;
int main(){
int a,b;
cin>>a>>b;
if(a==b){
cout<... | 147 |
Project_CodeNet | 2,017 | #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;
string ans = a > b ? "Alice" : "Bob";
if (a==b)
ans = "Draw";
cout << ans << '\n';
return 0;
} | 101 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)
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;
return 0;
}
if(a > b){
c... | 136 |
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<string>
#include<set>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<functional>
using namespace std;
#define LL long long
#define MOD 100000
#define inf 1999999999
int main() {
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << end... | 145 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll... | 222 |
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 << "Alice";
else if(A < B)
cout << "Bob";
else
cout << "Draw";
cout << endl;
} | 86 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 1... | 150 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | 249 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define repr(i,a,b) for(long long i=(long long)(a);i<(long long)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()... | 448 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int A, B;
cin >> A >> B;
if(A==1) A+=14;
if(B==1) B+=14;
bool c1 = A>B;
bool c2... | 172 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed 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 if( A == B ) cout << "Draw" << endl;
} | 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
scanf("%d %d", &x, &y);
if (x == y) {
puts("Draw");
return 0;
}
if (x == 1 || y == 1) {
if (x == 1) puts("Alice");
else if (y == 1) puts("Bob");
return 0;
}
if (x > y) puts("Alice");
else puts("Bob");
return 0;
} | 116 |
Project_CodeNet | 2,020 | #include<iostream>
int main(){
int a, b;
std::cin >> a >> b;
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a == b)
std::cout << "Draw";
else if( a > b)
std::cout << "Alice";
else if(a < b)
std::cout << "Bob";
return 0;
} | 98 |
Project_CodeNet | 2,020 | #include <iostream>
#include<algorithm>
#include<string>
#include <cmath>
#include <vector>
#include <map>
#include <cstdio>
#pragma region Macros
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define all(x) (x).begin(),(x).end()
#define swap(a,b) (a += b,b = a - b,a... | 338 |
Project_CodeNet | 2,018 | #include<iostream>
#include<math.h>
#include<vector>
#include<stdio.h>
#include<string>
using namespace std;
int main(void){
int a,b;
cin>>a;
cin>>b;
if(a==1){
if(b==1){
cout<<"Draw"<<endl;
return 0;
}
}
if(a==1){
cout<<"Alice"<<endl;
re... | 174 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int card[] = {13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
if (card[A-1] == card[B-1]) {
cout << "Draw" << endl;
}
else if (card[A-1] > card[B-1]) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
}... | 137 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
if((a == 1 && b == 13) || (a == 13 && b == 1)){
if(a == 1) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
else{
if(a > b) cout<<"Alice"<<endl;
else if(a < b) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
} | 112 |
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 if(a>b){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
} | 99 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
void Main() {
int A, B;
cin >> A >> B;
if (A == 1 && B == 1) {
cout << "Draw" << endl;
}
else if (A == 1) {
cout << "Alice" << endl;
}
else if (B == 1) {
cout << "Bob" << endl;
}
else {
cout << (A > B ? ... | 157 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main() {
string S;
long long int N, M;
cin >> N >> M;
if( M == N ) {
cout << "Draw" << endl;
} else if(M==1 || (M > N&&N!=1) ) {
cout << "Bob" << endl;
} else {
cout << "Alice" << endl;
}
} | 90 |
Project_CodeNet | 2,020 | #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(a<b){
cout<<"Bob"<<endl;
}else{
cout<<"Draw"<<endl;
}
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main( ) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t,a,b;
t = 1;
while(t--) {
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 <... | 131 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std;
int main(){
int a, b;
scanf("%d %d", &a, &b);
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a == b){
printf("Draw\n");
} else if (a > b ){
printf("Alice\n");
} else{
printf("Bob\n");
}
return 0;
} | 102 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#de... | 285 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | 555 |
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
{
if(a>b)
cout<<"A... | 110 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if( (a == 1 && b == 13) || (2 <= a && a <= 13 && 2 <= b && b <=13 && a > b)) cout << "Alice" << endl;
else if ( a == b) cout << "Draw" << endl;
else cout << "Bob" << endl;
} | 101 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
using namespace std;
int main(){
int bobNum, aliceNum;
cin >> bobNum >> aliceNum;
if (bobNum == 1)bobNum = 14;
if (aliceNum == 1)aliceNum = 14;
if (bobNum > aliceNum){
cout << "Alice" << endl;
}
else if (aliceNum > bobNum){
cout << "Bob" << endl;
}
else{ cout << ... | 114 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int a,b; 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;
else if(a<b) cout<<"Bo... | 113 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template<class S,class T> ostream &operator << (ostream& out,const pair<S,T>& o){
out << "(" << o.first << "," << o.second << ")"; return out;
}
/*
At... | 897 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <cstdlib>
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";
} | 97 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl
#define YORN(f) cout<<((f)?"YES":"NO")<<endl
#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 = 14;
}
if (b <= 1) {
... | 186 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
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... | 123 |
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<<"Bob"<<endl;
}
} | 103 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
int A, B; cin >> A >> B;
string res = "Draw";
if(A > B) {
... | 176 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(){
int a,b;
int i,j;
int cards[13] = {2,3,4,5,6,7,8,9,10,11,12,13,1};
scanf("%d %d",&a,&b);
for(i=0;i<13;i++) if(a==cards[i]) break;
for(j=0;j<13;j++) if(b==cards[j]) break;
if(i>j){
printf("Alice\n");
}else if(i<j){
printf("Bob\n");
}else{
printf("Draw\n");
}
ret... | 136 |
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<b){
if(a==1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}else if(a>b){
if(b==1){
... | 124 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a = (a + 13) % 15;
b = (b + 13) % 15;
if (a == b) {
cout << "Draw" << endl;
}
else if (a < b) {
cout << "Bob" << endl;
}
else {
cout << "Alice" << endl;
}
return 0;
} | 105 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n... | 241 |
Project_CodeNet | 2,020 | #pragma gcc optimize("Ofast")
#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 ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) SOR... | 702 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define OUT(x) cout << (x) << endl;
#define ALL(v) v.begin(), v.end()
#define REP(i, n) for (int i=0; i<(int)(n); ++i)
int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};
const int MAX_X=50,
MAX_Y=50;
const ll INF = 10e9;... | 215 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
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;
} | 111 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
// #include <math.h>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
//#include <bits/stdc++.h>
using namespace std;
#define print(x) cout<<(x)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#de... | 161 |
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 ... | 110 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1) a=100;
if(b==1) b=100;
if(a==b) cout<<"Draw";
else if(a>b) cout<<"Alice";
else cout<<"Bob";
} | 71 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a, b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a == b)
cout << "Draw\n";
else if(a < b)
cout << "Bob\n";
else
cout << "Alice\n";
} | 109 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <ctype.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<b)?"Alice":"Bob") << endl;
else
cout << ((a>b)?"Alice":"Bob") << endl;
return 0;
} | 99 |
Project_CodeNet | 2,018 | #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) {
cout << "Draw" << endl;
} else if (A>B) {
cout << "Alice" << endl;
} else if (A<B) {
... | 149 |
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";
} | 69 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(){
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 {
printf("Bob\n");
}
return 0;
}
| 113 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,... | 341 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 298 |
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" << ... | 112 |
Project_CodeNet | 2,017 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a == b) {
std::cout << "Draw" << std::endl;
} else if (a == 1 && b > 1) {
std::cout << "Alice" << std::endl;
} else if (a > 1 && b==1) {
std::cout << "Bob" << std::endl;
} else if (a > b) {
std::cout << "Alice" << std::endl;
} else {
std::cout << "Bob... | 135 |
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 == 1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}else{
if(a < b){
... | 120 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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<<"Alice"<<endl;
if(a==b)
cout<<"Draw"<<endl;
if(a<b)
cout... | 115 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <algorithm>
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 << "Alice" << endl;
}
else
{
cout << "Bob" << endl;
}
} | 113 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define r(i,a,n) for(int i=a;i<n;i++)
int main(){
int a,b,c;
string s;
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;
} | 88 |
Project_CodeNet | 2,017 | #include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>
using names... | 211 |
Project_CodeNet | 2,017 | //
// A - One Card Poker
//
#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 ? "Alice" : (A < B ? "Bob" : "Draw")) << endl;
} | 88 |
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 << "Alice" << endl;
}
else{
cout << "Draw" << endl;
}
} | 99 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main()
{
int a,b;
scanf("%d %d",&a,&b);
if(a==1||b==1)
{
if(a==b)
{
printf("Draw\n");
}
else if(a==1&&b!=1)
{
printf("Alice\n");
}
else if(b==1&&a!=1)
{
printf("Bob\n");
}
}
else
{
if(a>b) printf("Alice\n");
else if(b>a) printf("Bob\n");
else printf("D... | 144 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
using namespace std;
int main() {
int a, b; cin >> a >> b;
if (a == 1 && b != 1 || a > b && b != 1)
cout << "Alice";
else if (a == b)
cout << "Draw";
//else if (b == 1 && a != 1 || b > a)
... | 140 |
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 << "Bob" << endl;
}
| 104 |
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);
if (A > B) {
cout << "Alice" << endl;
} else if (A < B) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
return 0;
}
| 113 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define MP make_pair
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
ll INF = 1e18;
void chmin(ll &a,ll b){if(a>b)a=b;}
void ch... | 420 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <casser... | 544 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
type... | 238 |
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 {
cout << (a>b?"Alice":"Bob") << endl;
}
return 0;
}
| 87 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main(int argc, char const *argv[]){
int a, b;
scanf("%d %d",&a, &b);
if(a == 1 && b == 1){
printf("Draw\n");
return 0;
}
else if(a == 1){
printf("Alice\n");
return 0;
}
else if(... | 173 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <functional>
#include <iomanip>
#include <bitset>
#include <numeric>
#include <queue>
#include <map>
#include <cstdint>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
const long long mod = 10000000... | 253 |
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<< ((a==b) ? "Draw" : (a>b) ? "Alice" : "Bob");
}else{
if(a==b)cout<<"Draw";
else cout << ((a==1) ? "Alice" : "Bob");
}
return 0;
}
| 103 |
Project_CodeNet | 2,017 | //This is getting accepted!
// I HATE BUG
// God Of The Bugs
// 12/11/2016
#include<bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FI first
#define SE second
#define pb push_back
#define mp make_pair
#define ll long long
#define sz(a) ((int)(a).size())
#define __builtin_popcount ... | 512 |
Project_CodeNet | 2,019 | #include <iostream> // cin, cout, cerr, clog
#include <algorithm> // minmax, sort, swap
#include <numeric> // iota, accumulate, inner_product
#include <cstdio> // printf, scanf
#include <climits> // INT_MIN, LLONG_MIN
#include <cmath> // long, trig, pow
#include <string> // string, stoi, to_string
#include <vector> // ... | 360 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if ((A + 12) % 14 > (B + 12) % 14) cout << "Alice" << endl;
else if ((A + 12) % 14 < (B + 12) % 14) co... | 154 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <climits>
int main()
{
long A,B;
std::cin >> A >> B;
if(A==B){
std::cout << "Draw" << std::endl;
}else if(A==1 || (B!=1 && B<A)){
std::cout << "Ali... | 125 |
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<<"Alice"<<endl;
return 0;
}
if(b==1 && a!=1){
cout<<"Bob"<<endl;
return 0;
}
if(a>b)cout<<"Alice"<<endl;
else if(a<b)cout<<"Bob"<<endl;
else cout<<"Dra... | 110 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
int main() {
int a, b;
std::cin >> a >> b;
if (a == b) std::cout << "Draw\n";
else if (a == 1) std::cout << "Alice\n";
else if (b == 1) std::cout << "Bob\n";
else std::cout << (std::max(a, b) == a ? "Alice\n" : "Bob\n");
return 0;
}
| 108 |
Project_CodeNet | 2,018 | #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 if(a > b) cout << "Alice" << endl;
} | 97 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using n... | 204 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree... | 1,001 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll a,b;
cin >> a >> b;
a=(a+11)%13;
b=(b+11)%13;
if(a<b) cout << "Bob" << endl;
else ... | 135 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw\n";
else if (a == 1 || b != 1 && a > b)
cout << "Alice\n";
else
cout << "Bob\n";
return 0;
}
| 90 |
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;
return 0;
} | 106 |
Project_CodeNet | 2,019 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 601 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll... | 230 |
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 (B > A) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
}
else if (A == B == 1) {
cout << "Dr... | 163 |
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(b > a){
cout << "Bob" << endl;
}else if(a == b){
cout << "Draw" << endl;
}
else {
cout << "Draw"... | 127 |
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;
} | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int sa = (a+11)%13;
int sb = (b+11)%13;
if(sa > sb){
cout << "Alice";
} else if(sa < sb){
cout << "Bob";
} else {
cout << "Draw";
}
}
| 87 |
Project_CodeNet | 2,018 | #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | 462 |
Project_CodeNet | 2,018 |
#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" << endl;
return 0;
}
if(a > b) {
cout << "Alice" << endl;
return 0;
}
if(a < b) {
cout << "Bob" << endl;
return 0;
}
} | 124 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>... | 908 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.