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>
#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 << "Alice";
}
else if (A == B) {
cout << "Draw";
}
else {
cout << "Bob";
}
return 0;
} | 105 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int main(){
int A,B, C, D ,E ,F;
string S,Sa,Sb,Sc;
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;
... | 123 |
Project_CodeNet | 2,017 | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
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;
if (a > b) cout << "Alice" << endl;
if (b > a) cout << "Bob" << endl;
return 0;
} | 113 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#include <unordered_map>
#include <map>
#include <numeric>
#include <limits>
#include <utility>
#include <queue>
#include <random>
#include <bitset>
#include <memory>
using namespace st... | 221 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a<b)cout<<"Bob\n";
else if(a>b)cout<<"Alice\n";
else cout<<"Draw\n";
}
| 72 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b){
cout <<"Draw"<<endl;
return 0;
}else if(a==1){
cout <<"Alice" <<endl;
return 0;
}else if(b==1){
cout << "Bob"<<endl;
return 0;
}else if(a>b){
cout << "Alice"<<endl;
return 0;
}else {
cout << "Bob" <<endl;
... | 116 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i... | 386 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
... | 182 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using P = pair<llong, llong>;
#define BE(x) x.begin(), x.end()
const llong inf = llong(1e18)+7;
const llong mod = 1e9+7;
int main(){
int a,b;
cin >> a >>b;
if(a == 1)
a += 13;
if(b == 1)
b += 13;
if(a < b)
cout << "Bob" << endl;
els... | 146 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int a,b;
int main() {
// your code goes here
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if((a>=2&&a<b)||b==1)cout<<"Bob"<<endl;
else if((b>=2&&a>b)||a==1)cout<<"Alice"<<endl;
return 0;
}
| 85 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
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;
}else {
cout << "... | 125 |
Project_CodeNet | 2,017 | #include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
#include <map>
#include <cstring>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int,int> P;
typedef long long int ll;
int main(){
int a,b;
ios_base::sync_with_stdio(false);
cin>>a>>b;
if(a==1) a=14;
if(b==1... | 124 |
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";
else if(a < b) cout << "Bob";
else cout << "Draw";
return 0;
}
| 84 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}
else if(a==1){
cout << "Alice" << endl;
}
else if(b==1){
cout << "Bob" << endl;
}
else if(a>b) {
cout << "Alice" << endl;
}
else if(a<b){
cout << "Bob" << end... | 116 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a;
int b;
cin >> a >> b;
if( a > b && b != 1 )
{
cout << "Alice" << endl;
}
else if ( a > b && b == 1 )
{
cout << "Bob" << endl;
}
else if ( a < b && a != 1 )
{
cout << "Bob" << endl;
}
else if ( a < b && a == 1 )
{
... | 153 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==1)
{
a=14;
}
if(b==1)
{
b=14;
}
if(a>b)
{
cout<<"Alice"<<endl;
}
if(b>a)
{
cout<<"Bob"<<endl;
}
if(a==b)
{
cout<<"Draw"<<endl;
}
... | 109 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1){
a = 14;
}
if (b == 1){
b = 14;
}
if (a > b){
cout << "Alice" << endl;
}
else if (a < b){
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
} | 113 |
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(b > a){ cout << "Bob" << endl; }
else{ cout << "Draw" << endl; }
}
| 90 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
#define loop(i,N) for(ll (i)=0; (i)<(N);++(i))
struct _OMAZINAI_ { _OMAZINAI_() { std::ios::sync_with_stdio(false); std::cin.tie(0); } } __omazinai_instance__;
#define INF (1LL<<61 + 1<<29)
#define YesNo(x... | 478 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else if(a==1)cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
} | 88 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if (A==1){
A=14;
}
if (B==1){
B=14;
}
if (A>B){
cout << "Alice";
} else if (A<B){
cout << "Bob";
} else {
cout << "Draw";
}
} | 93 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a==1) a=14;
... | 161 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main ()
{
int a,b;
cin>>a>>b;
if (a==1)a=14;
if (b==1)b=14;
if(a==b){
cout<<"Draw"<<endl;
}
else if (a<b){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
} | 88 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a > b && b != 1)
{
cout << "Alice";
}
else if(a > b && b == 1)
{
cout << "Bob";
}
else if(a < b && a != 1)
{
cout << "Bob";
}
else if(a < b && a == 1)
{
... | 133 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <algorithm>
using namespace std;
using ll = long long;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
} ... | 166 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std;
int main(){
int A,B;
scanf("%d %d",&A,&B);
if(A==B) printf("Draw\n");
else if(A==1) printf("Alice\n");
else if(B==1) printf("Bob\n");
else if(A>B) printf("Alice\n");
else if(A<B) printf("Bob\n");
return 0;
} | 90 |
Project_CodeNet | 2,020 | //C
#include <cassert>
//#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex... | 615 |
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 == 1){
cout << "Alice";
}else if(b == 1){
cout << "Bob";
}else if(a > b){
cout << "Alice";
}else{
cout << "Bob";
}
return... | 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;
}
else if(B!=1){
cout<<"Alice"<<endl;
}
else{
cout<<"Draw"<<endl;
}
}
else if(A==B){
cout<<"Draw"<<endl;
}
else if(A>B){
cout<<"Alic... | 126 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.e... | 470 |
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(a == b) cout << "Draw" << endl;
if(a < b) cout << "Bob" << endl;
return 0;
} | 101 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a == 1) cout << "Alice" << endl;
else if(b == 1) cout << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 101 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 643 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define chmin(a,b) (a)=min((a),(b));
#de... | 542 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,_4,name,...) name
#define _rep(i,n) _repi(i,0,n)
#define _repi(i,a,b) for(int i=a, i##_len=(b); i<i##_len; ++i)
#define _repis(i,a,b,s) for(int i=a, i##_len(b); i<i##_len; i+=s)
#define REP(...) _overload3(__VA_ARGS__,_repis,_repi,_rep,)(__VA_A... | 329 |
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 << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else cout << "Draw" << endl;
return 0;
} | 85 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a;
int b;
cin >> a >> b;
if(a == 1){
a = a + 13;
}
if(b == 1){
b = b + 13;
}
if(a > b){
cout << "Alice" << endl;
}
else if(a < b){
cout << "Bob" << endl;
}
else{
cout << "... | 110 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
//vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
a += 15;
if (b == 1)
b += 15;
if (a == b)
cout << "Draw" << endl;
else if (a > b)
c... | 149 |
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; }
if(A == B) {
cout << "Draw" << endl;
} else if(A > B) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
} | 108 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A == B){
cout << "Draw" << endl;
... | 158 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main() {
int aa, bb, a, b;
char n[13] = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1 };
scanf("%d %d", &a, &b);
for (aa = 0; aa < 13; aa++) if (n[aa] == a) break;
for (bb = 0; bb < 13; bb++) if (n[bb] == b) break;
if (aa > bb) printf("Alice\n");
else if (bb > aa) printf("Bob\n");
els... | 162 |
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 if (A <... | 122 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#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 == b) {
cout << "Draw";
}
else {
if(a ==... | 166 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 212 |
Project_CodeNet | 2,018 | #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... | 135 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <istream>
#include <map>
#include <set>
#include <queue>
#define rep0(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i < (... | 385 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1)
{
if(b==1)cout<<"Draw"<<endl;
else cout<<"Alice"<<endl;
}
else if(b==1)
{
if(a==1)cout<<"Draw"<<endl;
else cout<<"Bob"<<endl;
}
else
{
if(a>b)cout<<"Alic... | 127 |
Project_CodeNet | 2,018 | #include <cstdio>
#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) printf("Alice\n");
else if (b > a) printf("Bob\n");
else printf("Draw\n");
return 0;
}
| 92 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void)
{
int A, B;
cin >> A >> B;//Alice Bob
if (A == B) {
cout << "Draw" << endl;
return 0;
}
if (A == 1) {
cout << "Alice" << endl;
return 0;
}
else if (B == 1) {
cout << "Bob" << endl;
return 0;
}
if (A < B)cout << "Bob" << endl;
else cout <<... | 128 |
Project_CodeNet | 2,019 |
#include "bits/stdc++.h"
// clang-format off
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T clamp(T val, T min, T max) { return val < min ? min : (max < val ? max : val); }
char capitalize(char c)... | 376 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
//#define 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 emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()... | 1,451 |
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(b>a)
cout<<"Bob"<<endl;
else
cout<<"Draw"<<endl;
} | 70 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main()
{
string ans;
int a, b;
cin >> a >> b;
if(a==b){
ans = "Draw";
}else if(a==1){
ans = "Alice";
}else if(b==1){
ans = "Bob";
... | 146 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int strength (int i) {
if (i == 1)
return 14;
else
return i;
}
int main (void) {
int a, b;
cin >> a >> b;
if (strength(a) > strength(b)) {
cout << "Alice" << endl;
} else if (strength(a) < strength(b)) {
cout << "Bob" << endl;
} else {
co... | 121 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
#include<vector>
#include<set>
#include<algorithm>
#include<tuple>
#include<utility>
#include<cctype>
#include<climits>
#include<map>
#include<queue>
#include<functional>
using namespace std;
template<class T> void chmax(T& a, T b) {if(a < b){a=b;}}
template<class T> void chmin(T& a,... | 316 |
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){
if(a>b) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
else if(a==1) cout << "Alice" << endl;
else if(b==1) cout << "Bob" << endl;
return 0;
} | 113 |
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 << "Bob" << endl;
}
else if(A>B){
cout << "Alice" << en... | 121 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
#include <math.h>
#include <map>
#define Z class
#define ln cout<<'\n'
#define ll long long
#define rep(i, n) for(int i = 0; i < (n); ++i)
//ASCII a=97, A=65
// int H[N];... | 448 |
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";
if (A<B)
cout<<"Bob";
if (A==B)
cout<<"Draw";
system("pause");
return 0;
} | 91 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
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&&B!... | 131 |
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 << "Draw" << endl;
}
else if (A > B) {
cout << "Alice" << endl;
}
else if (A < B) {
cout << "Bob" << endl;
}
} | 110 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std;
struct pruk{
int piname;
bool operator==(const pruk pr)
{
return piname==pr.piname;
}
bool operator>(const pruk pr)
{
return piname>pr.piname;
}
};
int main()
{
pruk a,b;
scanf("%d %d",&a.piname,&b.piname);
if(a.piname==1)a.piname=14;
if(b.piname==1)b.piname=14;
... | 134 |
Project_CodeNet | 2,017 | //#include <bits/stdc++.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#in... | 318 |
Project_CodeNet | 2,017 | # 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;
} | 67 |
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==1 or (a>b and b!=1)) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 72 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main()
{//2<3<4<5<6<7<8<9<10<11<12<13<1
int a,b;
cin>>a>>b;
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<<"Alice";
... | 153 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <sstream>
#include <fstream>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define MAX(x,... | 342 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a==b) cout<<"Draw"<<endl;
else if(a==1) cout<<"... | 140 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
A=(A+12)%14,B=(B+12)%14;
if(A>B)cout<<"Alice"<<endl;
if(A<B)cout<<"Bob"<<endl;
if(A==B)cout<<"Draw"<<endl;
} | 77 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
a = (a+13) % 15;
b = (b+13) % 15;
if(a > b){
cout << "Alice";
}els... | 129 |
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){
cout<<"Alice"<<endl;
return 0;
}
if(B==1){
cout<<"Bob"<<endl;
return 0;
}
if(A-B>0){
cout<<"Alice"<<endl;
return 0;
}
cout<<"Bob"<<end... | 120 |
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 << ... | 122 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n)... | 684 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)... | 705 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pa... | 649 |
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<<"Draw"<<endl;
else if(a<b)
cout<<"Bob"<<endl;
return 0;
}
| 91 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
using i64 = long long;
using pii = pair<i64, i64>;
template<class A, class B>inline bool chmax(A &a, const B &b){return b > a ? a = b,1 : 0... | 312 |
Project_CodeNet | 2,020 | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
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;
re... | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i... | 1,317 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw\n";
return 0;
}
if (a == 1) {
cout << "Alice\n";
return 0;
}
if (b == 1) {
cout <<... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end());
#define vecmin(A) *min_element(A.begin(),A.end());
#define vecmax(A) *max_element(A.begin(),A.... | 187 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 222 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug... | 493 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for(int i=0;i<n;i++)
#define why(n,x) int n;while(cin >>n,n!=x)
#define iFOR(i,x,n)for(int i=x;i<n;i++)
#define unless(flg) if ( !(flg) )
#define read cin<<
#define echo cout<<
#define fin <<'\n'
#define __ <<" "<<
#define ___ <<" "
#define bash push_back
#... | 722 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
ll ceil1(ll a,ll b)
{ if(a%b==0)
return a/b;
else
return a/b+1;}
void solve()
{
ll a,b;
cin>>a>>b;
if(a==b)
{
cout... | 196 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <math.h>
#include <assert.h>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | 1,021 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
unsigned int a, b;
cin >> a >> b;
a -= 2;
b -= 2;
if (a == b) {
cout << "Draw" << endl;
} else if (a < b) {
cout << "Bob" << endl;
} else {
cout << "Alice" << endl;
}
} | 90 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A == 1) A += 13;
if (B == 1) B += 13;
string ans;
if (A > B) ans = "Alice";
if (B > A) ans = "Bob";
if (A == B) ans = "Draw";
cout << ans << endl;
}
| 108 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <... | 454 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int cmp(long long A,long long B){
if(A==B)return 3;
if(A!=1&&B!=1){
if(A>B)return 1;
if(A<B)return 2;
}
if(A==1)return 1;
if(B==1)return 2;
}
int main() {
long long a,b;
cin>>a>>b;
if(cmp(a,b)==1)cout<<"Alice"<<endl;
else... | 130 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int A,B;
cin >> A >>B;
if(A==B){
cout<<"Draw";
return 0;
}
if(A==1){
cout<<"Alice";
return 0;
}
if(B==1){
cout<<"Bob";
return 0;
}
if(A < B){
cout<<"Bob";
return 0;
}
if(A > B){
cout<<"Alice";
return 0;
}
return 0;
} | 112 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return 1;}return 0;}
typedef long long ll;
int main(){
ios... | 320 |
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;
cout<<(a>b?"Alice":(a==b?"Draw":"Bob"));
} | 59 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
int alice, bob;
cin >> alice >> bob;
if (alice == bob)
cout << "Draw";
else if ((alice > bob&&bob != 1) || alice == 1)
cout << "Alice";
else
cout << "Bob";
} | 74 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include <cmath>
#include <ctype.h>
using namespace std;
int a, b;
int main() {
cin >> a >>b;
if(((a > b)&&!(b==1&&a==13)) ||(a==1&&b==13)){
cout << "Alice" << endl;
}else if((a < b) || (b==1&&a==13)){
cout << "Bob" << endl;
}else{
cout << "Dra... | 119 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int i,j;
cin >> i;
cin >> j;
int power[13] = {13,1,2,3,4,5,6,7,8,9,10,11,12};
if(power[i-1]-power[j-1]> 0) cout << "Alice" << endl;
else if(power[i-1]==power[j-1]) cout << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 114 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool ... | 565 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1)A = 14;
if (B == 1)B = 14;
if (A > B)printf("Alice");
if (A < B)printf("Bob");
if (A == B)printf("Draw");
return 0;
} | 82 |
Project_CodeNet | 2,017 | // g++ temp.cpp
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published b... | 1,043 |
Project_CodeNet | 2,018 | #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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int a, b;
cin >> a >> b;
if (a == b) cout <<... | 178 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.