Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
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 << "Bob" << endl;
}el... | 128 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
const int MAX_N = 100005;
int main()
{
int a,b;
cin >> a >> b;
if(a==1){
if(b!=1){
cout << "Alice\n";
}else{
cout << "Draw\n";
... | 161 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <set>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
using namespace std;
typedef long long int lli;
int main(){
int A,B;
cin>>A>>B;
if(A==B)cou... | 137 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
int main(){
int a,b;
string s;
cin >> a >> b;
if (a==b) cout << "Draw" << endl;
else if (a == 1) cout <<"Alic... | 160 |
Project_CodeNet | 2,017 | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... | 712 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if(a==1) a = 14;
if(b==1) b = 14;
if(a>b) puts("Alice");
else if(a<b) puts("Bob");
else puts("Draw");
return 0;
}
| 74 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
... | 257 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<cstring>
//#define Mfc_Tanzim
typedef long long ll;
#define ull unsigned long long
#define pb push_back
#define ff first
#define ss second
#define all(v) (v.begin(), v.end())
#define pi acos(-1.0)
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define bug(a) cerr... | 344 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
long 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,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int A, B;
cin >> A >> B;
bool one = false;
if ((A == 1) || (B == 1)) {
one = true;
}
if (one) {
if (A == 1 && B == 1) {
cout << "Draw" << endl;
} else i... | 209 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1... | 191 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <string>
#include <iostream>
using namespace std;
#define scii(x, y) int x, y; scanf("%d%d", &x, &y);
int main() {
scii(A,B);
string ans;
if(A>B)ans="Alice";
if(A<B)ans="Bob";
if(B==1)ans="Bob";
if(A==1)ans="Alice";
if(A==B)ans="Draw";
cout<<ans<<endl;
} | 111 |
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 << "Draw" << endl;
else if(A == 1) cout << "Alice" << endl;
else if(B==1) cout << "Bob" << endl;
else if(A == B)cout << "Draw" << endl;
else if(A>B)cout << "Alice" << endl;
else if(B>A)cout << "Bob"... | 121 |
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;
cout << ((A > B) ? "Alice" : (A < B) ? "Bob" : "Draw") << "\n";
} | 85 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb pushback
#define fr(i,n) for(int i=0;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
int main() {
int x,y;
cin >> x>> y;
string ans;
if((x+11)%13>(y+11)%13)ans="Alice";
else if((x+11)%13<(y+11)%13)ans="Bob";
else ans=... | 124 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
cout << (a > b ? "Alice" : (b > a) ? "Bob" : "Draw") << '\n';
return 0;
} | 103 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | 248 |
Project_CodeNet | 2,018 | #include<stdio.h>
const int ans[]={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
int A,B;
int main(void){
scanf("%d%d",&A,&B);
if(ans[A]>ans[B])
puts("Alice");
else if(ans[A]==ans[B])
puts("Draw");
else
puts("Bob");
return 0;
} | 90 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (((a != 1 && b != 1) && a > b) || (a == 1 && b != 1)) {
cout << "Alice" << "\n";
}else if (a == b) {
cout << "Draw" << "\n";
}else {
cout << "Bob" << "\n";
}
} | 122 |
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(a==1 && b==1) cout << "Draw" << endl;
else if(a!=1 && b==1) cout << "Bob" << endl;
else if(a>b) cout << "Alice" << endl;
else if(a==b) cout << "Draw" << endl;
else cout << "Bob" << endl;... | 114 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
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 ans = ((a > b) ? "Alice" : "Bob");
cout << ans << endl;
return 0;
} | 102 |
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;
}
} | 103 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
/* テンプレここから */
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i, start, end) for(int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1e9)
#define add_mod(a, b, x) ( (ll)(a) + (ll)(b) ) % (ll)(x)
#define mul_mo... | 500 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if (a == 1) a = 15;
if (b == 1) b = 15;
if (a > b)
cout << "Alice" << endl;
else if (b > a)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
}
| 98 |
Project_CodeNet | 2,017 | #include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#incl... | 272 |
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 if(a<b ){cout<<"Bob";}
} | 79 |
Project_CodeNet | 2,018 | #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"<<endl;
}else if(a<b){
cout<<"Bob"<<endl;
}else{
cout<<"Draw"<<endl;
}
}
| 73 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,n) for(int i=(n)-1;i>=0;--i)
#define rrep2(i,a,b) for(int i=(a)-1;i>=b;--i)
#define range(i,a,b,c... | 688 |
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 << "Draw" << endl;
}
else if(a > b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
} | 105 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
if (a==1 && a!=b) cout << "Alice";
else if (b=... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << var;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int a, b; cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) cout << "... | 171 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1... | 845 |
Project_CodeNet | 2,019 | #include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | 247 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 451 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int a = (cin >> (a), a),
b = (cin >> (b), 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... | 125 |
Project_CodeNet | 2,018 | #include<iostream>
int main(void){
int a, b; std::cin >> a >> b;
if(a==b) std::cout << "Draw" << std::endl;
else{
if(a==1 || (a>b && b!=1)) std::cout << "Alice" <<std::endl;
else if(b==1 || a<b) std::cout << "Bob" << std::endl;
}
return 0;
}
| 102 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define INF (1e9)
int A, B;
int main() {
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
... | 148 |
Project_CodeNet | 2,018 | #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 cout<<(a>b?"Alice":"Bob");
}
}
| 87 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define infi 2e9
#define infl 5e18
#define MX 100005
#define pi 2*acos(0.0)
#define ll long long
#define rr read()
#define ff first
#define ss second
#define pb push_back
#define pi... | 530 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int a,b;
cin>>a>>b;
if (a==1 && b==1)
cout<<"Draw\n";
else i... | 164 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | 292 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1 || b == 1)
cout << (a == 1 ? "Alice" : "Bob") << endl;
else
... | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using intl = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define repd(i, n) for(intl i = (intl)(n); i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define repid(i, a, b) for(intl i = (intl)(a); i >... | 685 |
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 <<"Bob" << endl;
}
else if(a == b){
cout << "Draw" << endl;
}
else{
cout <<"Alice" << endl;
}
}
| 101 |
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 << "Draw" << endl;
}else if(a < b){
cout << "Bob" << endl;
}else{
cout << "Alice" << endl;
}
return 0;
} | 104 |
Project_CodeNet | 2,017 | #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;
}else if(a > b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
} | 100 |
Project_CodeNet | 2,018 | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int a, b;
cin >> a >> b;
if(a > b && b != 1){
cout << "Alice" << endl;
}
else if(a > b && b == 1){
cout << "Bob" << endl;
}
else if(a < b && a != 1){
cout << "Bob"... | 148 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
void A(){
cout << "Alice\n";
}
void B(){
cout << "Bob\n";
}
void D(){
cout << "Draw\n";
}
int main(){
int a, b;
cin >> a >> b;
if (a == 1){
if (b == 1)D();
else A();
}
else if (b == 1)B();
else if (a == b)D();
else if (a > b)A();
else B();
return 0;
} | 110 |
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;
} | 95 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
using Pos = std::pair<int, int>;
//cout<<fixed<<std:cout<<fixed<<setprecision(2)<<Max<<endl;
constexpr... | 162 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
void solve(){
int a, b; cin>>a>>b;
a = a == 1 ? 14 : a;
b = b == 1 ? 14 : b;
if(a == b)
cout<<"Draw"<<endl;
else
cout<<((a>b)?"Alice" : "Bob")<<endl;
}
int main(){
solve();
Bye;
} | 106 |
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 << "Draw" << endl;
}
else if(A<B){
cout << "Bob" << endl;
}
} | 111 |
Project_CodeNet | 2,017 | #include <iostream>
int A = 0, B = 0;
int main(void){
std::cin >> A >> B;
A = (A == 1) ? 14 : A;
B = (B == 1) ? 14 : B;
if(A == B){
std::cout << "Draw" << std::endl;
}else if(A > B){
std::cout << "Alice" << std::endl;
}else{
std::cout << "Bob" << std::endl;
}
} | 118 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if (a > b && b != 1){
cout << "Alice";
}
else if (a == 1 && b != 1){
cout << "Alice";
}
else if (a < b && a != 1){
cout << "Bob";
}
else if (a != 1 && b == 1){
cout << "Bob";
}
else{
cout << "Draw... | 123 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
#include<algorithm>
typedef long long ll;
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << endl;
}
if (a == 1)
{
if (a < b) {
cout << "Alice" << endl;
}
}
if (b == 1) {
if (a > b) {
cout << "Bob" << endl;
}
}
if (... | 169 |
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";
} else if (B > A) {
cout << "Bob";
} else {
cout << "Draw";
}
return 0;
}
| 106 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
using namespace std;
int a, b;
int main()
{
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a == b) cout << "Draw";
else if (a > b) cout << "Alice";
else cout << "Bob";
cout << endl;
return 0;
} | 90 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a == b) cout << "Draw\n";
else if (a > b) cout << "Alice\n";
else cout << "Bob\n";
re... | 114 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x... | 292 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int strength[14] = {
0, 100, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
};
int main(){
ios_base::sync_with_stdio(false);
int A, B; cin >> A >> B;
if (strength[A] > strength[B]){
cout << "Alice";
}
else if (strength[B] > strength[A]){
cou... | 140 |
Project_CodeNet | 2,019 | // clang-format off
#include <bits/stdc++.h>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (size_t i = 0; i < size_t(n); i++)
#define forn1(i,n) for (size_t i = 1; i <= size_t(n); i++)
#define popcnt __builtin_popcount
#define ffs __builtin_ffs
#define ctz __builtin_ctz
#define clz __... | 460 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;cin>>a>>b;
int A=(a+11)%13,B=(b+11)%13;
if (A==B) cout<<"Draw"<<endl;
else cout<<(A>B ? "Alice":"Bob")<<endl;
return 0;
} | 78 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if( (B!=1 and B < A) or (A==1 and B==13)){
cout << "Alice" << endl;
}
else if (A!=1 and A < B or (B == 1 and A == 13))
{
cout << "Bob" << endl;
}else if ( A==B ){
cout << "Draw" << endl;
... | 118 |
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" ;
return 0;
} | 89 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b;
cin>>a>>b;
if(a==... | 128 |
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";
}
}
}
| 109 |
Project_CodeNet | 2,018 | //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 <... | 4,977 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string.h>
using namespace std;
int main(void){
int AliceCard,BobCard;
string Winner;
cin>>AliceCard>>BobCard;
Winner="Alice";
if(AliceCard==BobCard){
Winner="Draw";
}else if((BobCard>AliceCard&&AliceCard!=1)||BobCard==1){
Winner="Bob";
... | 95 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A < B) printf("Bob\n");
else if (A > B) printf("Alice\n");
else printf("Draw\n");
return 0;
} | 88 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#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... | 255 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
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;
} | 89 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw";
else if ( a == 1)
cout << "Alice";
else if (b == 1)
cout << "Bob";
else if (a > b )
cout << "Alice";
else if (b > a )
cout << "Bob";
... | 102 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <map>
#define N 100005
using namespace std;
typedef long long ll;
ll x;
int n;
int a, b;
int main() {
cin>>a>>b;
if (a == b) cout<<"Draw"<<endl;
else {
if (a == 1) cout<<"Alice"<<endl;
else if (b == 1) ... | 134 |
Project_CodeNet | 2,017 | #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;cout<<(a>b?"Alice":a<b?"Bob":"Draw")<<endl;return 0;} | 58 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | 286 |
Project_CodeNet | 2,017 | #define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#define DUMP(x) std::cerr << "(DUMP) " << (#x) << ": " << x << std::endl
#include <iostream>
#... | 1,692 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int a,b;
int main()
{
cin >> a >> b;
if((a+11)%13<(b+11)%13)printf("Bob");
if((a+11)%13>(b+11)%13)printf("Alice");
if((a+11)%13==(b+11)%13)printf("Draw");
} | 81 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else if((a > b || a == 1) && b != 1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
} | 103 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
//int aa[] = {0, 2,3,4,5,6,7,8,9,10,11,12,13,1} ;
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";
} el... | 144 |
Project_CodeNet | 2,017 |
#include <string>
#include <sstream>
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <functional>
#include <map>
#include <climits>
#include <queue>
using namespace std;
#define ll long long
class Main {
public:
int doesAliceWins(int a, int b) {
int aa = a;
int bb = b;
i... | 227 |
Project_CodeNet | 2,019 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | 584 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==1&&B!=1) cout<<"Alice";
else if(B==1&&A!=1) cout<<"Bob";
else if(A<B) cout<<"Bob";
else if(A>B) cout<<"Alice";
else cout<<"Draw";
return 0;
}
| 82 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A>B && B!=1) cout << "Alice" << endl;
if (B>A && A!=1) cout << "Bob" << endl;
if (A==B) cout << "Draw" << endl;
else if (A==1) cout << "Alice" << endl;
else if (B==1) cout << "Bob" << endl;
} | 112 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define ll long long
#define UP(a,b,i) for(int i=(a);i<=(b);i++)
#define DOWN(a,b,i) for(int i=(a);i>=(b);i--)
#define rep(a,b,i) UP(a,b-1,i)
#define Enter() printf("\n");
using namespace std;
int ma=0x80000000;
int mi=0x7fffffff;
const ll zfc=0xffffffff;
const ll mod=1e9+7;
ll a,b;
int main()
{... | 174 |
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 > b) {
cout << "Alice" << endl;
} else if (a < b) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
} | 108 |
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)cout<<"Alice"<<endl;
else if(b==1)cout<<"Bob"<<endl;
else{
if(a>b)cout<<"Alice"<<endl;
else cout <<"Bob"<<endl;
}
return 0;
}
| 92 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
typedef long long ll;
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 (m... | 141 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;
#define maxn 10010
#define llg long long
#define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
llg n,m,a[maxn];
int main()
{
//yyj("A");
for (llg i=2;i<=13... | 156 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 307 |
Project_CodeNet | 2,017 | #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>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()
{
int a , b;
cin >> a >> b;
if (1 <= a && a <= 13 && 1 <= b && b <= 13)
{
if (a == 1 || b == 1 || a == b)
{
if (a == b)
cout << "Draw";
else if (a == 1)
cout << "Alice";
... | 155 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <string.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a == b)printf("Draw\n");
else
{
if(a == 1)a = 14;
if(b == 1)b = 14;
if(a > b)printf("Alice\n");
else printf("Bob\n");
}
return 0;
} | 89 |
Project_CodeNet | 2,017 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "map"
using namespace std;
const long long int MOD = 1000000007;
int N,M;
char letter[2][100][100];
int ans;
int main() {
... | 149 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1)
A = 14;
if (B == 1)
B = 14;
if (A == B)
cout << "Draw" << endl;
else if (A > B)
cout << "Alice" << endl;
else if (A < B)
cout << "Bob" << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,019 | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<utility>
#include<tuple>
#include<algorithm>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
int main(){
in... | 160 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
const ll LINF=0x1fffffffffffffff;
const int INF=0x3fffffff;
const int MOD=1000000007;
#define VAR(type,...) type __VA_A... | 322 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath> //abs();
using namespace std;
int main(void)
{
long long int a,b,c,d,i,j,k,n,x[10];
string s;
char C[5];
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout << "Alice";
if(a<b) cout << "Bob";
if... | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
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";
} | 105 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
int A,B;
std::cin >> A >> B;
if(A==1 || B==1){
if(B==A)printf("Draw");
else if(A==1)printf("Alice");
else printf("Bob");
return 0;
}
if(A<B)printf("Bob");
else if(A>B)printf("Alice");
els... | 112 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int... | 257 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.