Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | 798 |
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 != b && a==1)cout <<"Alice"<<endl;
else if(a != b && b==1)cout<< "Bob"<<endl;
else if(a != 1 && b!=1 && a >b)cout <<"Alice"<<endl;
else if(a != 1 && b!=1 && a < b)cout <<"Bob"<<endl;
} | 119 |
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;
else cout << (a > b ? "Alice" : "Bob") << endl;
}
| 92 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int strong(int x) {
if (x==1) return 100;
return x;
}
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int a,b; cin>>a>>b;
int x=strong(a),y=strong(b);
if (x==y) cout<<"Draw";
else if (x>y) cout<<"Alice";
else cout<<"Bob";
return 0;
}
| 104 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int64_t A, B;
cin >> A >> B;
if(A == 1)
A = 14;
if(B == 1)
B = 14;
if(A == B)
cout << "Draw" << endl;
else if(A > B)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
}
| 106 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using ll=long long;
using namespace std;
int main(){
int a,b;
cin>>a>... | 166 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#define rep(i,n) for(int i=0;i<(n);i++)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define psortfirst(A,N) sort(... | 285 |
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==1)cout<<"Alice";
else if(b==1)cout<<"Bob";
else if(a>b)cout<<"Alice";
else cout<<"Bob";} | 72 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define ... | 365 |
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 if(A<B){
cout<<"Bob"<<endl;
}
}
| 100 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <ios>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
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\n";
}... | 127 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
const int MOD = 1e9 + 7;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL... | 267 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
int arr[14] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
while(cin >> a >> b) {
if(arr[a] > arr[b])
cout << "Alice" << endl;
else if(arr[a] < arr[b])
cout << "Bob" << endl;
else
cout << "Draw" << endl;
}
return 0;
} | 132 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <fstream>
#include <map>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <set>
#include <queue>
#include <list>
using namespace std;
int main()
{
int n,m;
cin>>... | 135 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
vector<int> v={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
cout<<(v[a]>v[b]?"Alice":v[a]<v[b]?"Bob":"Draw")<<endl;
return 0;
} | 91 |
Project_CodeNet | 2,017 | #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 << "Draw" << endl;
else if(a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 83 |
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;
} | 115 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b;
cin >> a >> b;
if (a... | 167 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include... | 185 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (a <= 13 && a >= 1 && b <= 13 && a >= 1) {
if (a == 1 && a != b)
cout << "Alice";
else if (b == 1 && b != a)
cout << "Bob";
else if (a == b)
cout << "Draw";
else if (a > b && b != 1 && a != 1)
cout << "Alice";
else ... | 150 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
inline void write(int x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
wri... | 216 |
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<b && a!=1) || b==1){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
return 0;
}
| 88 |
Project_CodeNet | 2,019 | #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 << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 97 |
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) || (B == 1)) {
if (A == 1) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
}
else if (A < B) {
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) a=100;
if (b==1) b=100;
if (a>b) cout << "Alice" <<endl;
else if (a==b) cout <<"Draw"<<endl;
else cout << "Bob" <<endl;
} | 87 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin >> a >> b;
if (a==1 || b==1){
if (a==b){
cout << "Draw";
}
else if (a<b) cout << "Alice";
else cout << "Bob";
}
else {
if (a==b){
cout << "Draw";
}
else i... | 112 |
Project_CodeNet | 2,018 | #include <iostream>
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(B==1) cout << "Bob" << endl;
else cout << "Alice" << endl;
}... | 105 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int a,b;
scanf(" %d %d",&a,&b);
if(a<b){
if(a==1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}else if(a>b){
if(b==1){
cout << "Bob" << endl;
}else{
cout << "Alic... | 127 |
Project_CodeNet | 2,017 | // header {{{
#include <bits/stdc++.h>
using namespace std;
// {U}{INT,LONG,LLONG}_{MAX,MIN}
#define ALPHABET (26)
#define INF INT_MAX
#define MOD (1000000007LL)
using LL = long long;
// }}}
int main() {
std::ios::sync_with_stdio(false);
int a, b;cin >> a >> b;
if(a == 1) a = 14;
... | 166 |
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 << "Draw" << endl;
else
cout << "Bob" << endl;
} | 98 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw" << '\n';
} else {
if (a == 1) {
cout << "Alice" << '\n';
} else if (b == 1) {
cout << "Bob" << '\n';
} else {
if (a > b) {
cout << "Alice" << '\n';
} els... | 135 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define rrep(i, n, m) for (int i = n; i >= m; i--)
#define p(s) cout << s << endl;
typedef long long LL;
template <class T>
bool contain(const std::string &s, const... | 202 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vs... | 211 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
string winner;
if (((a+11) % 13) > ((b+11) % 13)) winner = "Alice";
else if (((a+11) % 13) < ((b+11) % 13)) winner = "Bob";
else winner = "Draw";
cout << winner << endl;
} | 101 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
}
else if (A > B && B != 1 || A == 1) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
} | 87 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A==B){
cout << "Draw"<<endl;
return 0;
}
if(A... | 157 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b){cout<< "Draw" ;}
else if(a==1){cout<< "Alice";}
else if(b==1){cout<< "Bob" ;}
else if(a>b){cout<< "Alice" ;}
else if(b>a){cout<< "Bob";}
return 0;
}
| 94 |
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 || (a > b && b != 1) ){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
return 0;
} | 86 |
Project_CodeNet | 2,017 | #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;
} ... | 116 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a == b) {
cout << "Draw";
}
if (a > b) {
cout << "Alice";
} else ... | 126 |
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==1)cout<<"Alice"<<endl;
else if(B==1)cout<<"Bob"<<endl;
else if(A>B)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 90 |
Project_CodeNet | 2,019 | #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 ALL(a) (a).begin(),(a).end()
#define SUM(a) accumulate((a).begin(),(a).end(),0)
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define dump(x) cerr << #x << " = " << (x) << endl... | 315 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 1000000007
#define INF 1<<30
#define LINF (ll)1<<62
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,... | 249 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define replrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) replrev(i,0,n)
#define repi(itr,ds) for(auto itr = ds.begin(); itr != ds.end(); ++itr)
#define mp make_pair
... | 242 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<math.h>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<map>
#define INF 999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int a, b;
int p[15] = { 0,13,... | 174 |
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";
}
| 64 |
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;
}
} | 112 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){
A=14;
}
if(B==1){
B=14;
}
if(A<B){
cout<<"Bob"<<endl;
}else if(A>B){
cout<<"Alice"<<endl;
}else{
cout<<"Draw"<<endl;
}
return 0;
} | 96 |
Project_CodeNet | 2,019 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <numeric>
typedef long long Int;
#define rep(i,a,b) for(Int i=a;i<b;++i)
#define rrep(i,a,b) for(Int i=a;i>=b;--i)
using namespace std;
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
int A, B; cin >> A >> B;
vector<int> str... | 192 |
Project_CodeNet | 2,018 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<bitset>
#include<iostream>
#include<algorithm>
#include<string>
#include<utility>
#include<tuple>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<numeric>
#include<functional>
#include<iomanip>
#include<rand... | 586 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#i... | 1,148 |
Project_CodeNet | 2,020 | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 428 |
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;
} | 99 |
Project_CodeNet | 2,019 | #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\n";
else if(a < b)cout << "Bob\n";
else cout << "Draw\n";
return 0;
} | 84 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if (a==1)
a=14;
if (b==1)
b=14;
if (a>b)
cout <<"Alice"<<endl;
if (a==b)
cout <<"Draw"<<endl;
if (a<b)
cout <<"Bob"<<endl;
system("pause");
return 0;
} | 89 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >>a >>b;
vector<int> W={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
if(W.at(a)>W.at(b)){
cout <<"Alice" <<endl;
}
else if(W.at(a)==W.at(b)){
cout <<"Draw" <<endl;
}
else{
cout <<"Bob" <<endl;
}
} | 116 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int A,B;
cin >> A >> B ;
string result;
if (A==1) {
A = 100;
}
if (B == 1) {
B = 100;
}
if (A - B == 0) {
result = "Draw";
}
else {
if (A > B) {
result = "Alice";
}
else {
result = "Bob";
}
}
... | 125 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if(A>B && B!=1 || A==1 && 1<B){
cout << "Alice" << endl;
}
else if(B>A && A!=1 || B==1 &&1<A){
cout << "Bob" << endl;
}
else if(A==B){
cout << "Draw" << endl;
}
}
| 103 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
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) {
std::cout << "Alice" << '\n';
} else if (a < b) {
std::cout << "Bob" << '\n';
} else {
std::cout << "Draw" << '\n... | 127 |
Project_CodeNet | 2,017 | #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 <cstdio>
#include <cmath>
#include <cstdlib>
#includ... | 556 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw\n";
} else if(a == 1){
cout << "Alice\n";
} else if(b == 1){
cout << "Bob\n";
} else {
if(a > b){
cout << "Alice\n";
} else {
c... | 107 |
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 += 13;
}
if(b == 1){
b += 13;
}
if(a > b){
printf("Alice");
}
else if(a < b){
printf("Bob");
}
else{
printf("Draw");
}
} | 89 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B ;
if(A == B == 1){
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;
}
e... | 134 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se... | 293 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int Alice, Bob;
cin >> Alice >> Bob;
if (Alice == Bob ) cout << "Draw" << endl;
else if (Alice == 1) cout << "Alice" << endl;
else if (Bob == 1) cout << "Bob" << endl;
else if (Alice != 1 && Bob != 1) {
cout << (Alice > Bob ? "... | 119 |
Project_CodeNet | 2,018 | // 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;
if (A < B)
cout << "Bob" << endl;
else if (A == B)
cout << "Draw" << endl;
else
cout << "Alice" << endl;
return 0;
} | 100 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>... | 695 |
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;
}
| 89 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int main() {
int a = 0;
int b = 0;
scanf("%d", &a);
scanf("%d", &b);
if (a == 1 && b != 1) { printf("Alice"); return 0; }
if (a != 1 && b == 1) { printf("Bob"); return 0; }
if (a == 1 && b == 1) { printf("Draw"); return 0; }
if (a > b) { printf("Alice"); re... | 161 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<map>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<deque>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec,n,m,l) vector<vector<int>>... | 249 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int x,y;
cin>>x>>y;
if(x==1) x=14;
if(y==1) y=14;
if(x>y) puts("Alice");
else if(x<y) puts("Bob");
else puts("Draw");
return 0;
} | 67 |
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";
else if (a == 1) cout << "Alice";
else if (b == 1) cout << "Bob";
else if (a == b) cout << "Draw";
else if (a > b) cout << "Alice";
else cout << "Bob";
return 0;
} | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A,B;
cin>>A>>B;
if(A==B) cout<<"Draw"<<endl;
else if((A>B&&B!=1)||A==1) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 80 |
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 && B != 1) cout << "Alice" << endl;
else if (A != 1 && B == 1) cout << "Bob" << endl;
else if(A > B) cout << "Alice" << endl;
else if(B > A) cout << "Bob" << ... | 117 |
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 (B < A) {
cout << "Alice" << endl;
} else if (A < B) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
return 0;
}
| 107 |
Project_CodeNet | 2,019 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 993 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B;
cin >> A >> B;
if(A == 1){ A = 14;
}
if(B == 1){ B = 14;
}
if(A > B){
cout << "Alice" << endl;
}
if(B > A){
cout << "Bob" << endl;
}
else if(A==B){
cout << "Draw" << endl;
... | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
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 <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
int main() {
ios_base::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a > b && b != 1 || a == 1 && b != 1) {
cout << "Alice" << endl;
} else if (b > a && a != 1 || b == 1 && a != 1) {
... | 138 |
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(b<a) cout << "Alice" << endl;
else cout << "Draw" << endl;
} | 81 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
(A += 11) %= 13;
(B += 11) %= 13;
if(A == B) cout << "Draw" << endl;
else if(A > B) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 90 |
Project_CodeNet | 2,019 | #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;
string ans = "Alice";
if(a == b) ans = "Draw";
else if(b == 1 || a > 1 && b > a) ans = "Bob";
cout << ans << endl;
return 0;
} | 102 |
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" << endl;
else if(a == b)
cout << "Draw" << endl;
else
cout << "Bob" << endl;
}
| 94 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
// 最小公倍数を求める
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll co... | 342 |
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" << ... | 118 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define... | 563 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)
typedef long long ll;
typedef vector<int... | 245 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
using namespace std;
int main() {
int a, b;
cin >> a >> b;
map<int, int> mp;
for (int i = 2; i <= 13; ++i) mp[i] = i;
mp[1] = 14;
puts(mp[a] > mp[b] ? "Alice" : mp[a] < mp[b] ? "Bob" : "Draw");
return 0;
} | 113 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a=(a+11)%13;
b=(b+11)%13;
if(a>b){
cout << "Alice" << endl;
}else if(a<b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
} | 89 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 335 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int a,b;
cin >> a>> b;
if(a == 1 || b== 1){
if(a==1 && b!=1) cout<<"Alice"<<endl;
else if(a!=1 && b==1) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return 0;
}
if(a>b) cout<<"Alice"<<end... | 128 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
ll a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else if(a == 1 || (b != 1 && b < a)){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
return 0;
}
| 93 |
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 = 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;
}
| 96 |
Project_CodeNet | 2,019 | #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" << endl;
... | 111 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
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 cout<<"Bob"<<endl;
return 0;
} | 108 |
Project_CodeNet | 2,018 | /*input
happy,newyear,enjoy
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#d... | 560 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1&&B==1){cout<<"Draw"<<"\n"; return 0;}
if(A==1&&B!=1){cout<<"Alice"<<"\n"; return 0;}
if(A!=1&&B==1){cout<<"Bob"<<"\n"; return 0;}
if(A>B){
cout<<"Alice"<<"\n";
}else if(A==B){
cout<<"Draw"<<... | 137 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
int main(){
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
int a,b;
cin ... | 168 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i < n; i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define P pair<int, int>
typedef long long ll;
const ll mod = 1e9+7;
template<class T> inline bool chmin(T& a, T b... | 930 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.