Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
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 << "Bob" << endl;
else if (a > b) cout << "Alice" << endl... | 125 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
struct edge
{
int to, cost;
};
typedef std::vector<std::vector<edge>> graph;
const ll MOD = 1000000007;
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if... | 194 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T &a, T b) { if(a > b){ a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, T b) { if(a < b){ a = b... | 242 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int a, b;
cin >> a >> b;
if (a == b){
cout << "Draw" << endl;
}else if (a == 1){
cout << "Alice" << endl;
}els... | 161 |
Project_CodeNet | 2,018 | #include<algorithm>
#include <bits/stdc++.h>
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<<"Bob"<<endl;
else if(a>b) cout<<"Alice"<<endl;
else cout<<"Draw"<<endl;
return 0;
}
| 84 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(0);
#define setnow clock_t tStart=clock();
#define time (double)(clock() - tStart)/CLOCKS_PER_SEC;
#define setin(x) ifstream cin(x);
#define setout(x) ofstream cout(x);
typedef long long ll;
typedef long long int lli;
typ... | 207 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int Alice,Bob;
cin >> Alice >> Bob;
if(Alice == Bob){
cout<<"Draw"<<endl;
}
else if(Alice == 1){
cout<<"Alice"<<endl;
}
else if(Bob == 1){
cout<<"Bob"<<endl;
}
else if(Alice > Bob){
cout<<"Alice"<<endl;
}
else{
cout<<"Bob"<<endl;
}
return ... | 101 |
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;
} | 110 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void) {
int A,B;
scanf("%d%d",&A,&B);
if(A==1){
if(B==1){
printf("Draw");
}
else{
printf("Alice");
}
}
else if(B==1){
if(A==1){
printf("Draw");
}
else{
printf("Bob");
}
}
else if(A>B){
printf("Alice");
}
else if(B>A){
printf("Bob");
}
else{
print... | 126 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define int long long
#define F first
#define S second
const ll INF = 1LL * 1000 * 1000 * 1000 * 1000 * 1000 * 1000;
const int inf = 1000 * 1000 * 1000;
// Bedone harf !
int32_t main(){
ios::sync_with_stdio(false);cin.tie(0);
... | 197 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<numeric>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i = m; i < n; i++)
#define rep(i,n)... | 415 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
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";
else if(a<b) cout<<"Bob";
else cout<<"Draw";
} | 66 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
bool check(int a, int b){
if(a != 1 && b != 1){
return a > b;
}else{
return a == 1;
}
}
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else{
if(check(a, b)){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}
}... | 115 |
Project_CodeNet | 2,017 | #include<algorithm>
#include<limits.h>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
int main(void) {
int A = 0, B = 0;
scanf("%d%d", &A, &B);
if (A == 1)
A += 20;
if (B == 1)
B += 20;
if (A > B)
printf("Alice\n");
else if (A < B)
printf("Bob\n");
else
printf("Draw\n");
retur... | 114 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
a=(a-1)%13;
if(!a)a=13;
b=(b-1)%13;
if(!b)b=13;
if(a>b)cout<<"Alice"<<endl;
else if(a<b)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return 0;
}
| 87 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A==1) A+=13;
if (B==1) B+=13;
if (A==B) {
cout << "Draw" << endl;
} else if (A>B) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
}
| 103 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
#include<deque>
using namespace std;
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define rep2(i,j,n) for(int i=(j);i<... | 235 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if(a==b)
cout << "Draw";
else
{
if(a>b && b!=1)
cout << "Alice";
else if(a>b && b==1)
cout << "Bob";
else if(a<b && a!=1)
cout << "Bob";
else if(a<b && a==1)
cout << "... | 127 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a>1&&b>1){
if(a>b){
cout<<"Alice"<<endl;
}
if(a<b){
cout<<"Bob"<<endl;
}
if(a==b){
cout<<"Draw"<<endl;
}
}
else if(a==1&&b>1){
cout<<"Alice"<<endl;
}
else if(a!=1&&b==1){
... | 143 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
//long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() en... | 387 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int a, b;
string s;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) s = "Alice";
else if (a < b) s = "Bob";
else s = "Draw";
cout << s << endl;
return 0;
}
| 98 |
Project_CodeNet | 2,019 | // Author: Vamsi Krishna Reddy Satti
// With love for Competitive Programming!
#include <bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define cout_precision cout.setf(ios::fixed); cout.precision(32);
using ll = int64_t; using vll = vect... | 225 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)... | 760 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <numeric>
#include <limits>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == 1){
if(b!=1) cout << "Alice" << endl;
else cout << "Draw" << endl;
}
else if(b == 1){
... | 167 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B && A == 1) {
cout << "Alice" << endl;
}
else if (A < B && A != 1) {
cout << "Bob" << endl;
}
else if (A > B && B == 1) {
cout << "Bob" << endl;
}
else if (A > B && B != 1) {
... | 143 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_po... | 1,261 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#include<vector>
#include <stdio.h>
using namespace std;
#define mod 1000000007LL
#define pi 3.141592653589793238462643383279;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
{
... | 169 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
#include <utility>
#include <bitset>
#include <queue>
using namespace std;
using ll = long long;
template <typename T>
inline bool chmax(T &a, ... | 187 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> vec = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
string ans;
if (a == b) {
ans = "Draw";
} else if (vec.at(a) > vec.at(b)) {
ans = "Alice";
} else {
ans = "Bob";
}
cout << ans << endl;
}... | 135 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a==1||b==1){
if(a>b)
cout << "Bob";
else if(a<b)
cout << "Alice";
else
cout << "Draw";
}
else
{
if(a>b)
cout << "Alice";
... | 119 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
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;
}
else if(b==1){
cout<<"Bob"<<endl;
}
else if(a<b){
cout<<"Bob"<<endl;
}
else if(b<a){
cout<<"Alice"<<endl;
}
else cout<<"Draw"<<endl;
} | 109 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#define rep(i, n) for(int i=0;i<n;i++)
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;
... | 124 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cmath>
#include<string>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1&&b!=1)cout<<"Alice";
else if(b==1 &&a!=1)cout<<"Bob";
else if(a>b)cout<<"Alice";
else if(b>a)cout<<"Bob";
else if(a==b) cout<<"Draw";
} | 84 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
const int INF = 100000000;
using namespace std;
int main() {
int v[13... | 183 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for(int i = k; i < (int)(n); i++)
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if(a == 1)
a = 14;
if(b == 1)
b = 14;
string ans = "Draw";
if(a > ... | 150 |
Project_CodeNet | 2,017 | /*
_ __ U _____ u _ __
|"|/ / \| ___"|/ |"|/ /
| ' / | _|" | ' /
U/| . \\u | |___ U/| . \\u
|_|\_\ |_____| |_|\_\
,-,>> \\,-.<< >>,-,>> \\,-.
\.) (_/(__) (__)\.) (_/
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
type... | 308 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(n);(i)>=0;(i)--)
#define... | 717 |
Project_CodeNet | 2,017 | //Written by Zhu Zeqi
//Come on,baby
//Hack,please
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#inc... | 498 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
タイポした... | 307 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
struct edge {int /*from,*/to,cost;};
typedef long long ll;
typedef pair<int,int> P;
typedef pair<pair<int,int>,int> PP;
typedef vector<int> VI;
typedef vector<long long int> VL;
typedef vector<edge> VE;
static const int MOD = 1000000007;
static const int INF = 2147483647;... | 579 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
//isPr... | 227 |
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(b == 1){
cout << "Bob" << endl;
}
else if(a == 1){
cout << "Alice" << endl;
}
else if(a > b){
cout << "Alice" << endl;
}
else if(a < b){
cout <... | 125 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <v... | 1,956 |
Project_CodeNet | 2,019 | //#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007LL
#define INF (1LL<<60LL)
#define int long long
typedef long long ll;
using namespace std;
signed main() {
ll a, b; cin >> a >> b;
if (a == 1)a = ... | 164 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
using namespace std;
int main() {
long long 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) {
... | 127 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a>b){
cout << "Alice" << endl;
}else if(a<b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
} | 90 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A == B){
cout << "Draw" << endl;
}
else if(A == 1){
cout << "Alice" << endl;
}
else if(B == 1){
cout << "Bob" << endl;
}
else if(A > B){
cout << "Alice" << endl;
}
else if(A < B){
cout << "Bob" << endl;... | 114 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,a) FOR(i,0,(int)(a)-1)
#define reset(a,b) memset(a,b,sizeof(a))
#define BUG(x) cout << #x << " = " << x << endl
#define PR(x,a,b) {cout << #x << " = "; FOR... | 294 |
Project_CodeNet | 2,018 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef struct pair<ll,int> P;
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;
}else{
cout<<"Draw"<<endl;
... | 105 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <bitset>
#include <map>
#include <cstring>
#include <cstdlib>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for(int i = 0;i < (n);... | 409 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
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(b < a) cout << "Alice" << endl;
else cout << "Bob"... | 110 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string.h>
#include<queue>
#include<map>
#include<vector>
#include <cstdlib>
#include<algorithm>
#include <cstdio>
#include <cctype>
using namespace std;
const long long INF=10000000000000LL;
typedef long long ll;
typedef pair<ll,ll> P;
ll N,M,K=1,C;
ll A,B,W;
ll T,a,b;
double v[55],D[55];
ll... | 204 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <algorithm>
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){
... | 124 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int 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"<<e... | 118 |
Project_CodeNet | 2,020 | #include <vector>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
long long PRIME = 1e9 + 7;
using namespace std;
vector<vector<int>> E;
int main(){
int A, B;
cin >> A >> B;
A = (A + 12) % 14;
B = (B... | 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"<<endl;
return 0;
}
if(a==1)a+=13;
if(b==1)b+=13;
if(a>b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 90 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin,(obj).end()
#define SORT(list) sort(ALL((list)));
using namespace std;
... | 230 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | 322 |
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==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;
} | 109 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long lng;
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORD(i,b,a) for(int i=(b); i>=(a); --i)
#define REP(i,n) FOR(i,0,n-1)
#define ALL(a) (a).begin(), (a).end()
#define UNIQUE(a) a.erase(unique(ALL(a))... | 264 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <cstdio>
#include <string.h>
#include <vector>
#include <functional>
#include <stack>
#include <queue>
#include <string>
#include <list>
using namespace std;
typedef long long ll;
/* prototype */
int EDSum(ll);//各桁の和
vector<int> SOE(int,int);//素数 (Min,... | 926 |
Project_CodeNet | 2,017 | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <cstring>
#include <ctime>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 5005;
int main() {
//freopen("in.cpp","r",stdin);
int x,y;
cin>>x>>y;
if(x==1)x... | 139 |
Project_CodeNet | 2,020 | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | 349 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int A, B;
int main(void)
{
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;
} | 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
m... | 200 |
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 (b > a) {cout << "Bob" << endl;}
else { cout << "Draw" << endl; }
} | 103 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw";
return 0;
}
else if(a == 1){
cout << "Alice";
return 0;
}
else if(b == 1){
cout << "Bob";
return 0;
}
else if(a > b){
cout << "Alice";
r... | 133 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<iostream>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a == b)cout << "Draw" << endl;
else if (a == 1) cout << "Alice" << endl;
else if (b == 1) cout << "Bob" << endl;
else if (a > b) cout << "Alice" << endl;
else if (a < b) cout << "Bob" << endl;
return 0;
} | 107 |
Project_CodeNet | 2,019 | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define e... | 400 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a=(a+11)%13;
b=(b+11)%13;
if(a==b){
cout<<"Draw"<<endl;
}else if(a<b){
cout<<"Bob"<<endl;
}else{
cout<<"Alice"<<endl;
}
return 0;
} | 90 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
int card[] = {
0, 13, 1, 2, 3,
4, 5, 6, 7, 8,
9, 10, 11, 12};
if (card[A] > card[B])
{
cout << "Alice" << endl;
}
else if (card[A] < card[B])
{
cout << "Bob" << e... | 143 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
int main(){
int A,B;
cin>>A>>B;
if(A==1)A+=13;
if(B==1)B+=13;
if(A>B){
cout<<"Ali... | 159 |
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(B==1){
cout<<"Bob"<<endl;
}else if(A==1){
cout<<"Alice"<<endl;
}else if(A>B){
cout<<"Alice"<<endl;
}else if(A<B){
cout<<"Bob"<<endl;
}
return 0;
}
| 104 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int A, B;
cin >> A >>B;
if((A >= 2 && A <= 13) && (B >= 2 && B <= 13)) {
if (A > B) {
cout << "Alice" << endl;
}
else if (A < B) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
}
else {
if (A == 1 &... | 176 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
void solve(){
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;
}
int main(){
solve();
return 0;
} | 86 |
Project_CodeNet | 2,017 | #include <iostream>
int a, b;
int f;
int main(){
std::cin >> a >> b;
if(a == b)f = -1;
else if(a == 1)f = 0;
else if(b == 1)f = 1;
else if(a > b)f = 0;
else if(b > a)f = 1;
if(f == 0)std::cout << "Alice" << std::endl;
if(f == 1)std::cout << "Bob" << std::endl;
if(f == -1)std::cout... | 144 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
// Your code here!
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
return 0;
}
if(a == 1){
a+= 13;
} else if (b == 1){
b+= 13;
}
cout << (a > b ? "Alice" : "Bob") << endl;
... | 107 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if(x==y){
cout<<"Draw"<<endl;
return 0;
}
if(x==1) x=14;
if(y==1) y=14;
if(x>y){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
} | 100 |
Project_CodeNet | 2,020 | // include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
// define
// --------------------------------... | 412 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int x,y;
cin >> x >> y;
if(x==1||y==1){
if(x!=1)cout << "Bob" << endl;
else if(y!=1)cout << "Alice" << endl;
else cout << "Draw" << endl;
}else{
if(x>y)cout << "Alice" << endl;
else if... | 134 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll A, B; cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
cout << (A < B ? "Bo... | 129 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int poker(int x)
{
return x == 1 ? 14 : x;
}
int main()
{
int A, B;
cin >> A >> B;
A = poker(A);
B = poker(B);
if (A > B) {
cout << "Alice" << endl;
}
else if (B > A) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
}
| 103 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b){
cout<<"Draw"<<endl;
}
else if(a!=b&&a==1){
cout<<"Alice"<<endl;
}
else if(a!=b&&b==1){
cout<<"Bob"<<endl;
}
else if(a>b){
cout<<"Alice"<<endl;
}
else if(a<b){
cout<<"Bob"<<endl;
}
} | 113 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a==b) cout << "Draw" << endl;
else if(a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 96 |
Project_CodeNet | 2,020 | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 1,154 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{
speed_up;
ll a, b;
cin>>a>>b;
if(a == 1) a = 1 + 13;
if(b == 1) b = 1 + 13;
if(b == ... | 143 |
Project_CodeNet | 2,018 | #ifdef LOCAL
#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
#else
#include <bits/stdc++.h>
#endif
using namespace std ;
typedef long long ll ;
#define rep(i , n ) for ( int i =0; i < n ; i++)
#define _sort(arg) sort(begin(arg), end(arg))
#define MOD 1000000007
#define p... | 252 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a!=1 && b!=1){
if(a>b) cout << "Alice" << endl;
if(a==b) cout << "Draw" << endl;
if(a<b) cout << "Bob" << endl;
}
if(a==1 && b!=1) cout << "Alice" << endl;
if(a!=1 && b==1) cout << "Bob" << endl;
if(a==1 && b==1) cout <<... | 128 |
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;
}
return 0;
} | 113 |
Project_CodeNet | 2,017 | /* You lost the game. */
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cfloat>
#include <numeric>
#include <cassert>
#inclu... | 564 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A > B) {
cout << "Alice" << endl;
} else if (A < B) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
}
| 106 |
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&&B!=1) cout << "Alice" << endl;
if(A==1&&B==1) cout << "Draw" << endl;
if(A!=1&&B==1) cout << "Bob" << endl;
if(A!=1&&B!=1){
if(A>B) cout << "Alice" <... | 160 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a > b){
if(b != 1){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
}else if(a < b){
if(a != 1){
cout << "Bob" << endl;
}else{
... | 125 |
Project_CodeNet | 2,018 | #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
if ( A == B ) {
std::cout << "Draw" << std::endl;
} else if ( A == 1 || B == 1 ) {
if ( A == 1 ) {
std::cout << "Alice" << std::endl;
} else {
std::cout << "Bob" << std::endl;
}
} else {
if ( A > B ) {
std::... | 153 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_... | 248 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
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 << "Ali... | 112 |
Project_CodeNet | 2,017 | // In the name of Allah the most Merciful.
#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==1||b==1){
if(a==1)cout << "Alice" << endl;
else cout << "Bob" << endl;
}
else{
if(a>b)cout ... | 124 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
{
a = 14;
}
if (b == 1)
{
b = 14;
}
if (a == b)
{
cout << "Draw" << endl;
}
else if (a > b)
{
cout << "Alice" << endl;
}
else
{
cout << "Bob" << endl... | 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";
}
else{
cout<<"Alice";
}
}
else{
if(b==1){
cout<<"Bob";
}
else if(a>b){
cout<<"Alice";
}
else if(a<b){
cout<<"Bob";
}
else{
c... | 109 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int A;
int B;
cin >> A >> B;
if (A == 1)
{
A = 14;
}
if (B == 1)
{
B = 14;
}
if (A == B)
{
cout << "Draw";
}
else
if (A > B)
{
cout <... | 129 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.