Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A!=1 &&B!=1 &&A<B){
cout << "Bob" << endl;
}
else if(A!=1 && B!=1 && A>B){
cout << "Alice" << endl;
}
else if(A!=1 && B==1){
cout << "Bob" << endl;
}
else if (A==1&&B!=1){
cout << "Alice" << endl;... | 137 |
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;
}
} | 110 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=1;i<=n;++i)
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if (a==b) cout << "Draw" << endl;
else if (a==1) cout << "Alice" << endl;
else if(b==1) cout << "Bob" << endl;
else cout << ((a>... | 126 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int card[]= {1,2,3,4,5,6,7,8,9,10,11,12,13};
if(A==1){
A=14;
}
if(B==1){
B=14;
}
//cout<<"A"<<A;
//cout<<"B"<<B;
if(A>B){
cout<<"Alice"<<endl;
}
else if(A<B){
cout<<"Bob"<<endl;
}
else i... | 139 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | 1,605 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A > B) cout << "Alice" << endl;
if (A < B) cout << "Bob" << endl;
if (A == B) cout << "Draw" << endl;
}
| 101 |
Project_CodeNet | 2,020 | #include <iostream>
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;
}
} else {... | 153 |
Project_CodeNet | 2,020 | #include <queue>
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <iomanip>
#include <cstdio>
#define rep(i, n) for(long long i = 0;(i) < (n);(i)++)
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
ll a, b;
cin >> ... | 178 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdint>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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... | 129 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 313 |
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;
}
| 107 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i... | 353 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(... | 212 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <numeric>
using namespace std;
int abs(int num){
if (num > 0)
return num;
else
return -num;
}
int main(){
int A,B;
cin >> A >> B;
if(A == 1){
A = A + 13;
}
if(B == 1){
B = B... | 159 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using ll = long long;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if (a == 1) cout << "Alice" << ... | 139 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i) = 0; (i) < (n); (i)++)
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw\n";
return 0;
}
vector<int> table = {2,3,4,5,6,7,8,9,10,11,12,13,1};
int i = 0, j = 0;
while(... | 161 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a;
cin >> b;
if (a == b)
{
cout << "Draw\n";
}
if (a == 13)
{
if (b == 1)
{
cout << "Bob\n";
}
else
{
cout << "Alice\n";
}
}
else if (b ==13)
{
if (a ==1)
{
cout << "Alice\n";
}
else
{
cout << "Bob\n"... | 188 |
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(b<a)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
} | 77 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
int a, b;
int main(int argc, char const *argv[]) {
ios_base::sync_with_st... | 174 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int card1, card2;
cin >> card1 >> card2;
if(card1 < card2)
{
if (card1 == 1 && card2 != 1)
{
cout << "Alice" << endl;
}
else
cout << "Bob"<< endl;
}
else if(card1 == card2)
{
cout << "Draw" << endl;
}
else if (card1... | 143 |
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 << "Draw" << endl;
}
else if (A>B){
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
} | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
if(x == y) cout << "Draw" << endl;
else if(x>y && y != 1) cout << "Alice" << endl;
else if(x>y && y == 1) cout << "Bob" << endl;
else if(y>x && x != 1) cout << "Bob" << endl;
else if(y>x && x == 1) cout << "... | 123 |
Project_CodeNet | 2,020 | #include <iostream>
// #include <vector>
// #include <map>
// #include <string>
// #include <algorithm>
// #include <set>
// #include <cmath>
using namespace std;
// typedef unsigned long long ull;
int main(int argc, char const *argv[]) {
int A, B;
cin >> A >> B;
if (B != 1 && (A == 1 || A > B)) {
... | 154 |
Project_CodeNet | 2,019 | #include <iostream>
#include<vector>
#include<algorithm>
#include <queue>
#include <string>
#include <set>
#include <bitset>
using namespace std;
#define ff(i,n,m) for(int i=n;i<m;i++)
#define i64 int64_t
#define tos(x) to_string(x)
int main() {
int a, b;
cin >> a >> b;
vector<int> data = { 2,3,4,5,6,7,8,9,10,11,1... | 216 |
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 == 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 << "Alic... | 124 |
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{... | 109 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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; }
const long long INF = 1LL << 60;
typ... | 526 |
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 == 1) {
cout << "Alice" << endl;
}
else if (b == 1) {
cout << "Bob" << endl;
}
else if (a < b) {
cout << "Bob" << endl;
}
else if (a > b) {
cout << "Alice" << endl;
}... | 124 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a>b)cout<<"Alice"<<endl;
else if(a<b)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
} | 72 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == B){
cout << "Draw" << endl;
}if(A > B and B != 1){
cout << "Alice" << endl;
}if(B > A and A != 1){
cout << "Bob" << endl;
}if(A == 1 and B != 1){
cout << "Alice" << endl;
}if(B == 1 and A != 1){
cout ... | 129 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<string>
#include<functional>
#include<utility>
#include<stack>
#include<queue>
#include<cmath>
#include<list>
#include<cstdint>
#include<vector>
#include<map>
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i,rept) for(ll i = 0; i<rept;i++)
typedef ... | 345 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
typedef long long ll;
using namespace std;
int main() {
int t[13]... | 212 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
ty... | 337 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
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;
}
| 98 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i = s;i<n;i++)
int main() {
int A, B; cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
cout << ((A > B) ? "Alice" : ((A == B) ? "Draw" : "Bob")) << endl;
return 0;
} | 102 |
Project_CodeNet | 2,018 | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "u... | 637 |
Project_CodeNet | 2,020 | // #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree... | 324 |
Project_CodeNet | 2,018 | #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;
}
} | 112 |
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;
using P = pair<int,int>;
const int MOD = 1000000007;
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;
... | 130 |
Project_CodeNet | 2,018 | #include <stdio.h>
int main(void)
{
int a,b,c,A,B,C,i;
scanf("%d%d",&a,&b);
c=a;
for(i=1; i<=2; i++){
switch(c){
case 2:
C=1;
break;
case 3:
C=2;
break;
case 4:
C=3;
break;
case 5:
C=4;
break;
case 6:
C=5;
break;
case 7:
C=6;
break;
case 8:
... | 293 |
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;
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 << "B... | 134 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B;
scanf("%d %d",&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;
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;
}
} | 110 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A == 1 && B ==1) cout << "Draw" << endl;
else if (A == 1) cout << "Alice" << endl;
else if (B == 1) cout << "Bob" << endl;
else if (A - B > 0) cout << "Alice" << endl;
else if (A - B == 0) cout << "Draw" << endl;
el... | 131 |
Project_CodeNet | 2,020 | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 232 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int a,b;
int main(void){
scanf("%d%d",&a,&b);
if(a==1)a+=13;
if(b==1)b+=13;
if(a==b)puts("Draw");
else printf("%s\n",a>b?"Alice":"Bob");
return 0;
} | 92 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a == b){
cout<<"Draw"<<endl;
return 0;
}
if(a == 1){
cout<<"Alice"<<endl;
return 0;
}else if(b == 1){
cout<<"Bob"<<endl;
return 0;
}
if(a>b){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
} | 111 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){
A+=13;
}
if(B==1){
B+=13;
}
if(A>B){
cout<<"Alice"<<endl;
}
else if (A<B){
cout<<"Bob"<<endl;
}
else if (A==B){
cout<<"Draw"<<endl;
}
}
| 99 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a = 13 + 1;
if(b == 1) b = 13 + 1;
if(a>b) cout << "Alice" << endl;
else if(a<b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 95 |
Project_CodeNet | 2,020 | #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) {
if (a == 1) {
cout << "Draw" << endl;
... | 173 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstring>
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";
else cout<<(a>b?"Alice":"Bob");
} | 71 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <cstdlib>
#include <cmath>
#include <functional>
#define INF 1000000000000000000
using namespace std;
typedef long long ll;
int main(){
int a, b;
cin >> a >> b;
if (a == 1)a += 13;
if (b == 1)b += 13;
if (a ... | 131 |
Project_CodeNet | 2,017 | #include <stdio.h>
void bobalicecard(int a, int b) {
if (a == 1)
{
a += 13;
}
if (b == 1)
{
b += 13;
}
if (a > b) {
printf("Alice\n");
}
if (a < b) {
printf("Bob\n");
}
if (a == b) {
printf("Draw\n");
}
}
int main()
{
char str[30];
int hantei;
int hantei2;
fgets(str, sizeof(str), stdin);
ss... | 163 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1 && b != 1){
cout << "Alice";
}else if(a != 1 && b == 1){
cout << "Bob";
}else if(a < b){
cout << "Bob";
}else if(a > b){
cout << "Alice";
}else{
cout << "Draw";
}
cout << endl;
... | 110 |
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;
}
... | 108 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <unordered_map>
typedef long long ll;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << ... | 310 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <numeric>
#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 i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int a, b; cin >> a >> b;... | 209 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
a=(a+11)%13;
b=(b+11)%13;
if(a>b)
cout<<"Alice";
else if(a<b)
cout<<"Bob";
else
cout<<"Draw";
return 0;
}
| 77 |
Project_CodeNet | 2,020 | #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 << "B... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int A, B;
cin >> A >>... | 212 |
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<<"Alice"<<endl;
if(a<b) cout<<"Bob"<<endl;
if(a==b) cout<<"Draw"<<endl;
return 0;
}
| 77 |
Project_CodeNet | 2,020 | /*
* @Author: _dp95
* @Date: 2020-04-14 13:00:55
*/
#include "bits/stdc++.h"
using namespace std ;
#define timesaver ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll ;
typedef long double ldb ;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define nl '\n'
#def... | 390 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define MAX 100000
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char,char>
#define pii pair<ll,int>
#define pll pair<ll,ll>
#define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it+... | 1,282 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw";
else
{
if (a == 1)
cout << "Alice";
else
{
if (b == 1)
cout << "Bob";
els... | 125 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>... | 329 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int llint;
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 << "Bob" << endl;
}
if (a == b) {
cout << "Draw" ... | 126 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#inclu... | 314 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#def... | 224 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b ; cin >> a >> b ;
a == 1 ? a = 14 : a = a ;
b == 1 ? b = 14 : b = b ;
if ( a > b ) cout << "Alice";
else if ( b > a ) cout << "Bob";
else cout << "Draw" ;
} | 89 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define debug(var) std::cout << #var << " : " << var << std::endl;
using ll = long long;
using ull = unsigned long long;
ll mod = 1e9 + 7;
using Graph = std::vector<std::vector<int>>;
int main(){
int A, B; std::cin >> A >> B;
if(A == 1)... | 168 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
using ll = long long;
const ll mod = 1000000007;
const ll INF = 100000000000000000LL;
int c(int x){
if(x==1) x+=13;
return x;
}
signed main(){
int a,b;
... | 170 |
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;
} | 84 |
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 && B!=1) || A==1)
cout<<"Alice"<<endl;
else
cout<<"Bob"<<endl;
} | 73 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int char1,char2;
cin>>char1>>char2;
int strength[]={2,3,4,5,6,7,8,9,10,11,12,13,1};
int alice=0;
int bob=0;
for(int i=0 ; i<13 ; ++i)
{
if(char1==strength[i])
alice=i;
if(cha... | 166 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 << "Alice" << "\n";
else if (a < b) cout << "Bob" << "\n";
else cout << "Draw" << "\n";
}
| 121 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <math.h>
#include <deque>
using ll = long long;
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;
if(a... | 125 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void){
int a,b,c;
scanf("%d %d",&a,&b);
if(a==1&&b==1){
printf("Draw\n");
}else if(a==1){
printf("Alice\n");
}else if(b==1){
printf("Bob\n");
}else if(a>b){
printf("Alice\n");
}else if(a<b){
printf("Bob\n");
}else{
printf("Draw\n");
}
return 0;
}
| 105 |
Project_CodeNet | 2,017 | #include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <ctime>
#include <map>
#include <stack>
#include <sstream>
#include <set>
#include <cmath>
#include <functional>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
if (a == b)
{
cout << "Draw" << ... | 180 |
Project_CodeNet | 2,017 | #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";
else
if( a < b )
cout << "Bob";
else
cout << "Draw";
return 0;... | 106 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a,b = 0;
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){
... | 159 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d",&a);
scanf("%d",&b);
if(a==1){
a=13+a;
}
if(b==1){
b=13+b;
}
if(a>b){
printf("Alice\n");
}
if(a<b){
printf("Bob\n");
}
if(a==b){
printf("Draw\n");
}
return 0;
} | 93 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int scores[] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
string winner[] = {"Alice", "Draw", "Bob"};
int a, b;
cin >> a >> b;
int as = scores[a], bs = scores[b];
if (as < bs) {
cout << wi... | 172 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
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;
}... | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
f... | 513 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(int i = 0;i < (n);i++)
#define rep(i,m,n) for(int i = (m);i < (n);i++)
#define P pair<int,int>
#define pb push_back
#define mk make_pair
using namespace std;
#define Vec(a) vector <int> a
const int INF = 1 << 20;
const int MOD = 1e9+7;
int main(){
... | 192 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a, b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a > b){
cout << "Alice" << endl;
}else if(a == b){
cout << "Draw" << endl;
}else{
cout <... | 130 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,n) for(int i=1;i<=(int)(n);i++)
#define rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#defi... | 349 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,... | 244 |
Project_CodeNet | 2,018 | ///*
#include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a != 1 && b != 1) {
if (a > b) {
cout << "Alice";
}
else if (a == b) {
cout << "Draw";
}
else {
cout << "Bob";
}
}
else if (a == 1 && b != 1) {
cout << "Alice";
}
else if (a != 1 && b == 1) {
cout ... | 144 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int Alice, Bob;
cin >> Alice >> Bob;
if (Alice == 1) Alice = 14;
if (Bob == 1) Bob = 14;
if (Alice == Bob) cout << "Draw" << endl;
else if (Alice > Bob) cout << "Alice" << endl;
else cout << "Bob" << endl;
//while (1);
return 0;
}
| 95 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define REREP(i,n) for(int i=int(n-1); i>=0; i--)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define REFOR(i,m,n) for(int i=int(n-1); i>=i... | 915 |
Project_CodeNet | 2,019 | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<numeric>
#include<cctype>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == ... | 140 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <functional>
#include <numeric>
#include <stack>
#include <string>
#include <map>
#include <set>
using namespace std;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
te... | 4,161 |
Project_CodeNet | 2,019 | /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
long long n;
int a , b;
map < int , int > cnt;
int main(){
cin >> a >> b;
cnt[2] = 1;
cnt[3] = 2;
cnt[4] = 3;
cnt[5] = 4;
cnt[6] = 5;
cnt[7] = 6;
cnt[8] = 7;
cnt[9] = 8;
cnt[10] = ... | 218 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1){
a = 14;
}
if(b == 1){
b = 14;
}
if(a == b){
cout << "Draw" << endl;
}else if(a < b){
cout << "Bob" << endl;
}else{
cout << "Alice" << endl;
}
return 0;
} | 101 |
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;
}
if(a>=2&&b>=2) {
if(a>b) {
cout<<"Alice"<<endl;
}
if(a<b) {
cout<<"Bob"<<endl;
}
}
if(a==1&&b!=1) {
cout<<"Alice"<<endl;
}
if(b==1&&a!=1) {
cout<<"Bo... | 127 |
Project_CodeNet | 2,017 | #include <cstdio>
#define ll long long
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a == 1)
a = 14;
if (b == 1)
b = 14;
if (a > b) printf("Alice");
else if (a == b) printf("Draw");
else printf("Bob");
return 0;
}
| 94 |
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 == 1){
cout << "Alice" << endl;
}
else if (b == 1){
cout << "Bob" << endl;
}
else if (a > b){
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
... | 114 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define fora(i,a,b) for(int i=a,Wub=b;i<Wub;++i)
#define ford(i,a,b) for(int i=a,Wub=b;i>=Wub;--i)
#define SPEEDIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 1000000
#define MOD 1073741824
using namespace std;
typedef long long ll;
int main(){
int a,b;
cin>>a>>b;
if... | 158 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int board[] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
int x, y;
cin >> x >> y;
if (board[x] < board[y])
{
cout << "Bob" << endl;
}
else if (board[y] < board[x])
{
cout << "Alice" << endl;
}
else
{
... | 141 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.