Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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<<"Alice";
else
if(a==b)cout<<"Draw";
else
cout<<"Bob";
return 0;
} | 74 |
Project_CodeNet | 2,018 | #include <iostream>
#include <float.h>
#include <cfloat>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <errno.h>
#include <cerrno>
#include <assert.h>
#include <cassert>
#include <map>
#include <memory.h>
#include <cctype>
#include <ctype.h>
#include <math.h>
#include <vector>
#include <cstdio>
... | 299 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int a,b;
cin >> a >> b;
if(a==1 && b==13)cout << "Alice" << endl;
else if(a==13 && b==1)cout << "Bob" << en... | 157 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;cin >> a >> b;
if(a>b && b!=1){
cout << "Alice" << endl;
}else if(a<b && a!=1){
cout << "Bob" << endl;
}else if(a==1 && b!=1){
cout << "Alice" << endl;
}else if(b==1 && a!=1){
cout << "Bob" << endl;
}else{
cout << "Draw" ... | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B;
scanf("%d%d", &A, &B);
if(A == B){
printf("Draw\n");
}
else if(A == 1){
printf("Alice\n");
}
else if(B == 1){
printf("Bob\n");
}
else if(A > B){
printf("Alice\n");
}
else{
printf("Bob\n");
}
return 0;
} | 102 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
string ans;
if (A > B)
ans = "Alice";
else if (B > A)
ans = "Bob";
else
ans = "Draw";
cout << ans << endl;
}
| 94 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> p;
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" <... | 138 |
Project_CodeNet | 2,019 | #include <math.h>
#include <stdio.h>
#include <algorithm>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1)
co... | 137 |
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&&b>1)cout<<"Alice"<<endl;
else if(b==1&&a>1)cout<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
| 91 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF (1 << 30)
int main(){
int a,b;
cin >> a >> b;
if(a == 1)a = INF;
if(b == 1)b = INF;
if(a > b){
cout << "Alice" << endl;
}else if(b > a){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
... | 121 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <cmath>
#define FOR(i, f, n) for(int (i) = (f); (i) < (n); (i)++)
#define RFOR(i, f, n) for(int (i) = (f); (i) >= (n); (i)--)
#def... | 419 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <set>
using namespace std;
int main()
{
int32_t A, B;
cin >> A >> B;
if (A == 1)
A = 14;
if (B == 1)
B = 14;
string res;
if (A > B)
res = "Alice";
... | 130 |
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;
return 0;
} | 84 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void){
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;
}
}
| 76 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int a;
int b;
cin>>a;
cin>>b;
if (a==b){cout<<"Draw";}
else if (a==1){cout<<"Alice";}
else if (b==1){cout<<"Bob";}
else if (a>b){cout<<"Alice";}
else(cout<<"Bob");
return 0;
}
| 87 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
int main(){
int a, b;
cin >> a >> b;
string win;
if(a == 1){
if(b ... | 167 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
//ll tree[4 * nax];
//9uS-22RSwk7gQqh
int count(ll x){
int cnt = 0;
while(x !... | 217 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(void){
int a,b;
cin>>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<<"Alice"<<endl;
}
}else{
cout<<"Draw"<<endl;
}
return ... | 106 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
int A,B;
void solve(){
if(A > B) cout << "Alice" << endl;
else if(A < B) cout << "Bob" << ... | 145 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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 if (b > a) cout << "Bob" << "\n";
} | 114 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | 260 |
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 (b>a) cout << "Bob" << endl;
return 0;
} | 110 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define LL long long
int main(){
int A, B;
cin >> A >> B;
... | 168 |
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;
... | 122 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if( A == 1 || B == 1 ){
if( A == B ) cout << "Draw" << endl;
else if( A == 1 ) cout << "Alice" << endl;
else if( B == 1 ) cout << "Bob" << endl;
} else {
if( A == B ) cout << "Draw" << e... | 147 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int A, B;
string ans;
cin >> A >> B;
if (A == 1)
A = 14;
if (B == 1)
B = 14;
if (A == B)
ans = "Draw";
else if (A > B)
ans = "Alice";
else
ans = "Bob";
cout << ans << '\n';
return 0;
}
| 102 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a>b) cout<<"Alice"<<endl;
else if(a<b) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
| 76 |
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;}
// cout<< <<endl;
}
| 91 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main ()
{
int a,b;
cin>>a>>b;
if(b==1)
b=14;
if(a==1)
a=14;
if(a>b)
cout<<"Alice";
else if(a==b)
cout<<"Draw";
else
cout<<"Bob";
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a, b;
cin >> a >> b;
//if(x=='a'||x=='i'||x=='u'||x=='e'||x=='o')){cout << "vowel" << endl;}
//else{cout << "consonant" << endl;}
//int x = a*b;
//int y = c*d;
if(a<b){
if(a==1){cout <<... | 205 |
Project_CodeNet | 2,020 | // Copyright 2020 yaito3014
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if (A == 1)A = 14;
if (B == 1)B = 14;
cout << (A == B ? "Draw" : A > B ? "Alice" : "Bob") << endl;
}
| 104 |
Project_CodeNet | 2,019 | #include <cstdio>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if(a == 1 && b != 1) printf("Alice\n");
else if(b == 1 && a != 1) printf("Bob\n");
else if(a > b) printf("Alice\n");
else if(a < b) printf("Bob\n");
else if(a == b) printf("Draw\n");
return 0;
}
| 105 |
Project_CodeNet | 2,017 | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#i... | 244 |
Project_CodeNet | 2,018 | #include <iostream>
#include<string>
using namespace std;
int main(void){
int a,b;
string s;
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,019 | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
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;
}
... | 124 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<climits>
#include<set>
#include<map>
#define ll long long
using namespace std;
int main() {
ll a, b;
cin >> a >> b;
if (a == 1&&b==1) {
cout << "Draw" << endl;
}
else if (a == 1) {
cout << "Alice" << endl;
}
el... | 174 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b... | 187 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a,b;
cin >>a>>b;
if (a==1){
a=a+13;
}
if (b==1){
b=b+13;
}
if (a>b){
puts("Alice");
}else if(a<b) {
puts("Bob");
}else{
puts("Draw");
}
} | 94 |
Project_CodeNet | 2,017 | #include <stdlib.h>
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else{
if(a == 1 || (b != 1 && a > b)){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}
return 0;
}
| 93 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a--;
b--;
if(!a)a=13;
if(!b)b=13;
if(a>b){
cout<<"Alice"<<endl;
}else if(a==b){
cout<<"Draw"<<endl;
}else{
cout<<"Bob"<<endl;
}
}
| 88 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(b != 1 && (a > b || a == 1)){
cout << "Alice" << endl;
}else if(a == b){
cout << "Draw" << endl;
}else{
cout << "Bob" << endl;
}
}
| 86 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
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 <... | 122 |
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;
return 0;
} | 104 |
Project_CodeNet | 2,017 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(b != 1 && a > b)
cout << "Alice" << endl;
else if(a == 1 && b != 1)
cout << "Alice" << endl;
else if(a != 1 && b > a)
cout... | 148 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int alice,bob;
cin>>alice>>bob;
if(alice==bob) cout<<"Draw";
else if(alice==1||(alice>bob&&bob!=1)) cout<<"Alice";
else cout<<"Bob";
} | 60 |
Project_CodeNet | 2,020 | #include<iostream>
int main(){
int A, B;
std::cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A < B) std::cout << "Bob" << std::endl;
else if(A > B) std::cout << "Alice" << std::endl;
else std::cout << "Draw" << std::endl;
return 0;
}
| 102 |
Project_CodeNet | 2,020 | #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>b){
if(b==1)
ans="Bob";
else
ans="Alice";
}
else{
if(a==1)
ans="Alice";
else
ans="Bob";
}
co... | 101 |
Project_CodeNet | 2,019 | // RAM RAM
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ppb pop_back
#define vi vector<int>
#define mp make_pair
#define arrayin(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define N 55
const int MOD=1000000007;
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0)... | 259 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main(){
int A, B;
scanf("%d %d", &A, &B);
if (A==1 && B==1) printf("Draw");
else if (A==1) printf("Alice");
else if (B==1) printf("Bob");
else if (A>B) printf("Alice");
else if (B>A) printf("Bob");
else printf("Draw");
} | 88 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
signed 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;
retu... | 122 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
int main() {
int a, b;
cin >> a >>b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout<<"Alice" << endl;
else if(a==b) cout << "Draw" <<endl;
else if (a<b) cout << "Bob" << endl;
}
| 119 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <math.h>
#include <stdio.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(b>a){
cout << "Bob" << endl;
... | 114 |
Project_CodeNet | 2,017 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#... | 252 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
std::string winner(int alice, int bob) {
alice = (alice + 11) % 13;
bob = (bob + 11) % 13;
return (alice == bob) ? "Draw" : (alice > bob) ? "Alice" : "Bob";
}
int main() {
int a, b;
std::cin >> a >> b;
std::cout << winner(a, b) << std::endl;
return 0;
} | 104 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)n; i++)
const int MOD = 1000000007;
// long long a;
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"... | 125 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a == b) cout << "Draw" << endl;
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;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | 222 |
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;
} | 98 |
Project_CodeNet | 2,017 | #include <cstdint>
#include <iostream>
using namespace std;
int32_t main()
{
uint32_t 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 << "Bob";
} else {
cout << "Alice";
}
retu... | 115 |
Project_CodeNet | 2,019 | //
// main.cpp
// oct_26
//
// Created by 田中諒 on 2019/10/26.
// Copyright © 2019 田中諒. All rights reserved.
//
#include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1 or B == 1){
if(A==B){
cout << "Draw" << endl;
} else if (A == 1)... | 206 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, ll B) {
A = (A+11)%13;
B = (B+11)%13;
string ans = A > B ? "Alice" : A < B ? "Bob" : "D... | 159 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int a, b;
cin >> a >> b;
if (a == 1){
a += 13;
}
if (b == 1){
b += 13;
}
if (a > b){
cout << "Alice" << endl;
}else if (a < b){
cout << "Bob" << endl;
}... | 126 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a,b;
std::cin >> a >>b;
if(a==1&&b==1){
std::cout << "Draw" << '\n';
}else if(a==1){
std::cout << "Alice" << '\n';
}else if(b==1){
std::cout << "Bob" << '\n';
}else if(a<b){
std::cout << "Bob" << '\n';
}else if(a>b){
std::cout << "Alice" ... | 140 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if (a != 1 && (b == 1 || a < b)) cout << "Bob" << endl;
else cout << "Alice" << endl;
return 0;
} | 77 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) cout << "Draw";
else if ((B < A && B!= 1) || A == 1) cout << "Alice";
else cout << "Bob";
return 0;
} | 77 |
Project_CodeNet | 2,019 | //#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
using namespace std;
using ll=long long;
void solve(){
int a,b;
cin >> a >> b;
if(a==b)
... | 155 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi= vector<int>;
using vvi= vector<vi>;
using vd= vector<double>;
using vvd= vector<vd>;
using vc= vector<char>;
using vb= vector<bool>;
using vl= vector<ll>;
#define rep(i,x,n) for(int i=x; i<n; i++)
#define all(x) x.begin(), x.end()
int main(){... | 166 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
class kin{
public:
inline void open(FILE *,int);
inline void close(void);
inline void scan(void);
inline kin &operator>>(char &);
inline kin &operator>>(int &);
inline kin &operator>>(long long &);
inline kin &operator>>(double &);
inline kin &operator>>(long double &);
inline kin &o... | 2,111 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
a = (a == 1 ? 100 : a);
b = (b == 1 ? 100 : b);
cout << (a > b ? "Alice" : (a < b ? "Bob" : "Draw"));
return 0;
}
| 84 |
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>B){
cout<<"Alice"<<endl;
}else{cout<<"Bob"<<endl;}
}else{
if(A==1){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
}
... | 108 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw";
return 0;
}
if (a == 1 && b != 1) {
cout << "Alice";
return 0;
}
if (a != 1 && b == 1) {
cout << "Bob";
return 0;
}
if (a > b) {
cout << "Alice";
} else {
cout << "Bob";
}
return 0;... | 125 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namesp... | 1,030 |
Project_CodeNet | 2,017 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#... | 264 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const ll mod = 1e9+7;
const int N=2e5+9;
int main()
{
FASTINOUT;
int x,y;
cin>>x>>y;
if (x<y&&x!=1)
cout<<"Bob\n";
else if (x>y&&y!=1)
c... | 154 |
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 << "Bob" << endl;
}
else if (a > b) {
cout << "Alice" << endl;
}
else {
cout << "Draw" << endl;
}
}
| 106 |
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\n";
else if (a==1)cout<<"Alice\n";
else if (b==1)cout<<"Bob\n";
else if (a>b)cout<<"Alice\n";
else if (b>a)cout<<"Bob\n";
else if (a==b)cout<<"Draw\n";
} | 97 |
Project_CodeNet | 2,020 | #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 if (a > b) {
ans = "Alice";
} else {
ans =... | 117 |
Project_CodeNet | 2,017 | #pragma comment(linker, "/STACK:102400000,102400000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<fstream>
#include<bitset>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define INF 0X3F3F3F3F
#define N 200010
#define... | 887 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a != 1 && a < b){
cout << "Bob" << endl;
}else if(b != 1 && a > b){
cout << "Alice" << endl;
}else if(a == 1 && a < b){
cout << "Alice" << endl;
}else if(b == 1 && a > b){
cout << "Bob" << endl;
}else i... | 132 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
int value[14] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
if(value[A] > value[B]) cout << "Alice" << endl;
if(value[A] == value[B]) cout << "Draw" << endl;
if(value[A] < value[B]) cout << "Bob" << endl;
retur... | 136 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 ALL(v) (v).begin(),(v... | 382 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
#ifndef err
#define err(...)(void)0
#endif
using namespace std;
using ll = long long;
using ull = decltype(1ull);
template<class T>int size(T&&a) { return a.size(); }
#define REP(t,a)for(typename make_signed<decltype(a.second)>::type t=a.first,_l##t=a.second;t<_l##t;t++)
#define RREP(t,a)for(ty... | 508 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
string ans[3] = {"Alice", "Bob", "Draw"};
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) cout << ans[0] << endl;
if (a < b) cout << ans[1] << endl;
if (a == b) cout << ans[2] << endl;
return 0;
... | 124 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
if(b==1){
cout<<"Draw"<<endl;
return 0;
}
cout<<"Alice"<<endl;
return 0;
}else if(b==1){
cout<<"Bob"<<endl;
return 0;
}
if(a>b){
cout<<"Alice"<<endl;
return 0;
}else if(a<b){
... | 138 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (a > b){
if (b == 1){
cout << "Bob" << endl;
}
else{
cout << "Alice" << endl;
}
}
else if (a < b){
if (a == 1){
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
... | 139 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <climits>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <functional>
#include <cstring>
using namespace std;
typedef pair<int, int> P;
... | 483 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
string answer;
if (a == 1 && b == 1) {
answer = "Draw";
} else if (a == 1) {
answer = "Alice";
} else if (b == 1) {
answer = "Bob";
} else {
if (a == b) answer = "Draw";
else if (a > b) answer = "Alic... | 139 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) // rep(i, 1, 5) --> {1,2,3,4} // rep(i, 5, 1) --> {4,3,2,1} // rep(it, end(v), begin(v)) --> *it
using namespace std;
int main()
... | 223 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
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 (... | 140 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using P = pair<ll, ll>;
// chmin, chmax関数
template<typename T, typename U, typename Com... | 339 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define r(i,n) for(int i=0;i<n;i++)
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"... | 123 |
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
cout << "Bob";
return 0;
} | 94 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int eval(int x) {
if(x==1) return 1000;
return x;
}
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int a,b; cin>>a>>b;
int x=eval(a), y=eval(b);
if(x>y) cout << "Alice" << endl;
else if(x==y) cout... | 126 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void){
int A, B;
scanf("%d %d", &A, &B);
if (A == 1)A = 14;
if (B == 1)B = 14;
if (A == B){
printf("Draw\n");
}
else if (A > B){
printf("Alice\n");
}
else{
printf("Bob\n");
}
return 0;
} | 94 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define boost ios::sync_with_stdio(0); cin.tie(0);
#define int long long
const int N = 1e2 + 10;
const int mod = 1e9 + 7;
map<int,int> mp;
int32_t main(){
boost;
in... | 170 |
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";
if (A<B) cout<<"Bob";
if (A==B) cout<<"Draw";
system("pause");
return 0;
} | 75 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
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;
return 0;
}
| 99 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<stdio.h>
#include<cstring>
#include<cstdio>
#include<climits>
#include<cmath>
#include<vector>
#include <bitset>
#include<algorithm>
#include <queue>
#include<map>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a == 1)
{
a = 15;
}
if (b == 1... | 160 |
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 if(a > b){
cout << "Alice"... | 118 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
int A,B;
int main(){
cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A == B){
cout << "Draw" << endl;
}
if(A > B){
cout << "Alice" << endl;
}
if(A < B){
cou... | 135 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.