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>
using namespace std;
void solve(long long A, long long 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 << "Bob" << '\n';
else cout << "Alice" << '\n';
}
int main(){
cin.tie(0);
... | 152 |
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";
return 0;
}
else if (a == 1 || b == 1) {
cout << (a < b ? "Alice" : "Bob") << "\n";
}
else {
cout << (a > b ? "Alice" : "Bob") << "\n";
... | 113 |
Project_CodeNet | 2,018 | #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 || a < b) cout << "Bob" << endl;
else cout << "Alice" << endl;
return 0;
} | 93 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VS = vector<string>;
using graph = vector<vector<int>>;
int main()
{
int a,b;
cin>... | 162 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
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 if (b == 1 || (a < b && a != 1))
cout << "Bob" << endl;
return... | 111 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define INF 100000000
#define MOD9(a) (a%1000000009)
#define MOD7(a) (a%1000000007)
#define ABS(a) (a<0?-(a):a)
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define REP(i,a) for(int i=0;i<a;i++)
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int a = (A+13)%15;
in... | 182 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(v,n) for(int i=0;i<n;i++){cin >> v.at(i);} //配列vにn個の要素を入力する
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 << "Draw";}
else{cout << "Bob";}
... | 121 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define base 1000000007LL
#define ll long long
#define X first
#define Y second
#define pb push_back
#define MAXN 21010
#define Scan(a) scanf("%I64d", &a)
#define CLR(a) memset(a,0,sizeof(a))
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORE(i,a,b) for(int i=(a),_b=(b); i>=_b; i... | 288 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#i... | 316 |
Project_CodeNet | 2,017 | #include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<numeric>
#include<algorithm>
#include<string>
#include<map>
#include<bitset>
#include<set>
#include<cmath>
#define int long long
const int inf=8938103643641919514ll;
const int mod=1000000007ll;
const int dd[]={0,-1,0,1,0};
using namespace std... | 236 |
Project_CodeNet | 2,019 | #include<iostream>
#include<deque>
#include<cmath>
#include<cstring>
#include<map>
#include<algorithm>
#include<vector>
#include<ios>
#include<sstream>
#include<locale>
using namespace std;
#define ive(cris) int long long
#define in(out) long double
#define INF 100000007
int main(){
int a,b;
cin>>a>>b;
if(a==b){... | 186 |
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 cout<<(a<b? "Bob":"Alice")<<endl;
return 0;
}
| 86 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
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;
}
| 110 |
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 && B!=1){
if(A<B) cout << "Bob" << endl;
else cout << "Alice" << endl;
}
else{
if(A==1) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
return 0;
} | 104 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
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";
} | 99 |
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 cout<<(A>B?"Alice":"Bob")<<endl;
} | 79 |
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&&A<B){
cout<<"Bob";
}
else if(B==1&&A>B){
cout<<"Bob";
}
else if (A>B&&B!=1){
cout<<"Alice";
}
else if(A==1&&A<B){
cout<<"Alice";
}
return 0;
}
| 96 |
Project_CodeNet | 2,019 | // Author:: Mohammad Faisal
// BEGINNING WITH THE NAME OF ALMIGHTY GOD ALLAH
#include<bits/stdc++.h>
using namespace std;
int main()
{
int alice, bob;
cin >> alice >> bob;
if(alice== bob)
cout<<"Draw";
else if(alice > bob && bob!=1)
cout<<"Alice";
else if(alice > bob && bob==1)
cout<<"Bob";
else... | 135 |
Project_CodeNet | 2,018 | #include <iostream>
#include <math.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#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()
typedef long long lint;
us... | 169 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define forn(i,a,b) for(int i=(a);i<(b); ++i)
#define nfor(i,b,a) for(int i=(b-1);i>=a;--i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define ifile freopen("point1.in", "r", stdin)
#define ofile freopen("point1.out ", "w", stdout)
#def... | 403 |
Project_CodeNet | 2,017 | #include <fstream>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#include <random>
using namespace std;
#define min(a,b) ((a)<(b) ? (a):(b))
#def... | 1,864 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
const int inf = 1000000000; //10^9
const ll MOD = 1e9 + 7;
//加算代入演算子は+=！！！！！
//int 2^31 10^9まで
int main()
{
int a,... | 209 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a = 14;
if (b == 1)
b = 14;
cout << (a == b ? "Draw" : a > b ? "A... | 117 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B){
cout << "Draw" << endl;
}else if(A == 1){
cout << "Alice" << endl;
}else if(B == 1){
cout << "Bob" << endl;
}else if(A > B){
cout << "Alice" << endl;
}else{
co... | 115 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
short a,b;
cin>>a>>b;
if(a==1)a+=13;
if(b==1)b+=13;
if(a>b)cout<<"Alice"<<endl;
if(b>a)cout<<"Bob"<<endl;
if(a==b)cout<<"Draw"<<endl;
} | 78 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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;
} else {
... | 129 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a, b;
cin >> a >> b;
if(a==1 || b==1){
if(a==1 && b==1){
cout << "Draw" << endl;
}else if(a==1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl... | 152 |
Project_CodeNet | 2,020 | #include <cstdio>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a < b)
printf("Bob\n");
else if(a > b)
printf("Alice\n");
else
printf("Draw\n");
} | 86 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// vector<int> vec(3); = vector<int> vec={0,0,0}
// vec.at()
// sort(num.begin(),num.end(), greater<int>());
// reverse(num.begin(),num.end());
// 切り上げ a/b+1
// 1からNの総和 N*(N+1)/2
int main() {
int A, B;
cin >> A >> B;
if(A == 1 || B == 1){
if(A == B){
c... | 219 |
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 << "Alice" << endl;
}
else if (A != 1 && B == 1){
cout << "Bob" << endl;
}
else if (A>B){
cout << "Alice" << endl;
}
else if (A==B){
cout << "Draw" << endl;
}
... | 136 |
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";
}
if(b>a){
cout << "Bob";
}
if(a==b){
cout << "Draw";
}
}
| 92 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scan... | 293 |
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 << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 85 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b;
string win;
cin >> a >> b;
if (a == b) win = "Draw";
else if (a == 1) win = "Alice";
else if (b == 1) win = "Bob";
else if (a > b) win = "Alice";
else win = "Bob";
cout << win << endl;
return 0;
} | 102 |
Project_CodeNet | 2,018 | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
typedef long long ll;
using namespace s... | 197 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef pair<int,int> P;
//priority_queue<int> pque;
//priority_queue<int, vector<int>, greater<int>> pque;
ll INFL = 1000000000000000010;//10^18 = 2^60
int INF = 1000000000;//10^9
ll MOD = 1000000007;
int main(void){
int a,b;
cin >> a >>... | 183 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i... | 360 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == 1)
A += 13;
if(B == 1)
B += 13;
if(A > B){
cout << "Alice" << endl;
}
else if(A == B){
cout << "Draw" << endl;
}
else{
cout << "Bob" << endl;
}
}
| 103 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define endl '\n';
typedef long long ll;
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a < b) {
cout << "Bob";
} else if (b < a) {
cout << "Al... | 131 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main(){
int a, b, c, d;
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... | 132 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstring>
#include<cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <ctime>
#include <cstring>
#include <cmath>
#include <stack>
#include <set>
#include <unordered_map>
#define INF 0x3f3f3f3f
#define ll long long
#define rep(i, n) for(ll i=0;i<n;i++)
#define per(i,... | 443 |
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>b){
if(b==1){
cout << "Bob";
}
else{
cout << "Alice";
}
}
else if(a<b){
if(a==1){
cout << "Alice";
}
else{
cout << "Bob";
}
... | 118 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | 262 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a==b)puts("Draw");
else if((a==13||b==13)&&(a==1||b==1)){
if(a>b)puts("Bob");
else puts("Alice");
}
else if(a>b)puts("Alice");
else if(a<b)puts("Bob");
return 0;
} | 92 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int a,b;
int main(){
scanf("%d%d", &a, &b);
if(a == 1)
a = 14;
if(b == 1)
b = 14;
if(a < b)
printf("Bob\n");
else if(a > b)
printf("Alice\n");
else
printf("Draw\n");
}
| 83 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k, m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
... | 373 |
Project_CodeNet | 2,018 | #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 << "Alice" << endl;
else if (a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
} | 99 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i,n) for(int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define MOD 1000000007 // 1e9+7
#define PI acos(-1.0)
#define ll long long int // 10^18
#define INF 1000000001 // 1e9+1
int dx[4]={1,... | 230 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
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;
} | 76 |
Project_CodeNet | 2,019 | #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; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size)
#define MOD 1000000007
const long long mod = 1e9+7;
typedef vector... | 289 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){return b ? gcd(b, a % b) : a;}
int main(){
ll A, B;
string ans;
cin >> A >> B;
if(A == 1) A = 14;... | 170 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
if(a == 1)
a += 100;
if(b == 1)
b += 100;
if(a > b)
cout << "Alice" << endl;
if(a == b)
cout << "Draw" << endl;
if(a < b)
cout << "Bob" << endl;
return 0;
} | 102 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a,b,c,d;
int main(){
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a>b)printf("Alice");
if(a==b)printf("Draw");
if(a<b)printf("Bob");
}
| 74 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_CPP_OVERLOAD_SECURE_NAMES 1
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <random>
#include <ctime>
#d... | 170 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a==b){
cout << "Draw" << endl;
}
else if(a==1){
cout << "Alice" <<endl;
}
else if(b==1){
cout << "Bob"<<endl;
}
else if(a>=b){
cout << "Alice"<<endl;
}
else cout <<"Bob"<<endl;
} | 95 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | 256 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <map>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
retur... | 202 |
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 a > b ? cout<<"Alice"<<endl : cout<<"Bob"<<endl;
}
| 88 |
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 <<... | 126 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b; cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
cout << (a > b ? "Alice" : a <... | 147 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b == 1) {
cout << "Draw" << endl;
} else if(a == 1) {
cout << "Alice" << endl;
} else if(b == 1) {
cout << "Bob" << endl;
} else {
if(a > b) {
cout << "Alice" << endl;
} else if (a ==... | 146 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if ... | 372 |
Project_CodeNet | 2,017 | #include<string>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<unordered_set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include <cstring>
#include <climits>
using namespace s... | 157 |
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;
if (b>a) cout<<"Bob"<<endl;
if (a==b) cout<<"Draw"<<endl;
} | 87 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
long long a,b;
int main()
{
cin>>a>>b;
if(a==1)a=20;
if(b==1)b=20;
if(a>b)
cout<<"Alice"<<endl;
else
{
if(a<b)cout<<"Bob"<<endl;
else
{
cout<<"Draw"<<endl;
}
}
} | 85 |
Project_CodeNet | 2,020 | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_c... | 2,193 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
long long int x,y;
cin>>x>>y;
if(x==1&&y==1){
cout<<"Draw";
... | 198 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
int a, b;
cin >> a >> b;
a == 1 ? a = 100 : 0;
b == 1 ? b = 100 : 0;
if (a > b)
cout << "Alice";
else if (a < b)
cout << "Bob";
else
cout << "Draw";
cout << endl;
}
| 104 |
Project_CodeNet | 2,017 | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | 423 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw\n";
else if (A < B) {
if (A == 1)
cout << "Alice\n";
else
cout << "Bob\n";
} else {
if (B == 1)
cout << "Bob\n";
else
cout << "Alice\n";
}
return 0;
} | 113 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << "Draw" << endl;
}else if(a == 1){
cout << "Alice" << endl;
}else if(b == 1){
cout << "Bob" << endl;
}else if(a > b){
cout << "Alice" << endl;
}else if(b > a){
cout << "Bob" << ... | 136 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#in... | 162 |
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(B < A) cout << "Alice" << endl;
else cout << "Draw" << endl;
} | 92 |
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)||(B!=1&&A>B))
{
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
} | 91 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if(a==1) {
if(b==1) cout << "Draw" << endl;
else cout << "Alice" << endl;
return 0;
}
if(b==1) {
if(a==1) cout << "Draw" << endl;
... | 166 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define SREP(i, s) for(int i = 0; i < (s.length()); i++)
#define SORT(v, n) sort(v, v+n);
#define GSORT(v, n) sort(v, v+n, greater<int>())
#define REV(a) reverse(begin(a),end(a));
int main(){
ios::sync_with_stdio(false);cin... | 174 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >>B;
if (2 <= A && A <= 13 && 2 <= B && B <= 13 && A > B) {
cout << "Alice" << endl;
}
else if (2 <= A && A <= 13 && 2 <= B && B <= 13 && A < B) {
cout << "Bob" << endl;
}
else if (A == 1 && B != 1) {
cout << "Alice"... | 171 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
using namespace std;
int main(void){
// Your code here!
int s,t;
cin>>s>>t;
if(s==t){
cout<<"Draw"<<endl;
}
else if(s>=2&&s<t||t==1){
cout<<"Bob"<<endl;
}
else if(t>=2&&t<s||s==1){
cout<<"Alice"<<endl;
}
}
| 96 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<stdbool.h>
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 co... | 128 |
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==b) cout<<"Draw"<<endl;
else if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else cout<<(a>b ? "Alice" : "Bob" )<<endl;
} | 87 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
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" << ... | 148 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define t(x) x==1?14:x
int main(){
int a,b;
cin>>a>>b;
a=t(a);b=t(b);
if(a>b)cout<<"Alice\n";
else if(a<b)cout<<"Bob\n";
else cout<<"Draw\n";
} | 69 |
Project_CodeNet | 2,018 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <limits>
#include <tuple>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#defi... | 715 |
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 && b==13) cout << "Alice" << endl;
else if (a==13 && 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<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
if ( a == b ) cout << "Draw" << e... | 143 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin>>a>>b;
if(a == b)
cout<<"Draw"<<"\n";
else if(((a > b) && (b != 1)) || (a == 1 && b != 1))
cout<<"Alice"<<"\n";
else if(b > a || (a != 1 && b == 1))
cout<<"Bob"<<"\n";
return 0;
} | 107 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const double PI=3.141... | 225 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a > b) {
cout << "Alice" << endl;
} else if (a == b) {
cout << "Draw" << endl;
} else {
cout << "Bob" << endl;
}
} | 106 |
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 << "Bob" << endl;
}
else if (A == B) {
cout << "Draw" << endl;
}
else {
cout << "Alice" << endl;
}
} | 101 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (a == 1){
a += 13;
}
if (b == 1){
b += 13;
}
if (a > b){
cout << "Alice" << endl;
}
else if (a < b){
cout << "Bob" << endl;
}
else if (a == b){
cout... | 121 |
Project_CodeNet | 2,020 | //int a = stoi(c); 文字列をintへ
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//途中の出力をそのまま残さない
//数値計算 個数以外はdouble
//map<キー,値> p は辞書。p[キー] = 値
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//絶対値 abs()
//入力は空白で切れる
//大文... | 749 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int a,b; cin >> a >> b;
if (a == 1)
a += 13;
if (b == 1)
b += 13;
if (a < b)
cout << "Bob\n";
else if (a > b)
cout << "Alice\n";
else
c... | 141 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw";
}
else if(a != 1 && b != 1){
if(a > b){
cout << "Alice";
}
else{
cout << "Bob";
}
}
else if(a == 1||b == 1){
if(a == 1){
cout << "Alice";
}
else if(b... | 125 |
Project_CodeNet | 2,017 | #include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
using namespace std;
#define l... | 477 |
Project_CodeNet | 2,017 |
/*********************************************************************\
بسم الله الرحمن الرحيم |
codeforces = Alhelal_ONE || topcoder = Al..helal |
mail = alhelaliu@gmail.com |
CSE,Islamic University,K... | 1,203 |
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;
}
| 105 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if(a == 1 || b == 1) {
if(a == 1 && b == 1) {
cout << "Draw" << endl;
}
else if(b == 1) {
cout << "Bob" << endl;
}
else {
cout << "Alice" << endl;
}
}
else if(a < b) {
cout <... | 155 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#... | 653 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
if(b==1)
cout<<"Draw"<<endl;
else
cout<<"Alice"<<endl;
}
else if(b==1)
cout<<"Bob"<<endl;
else{
if(a>b)
cout<<"Alice"<<endl;
if(a==b)
cout<<"Draw"<<endl;
if(a<b)
cout... | 115 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;cin>>a>>b;
if(a==1&&b==1) 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;
... | 118 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.