Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
const int INF= 1e9+5;
typedef long long ll;
int main(){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
return 0;
}
if(A==1){
cout<<"Alice"<<endl;
return 0;
}
if(B==1){
cout<<"Bob"<<endl;
return 0;
}
if(A... | 148 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int main() {
int i, j, 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" << e... | 169 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int a,b; cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else if(a!=1 && b!=1){
if(a>b) cout<<"Alice"<<endl;
if(a<b) cout<<"Bob"<<endl;
}
else if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
} | 112 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
a=(a-2+13)%13;
b=(b-2+13)%13;
if(a==b)printf("Draw\n");
if(a>b)printf("Alice\n");
if(a<b)printf("Bob\n");
return 0;
} | 82 |
Project_CodeNet | 2,017 | #include <iostream>
#include<sstream>
#include<vector>
#include<iterator>
using namespace std;
int main(void)
{
int A, B;
cin >> A >> B;
vector<int> table(13, 0);
for(int i=0; i<13; i++)
table[i] = i;
table[0] = 13;
string ret;
if(A == B)
ret = "Draw";
else if(table[A-1] > table[B-1])
ret = "Alice";
e... | 124 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a == 1) a = 14; if(b == 1) b = 14;
cout << (a > b ? "Alice" : (a < b ? "Bob" : "Draw")) << endl;
return 0;
} | 81 |
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) ... | 137 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI=acos(-1);
const int INF = numeric_limits<int>::max();
int main(){
int a, b;
cin >> a >> b;
if (a ==... | 182 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define F first
#define S second
#define OUT(x) cout << (x) << "\n"
using namespace std;
using point = pair< int,int >;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
const int... | 187 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<string>
using namespace std;
#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) FOR((i),0,(n))
typedef long long ll;
const int INF=1e9+7;
int main(){
int a,b;
cin>>a>>b;
a=(a+11)%13;
b=(b+11)%13;
if(a>b)cout<<"Alice"<<endl;
else if (a==b)cout<<"Draw... | 124 |
Project_CodeNet | 2,017 | /*
ID: y1197771
PROG: test
LANG: C++
*/
#include<bits/stdc++.h>
#define pb push_back
#define FOR(i, n) for (int i = 0; i < (int)n; ++i)
#define dbg(x) cout << #x << " at line " << __LINE__ << " is: " << x << endl
typedef long long ll;
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e3 + 10;
void solv... | 244 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b),a=(a+11)%13+1,b=(b+11)%13+1;
printf("%s\n",a>b ? "Alice" : a==b ? "Draw" : "Bob");
}
| 65 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a == 1){
a += 13;
}
if(b == 1){
b += 13;
}
if(a > b){
cout << "Alice" << endl;
}
else if(a < b){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
} | 106 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a==1)a=14;
if(b==1)b=14;
if(a>b)printf("Alice");
else if(a==b)printf("Draw");
else printf("Bob");
return 0;
}
| 75 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d",&a);
scanf("%d",&b);
if(a==1){
a=a+13;
}
if(b==1){
b=b+13;
}
if(a==b){
printf("Draw\n");
}
else{
if(a>b){
printf("Alice\n");
}
if(a<b){
printf("Bob\n");
}
}
return 0;
}
| 101 |
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 != 1){
cout << "Bob" << endl;
}
if(B != 1){
cout << "Alice" << endl;
}
if(A == 1 && B == 1){
cout << "Draw" << endl;
}
}
else{
if(A > B){
... | 164 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=n-1;i>=m;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007
#define EPS 1e-9
const ... | 257 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int a, b;
cin >> a >> b;
if (a == 1)
a = 14;
if (b == 1)
b = 14;
if (a > b)
... | 166 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
/* cpp template {{{ */
/* short */
#define pb push_back
#define eb ... | 1,320 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int aliceCard,bobCard;
cin >> aliceCard >> bobCard;
if(aliceCard == 1) aliceCard += 13;
if(bobCard == 1) bobCard += 13;
if(aliceCard > bobCard) cout << "Alice";
else if(aliceCard < bobCard) cout << "Bob";
else cout << "Draw";
}
| 102 |
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 << "Bob" << endl;
}
else if(a==b){
cout << "Draw" << endl;
}
else{
cout << "Alice" << endl;
}
}
else if(a==1&&b==1){
cout << "Draw" << endl;
}
else... | 143 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int poker(int a,int b){
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a>b){
printf("Alice");
}
else if(a<b){
printf("Bob");
}else{
printf("Draw");
}
}
int main(){
int A,B;
cin >> A >> B;
p... | 108 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
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" <<... | 102 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9, MOD = 1e9 + 7;
const double EPS = 1e-9, PI = 3.141592653589793;
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define REPR(i,a,b) for(ll i=b;i>=a;i--)
#define repr(i,n) REPR(i,0,n)
#define All(v) (v).begin(), (... | 240 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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++)
#define MOD 1000000007
int main(void) {
int a, b;
cin >> a >> b;
if(a == b) {
cout << "Draw" << endl;
} else if(a == 1 || a > b... | 152 |
Project_CodeNet | 2,018 | #include<iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (a>1 && b>1){
if (a>b){
cout << "Alice" << endl;
}
else if (b>a){
cout << "Bob" << endl;
}
else cout << "Draw" << endl;
... | 152 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin >>a>>b;
if(a==1){a=14;}
if(b==1){b=14;}
if(a>b){
cout <<"Alice"<<endl;
}else if(b>a){
cout <<"Bob"<<endl;
}else{
cout <<"Draw"<<endl;
}
return 0;
}
| 89 |
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 << "Bob" << endl;
} else if (a > b) {
cout << "Alice" << endl;
} else {
cout << "Draw" << endl... | 116 |
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;
}
if(A==1 && B!=1){
cout << "Alice" << endl;
return 0;
}
if(A!=1 && B==1){
cout << "Bob" << endl;
return 0;
}
if(A>B){
cout << "Alice" << endl;
}
if(B>A){
... | 128 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1) A+=13;
if(B==1) B+=13;
if(A>B) cout<<"Alice";
else if(A==B) cout<<"Draw";
else cout<<"Bob";
} | 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <ctype.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
const long long INF = 1LL << 60;
#define rep(i, n) for (int i = 0; i < (int)(n); i++) //(i, 10) i=0～i=9まで
#define repr(i, n) for (int i = n; i >= 0; i--) // (i, 10) i=10～i=0まで
#define FOR(i, ... | 351 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
//input
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;
}... | 120 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
using na... | 359 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if(a==b){
printf("Draw");
}
else if(a==1){
printf("Alice");
}
else if(b==1){
printf("Bob");
}
else if(a<b){
printf("Bob");
}
else if(b<a){
printf("Alice");
}
retu... | 100 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define forn(i, n) for (long long i = 0; i < (long long)(n); ++i)
#define for1(i, n) for (long long i = 1; i <= (long long)(n); ++i)
#define fore(i, l, r) for (long long i = (long long)(l); i <= (long long)(r); ++i)
#define fordn(i, n) for (long long i = (long long)(n) - 1; i >= 0; --i)
#define... | 297 |
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;
}
} | 106 |
Project_CodeNet | 2,018 | #include<algorithm>
#include <iostream>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<string>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1&&b!=1){
cout<<"Alice"<<endl;
}else if(b==1&&a!=1){
cout<<"Bob"<<endl;
}else if(a==1&&b==1){
cout<<... | 158 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define txt \
freopen("ip.txt", "r", stdin); \
freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define ... | 790 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if(a==1)cout<<"Alice"<<endl;
else if(b==1)cout<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
} | 81 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#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 << "Alice" <<endl;
else if (A<B) cout << "Bob" <<endl;
else cout << "Draw" <<endl;
} | 85 |
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;
cout << (a == b ? "Draw" : a > b ? "Alice" : "Bob") << endl;
return 0;
}
| 83 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cctype>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::to_string;
using std::vector;
using std::set;
using std::queue;
using std... | 310 |
Project_CodeNet | 2,018 | #include <iostream>
int main(){
int A,B;
std::cin >> A >> B;
if(A!=1 && B!=1){
if(A>B)
std::cout << "Alice" << std::endl;
else if(A<B)
std::cout << "Bob" << std::endl;
else
std::cout << "Draw" << std::endl;
}
else{
if(A==1 && B!=1)
std::cout << "Alice" << std::endl;
else if(A!=1 && B==1)
std::cout << "Bob" << std::endl... | 137 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
#include<iomanip>
#include<string>
#include<vector>
#include<stack>
#include<cstdlib>
#include<queue>
#include<list>
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;
... | 103 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
}
| 87 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
#define Cout(s) cout << s << endl
string Yes(bool b) {if(b){return "Yes";} else {return "No";}}
string YES(bool b) {if(b){return "YES"... | 176 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
main(){
int A,B;
cin>>A>>B;
auto f=[](int&x){x+=x==1?13:0;};
f(A);
f(B);
if(A==B)
cout<<"Draw"<<endl;
else
cout<<(A>B?"Alice":"Bob")<<endl;
}
| 81 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if(a==1&&b!=1||a!=1&&b!=1&&a>b)cout<<"Alice"<<endl;
else if(a!=1&&b==1||a!=1&&b!=1&&a<b)cout<<"Bob"<<endl;
return 0;
}
| 97 |
Project_CodeNet | 2,017 | # include <iostream>
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 == 1){
cout << "Alice";
}else{
cout << "Bob";
}
}
cout << endl;
return 0;
} | 107 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.r... | 353 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
int a,b;
cin>>a>>b;
if(a==1) a=14;
if(b==1) b=14;
if(a==b) cout<<"Draw"<<endl;
else if(a<b) cout<<"Bob"<<endl;
else cout<<"Alice"<<endl;
}
| 90 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <bits/stdc++.h>
using ... | 814 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstring>
#include<map>
using namespace std;
map<string,int> m;
string a,b;
int main(){
m["1"]=14;
m["2"]=2;
m["3"]=3;
m["4"]=4;
m["5"]=5;
m["6"]=6;
m["7"]=7;
m["8"]=8;
m["9"]=9;
m["10"]=10;
m["11"]=11;
m["12"]=12;
m["13"]=13;
cin >> a;
cin >> b;
if (m[a]>m[b]) cout << "Alic... | 152 |
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<<"Alice"<<endl;
else if(a!=1&&b==1)
cout<<"Bob"<<endl;
else if(a==b)
cout<<"Draw"<<endl;
else if(a>b)
cout<<"Alice"<<endl;
else
cout<<"Bob"<<endl;
}
| 98 |
Project_CodeNet | 2,019 | #include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>
#include<string>
#include<stdexcept>
#include<stdio.h>
#include<queue>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int a,b; cin >> a >> b;
if(a==1) a=14;
if(b==1) b=14;
if(a>b) cout << "Alice... | 119 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a == 2 && b == 1)|| (a==13&&b==1)) {
cout << "Bob";
}
else if ((b == 2 && a == 1)||(b == 13 && a == 1)) {
cout << "Alice";
}
else if (a > b) {
cout << "Alice";
}
else if (b > a) {
co... | 133 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (... | 571 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
void debug() { cerr << "\n"; }
t... | 433 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 322 |
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;
}
| 87 |
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;
} | 99 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int ll;
typedef vector< pair<int,int> > vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef pair<int,int> pii;
const ll INF= ll (1e18);
const int MOD= 1e9+7;
int mai... | 196 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
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(b > a) cout << "Bob" << endl;
... | 129 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
string ret;
if(a==b){
ret="Draw";
}else if(a<b){
ret="Bob";
}else{
ret="Alice";
}
cout<<ret;
return 0;
}
| 99 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long 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;
}
// Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools (tips:... | 169 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
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;
}... | 95 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> a >> b;
if(a == b){
cout << "Draw\n";
} else {
if(a == 1){
cout << "Alice\n";
} else if(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<<"Bob";
else if(A>B)cout<<"Alice";
else cout<<"Draw";
} | 73 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a==1){
a=100;
}
if(b==1){
b=100;
}
if(a>b){
cout << "Alice" << endl;
}else if(a<b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
} | 100 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
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) {
... | 238 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
// Macro Tools /////////////////////////////////////////////////////////////////
#define GET_MACRO_09(A0, A1, A2, A3, A4, A5, A6, A7, A8, NAME, ...) NAME
#define EXPAND_01(MACRO, A0, ...) \
MACRO(A0, ##__VA_ARGS__)
#define EXPAND_02(MACRO, A0, A1, ...) \
MACRO(A0, ##__... | 2,575 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
if (A==B) cout << "Draw" << endl;
else if (A==1) cout << "Alice" << endl;
else if (B==1) cout << "Bob" << endl;
else if (A<B) cout << "Bob" << endl;
else cout << "Alice" <<... | 116 |
Project_CodeNet | 2,017 | /* ****GT_18**** */
#include<bits/stdc++.h>
#define MIN(a,b,c) min(min(a,b),c)
#define MAX(a,b,c) max(max(a,b),c)
#define ll long long
#define itr vector<int>::iterator
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define... | 268 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
printf((a+11)%13>(b+11)%13?"Alice":(a+11)%13==(b+11)%13?"Draw":"Bob");
return 0;
} | 63 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A == 1) A=20;
if(B == 1) B=20;
cout << ((A>B) ? "Alice" : ((A<B) ?"Bob":"Draw")) << endl;
return 0;
} | 75 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cmath>
#include <string>
#include <typeinfo>
#include <climits>
#include <algorithm>
#include <cctype>
#include <cstring>
#include <stdio.h>
#include <cstdlib>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1){
a+=13;
}
if(b==1){
b+=13;
... | 126 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 401 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <string>
#include <random>
#include <map>
#include <math.h>
#pragma warning(disable : 4996)
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("Alice");
}
else if ... | 133 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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;
}
else cout ... | 113 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define int long long
signed main(){
int a,b;
cin>>a>>b;
long long k[13]={13,1,2,3,4,5,6,7,8,9,10,11,12};
if (k[a-1]<k[b-1])cout<<"Bob"<<endl;
else if(k[a-1]>k[b-1])c... | 133 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
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" << endl;
else if(A < B) cout << "Bob" << endl;
} | 106 |
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 {
c... | 119 |
Project_CodeNet | 2,019 | #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=(a); i>=(b); i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define dump(x) cout << #x << " = " << (x) << endl;
typedef long long ll;
typedef pair<int, int> ii;
const in... | 235 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
vo... | 628 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
/*
Bismillahir Rahmanir Rahim
Problem :
Problem Link :
Topics :
Solver : Masud Parves
I Love Code More than Sharks Love Blood <3
*/
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define SZ(a)... | 644 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? ... | 319 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
signed 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;
}
| 96 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A , B;
cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A > B){
cout << "Alice" << endl;
}else if(A == B){
cout << "Draw" << endl;
}else{
cout << "Bob" << endl;
}
} | 100 |
Project_CodeNet | 2,019 | #include<iostream>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a<b){
cout << "Bob" << endl;
}else if(a>b){
cout << "Alice" << endl;
}el... | 121 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a, b; cin >> a >> b;
if (a==1) a+=13;
if (b==1) b+=13;
if (a==b) cout << "Draw" << endl;
else cout << ((a<b) ? "Bob" : "Alice") << endl;
}
| 81 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int A,B;
cin>>A>... | 182 |
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;
}
| 86 |
Project_CodeNet | 2,020 | //do not think about past and stay in this moment
//organize and work - Abhinav IIITA
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define int long long
#define ld long double
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
const ld pi = acos(-1.0);
const int day[12] = {31, 28, 3... | 721 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
... | 350 |
Project_CodeNet | 2,020 | /*
* Author: .-O_O-.
*/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)... | 693 |
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(a==b)puts("Draw");
else if(b==1)puts("Bob");
else if(a==1||a>b)puts("Alice");
else puts("Bob");
return 0;
}
| 98 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b){cout<<"Draw"<<endl;return 0;}
if(a==1)a=14;
if(b==1)b=14;
cout<<(a>b?"Alice":"Bob")<<endl;
return 0;
} | 76 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
int main(){
int a,b;cin>>a>>b;
if(a==b)out("Draw")
else {
if(a==1){out("Alice");return 0;}
else if(b==1){out("Bob");... | 139 |
Project_CodeNet | 2,018 | #include<iostream>
#include<climits>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;
double dat[100][100];
int dp[6][1010];//動的計画法
int prime[10000001];
char str[1010][1010];
... | 187 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A == 1){
A=A+13;
}
if(B == 1){
B=B+13;
}
string ans;
if(A > B){
ans="Alice";
}else if(B > A){
ans="Bob";
}else{
ans="Draw";
}
cout << ans << endl;
}
| 102 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.