Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define PI 3.141592653589793
int main(){
int a, b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
string ans;
if(a > b)
ans = "Alice";
else if(a < b)
... | 127 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define FOR(i,a,b) for(ut i=(a);i<(ut)(b);i++)
#define REP(i,b) FOR(i,0,b)
#define ALL(c) c.begin(),c.end()
#define PB push_back
#define cat //cout << __LINE__ << endl;
using namespace std;
typedef long long LL;
typedef double ld;
typedef LL ut;
typedef vector<ut> VI;
typedef pair<ut,ut> pr;
co... | 190 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using pp=pair<int, int>;
int main() {
string a, b;
cin >> a >> b;
string ans = "Alice";
if (b=="1"&& a=="1") {ans="Draw";}
else if (b=="1") {ans="Bob";}
else if (a!="1") {
if (b.size()>a.size()) {ans = "Bob";}
else if (b.size()==a.size()) {
if (a[... | 161 |
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;
cout << (a > b ? "Alice" : a < b ? "Bob" : "Draw") << endl;
}
| 80 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repo(i,N) for(int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
//#define num 1000000007
#define pi acos(-1.0)
//intの最大値2147483647 ... | 232 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
int main()
{
int a,b;
cin>>a>>b;
if(a==1)a=14;
if... | 157 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
vector<string>card(14);
card.at(A)="Alice";
card.at(B)="Bob";
if(A==B){
cout << "Draw" << endl;
}else if((A-1)*(B-1)==0){
cout << card.at(1) << endl;
}else{
cout << card.at(max(A,B)) << endl;
}
} | 109 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
const long long int INF = 1e9;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define Rep(i, n) for(int i... | 253 |
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";
if (a>b) cout<<"Alice";
if (a<b) cout<<"Bob";
return 0;
} | 83 |
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{
cout << "Alice" << endl;
}
}
... | 112 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int a, b;
int main()
{
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a == b){
cout << "Draw";
}else if(a > b){
cout << "Alice";
}else {
cout << "Bob";
}
return 0;
}
| 89 |
Project_CodeNet | 2,017 | #include <iostream>
int main() {
unsigned int a, b;
std::cin >> a >> b;
a -= 2;
b -= 2;
if (a < b) {
std::cout << "Bob" << std::endl;
} else if (a == b) {
std::cout << "Draw" << std::endl;
} else {
std::cout << "Alice" << std::endl;
}
}
| 95 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int A, B;
cin >> A >> B;
if ((A > B && B != 1) || (A == 1 && B != 1))
cou... | 150 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if(A == B) cout << "Draw" << endl;
else{
if(A == 1) cout << "Alice" << endl;
else if(B == 1) cout << "Bob" << endl;
else{
if(A > B) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
}
return 0;
} | 106 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include <vector>
#include <set>
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";
}
| 71 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
/* 大文字を小文字に変換 tolower*/
/* 小文字を大文字に変換 toupper*/
int main () {
int a,b;
cin... | 210 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<time.h>
#include<tuple>
#include<set>
#include<map>
#include<cctype>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define vint vector<int>
#... | 212 |
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 << "Alice" << endl;
}
else if (A == B){
cout << "Draw" << endl;
}
else{
cout << "Bob" << endl;
}... | 111 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if (a==b){cout<<"Draw";}
else if (b==1 && a!=1){cout<<"Bob";}
else if (a==1 && b!=1){cout<<"Alice";}
else if (a>b){cout<<"Alice";}
else if (a<b){cout<<"Bob";}
}
| 84 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if((a+12)%14 > (b+12)%14)cout << "Alice";
else if((a+12)%14 < (b+12)%14)cout << "Bob";
else cout << "Draw";
cout << endl;
return 0;
}
| 87 |
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 cout << (a > b ? "Alice" : "Bob") << endl;
return 0;
} | 102 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a < b) {
cout << "Bob" << endl;
} else if(a == b) {
cout << "Draw" << endl;
} else {
cout << "Alice" << endl;
}
return 0;
} | 101 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw\n";
else if(a>b and b!=1 or a==1)cout<<"Alice\n";
else cout<<"Bob\n";
return 0;
}
| 65 |
Project_CodeNet | 2,019 | #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==b){
cout<<"Draw";
}else if(a==1 || a>b && b!=1){
cout<<"Alice";
}else{
cout<<"Bob";
}
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
using namespace std;
using ll=lo... | 324 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std ;
int main () {
int a , b;
cin >> a >> b ;
if (( b== 1 ) && ((a>=2 && a<=13))){
cout << "Bob";
}
else if (( a== 1 ) && ((b>=2 && b<=13))){
cout << "Alice";
}
else if (a> b){
cout << "Alice";
}
else if (a< b){
cout << "Bob";
}
else {
cout << "Draw" ;
}
retur... | 115 |
Project_CodeNet | 2,020 | /******* all required header files *******/
#include<iostream>
#include<algorithm>
#include<cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <... | 276 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORR(i,a,b) for(int i... | 233 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-1, (i)>=0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9+7;
ll const INF = 1e18;
usin... | 218 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int x,y;
cin >>x >>y;
if(x==1) x=100;
if(y==1) y=100;
if(x>y) cout << "Alice";
else if(x<y) cout << "Bob";
else cout << "Draw";
return 0;
} | 77 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int s[] = { 14, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 };
int a, b;
cin >> a >> b;
if (s[a-1] > s[b-1]) cout << "Alice\n";
else if (s[a-1] < s[b-1]) cout << "Bob\n";
else cout ... | 148 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(int argc, char const *argv[]) {
int a,b;
std::cin >> a >> b;
if (a == b) {
std::cout << "Draw" << '\n';
}
else if (a == 1) {
std::cout << "Alice" << '\n';
}
else if (b == 1) {
std::cout << "Bob" ... | 157 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<cmath>
#include<string>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<map>
#include<set>
#include<limits>
#include<bitset>
#include<array>
#include<numeric>
#include<iomanip>
#include<functional>
using namespace std;
typedef long long int ll;
#define C(I)... | 181 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void){
int a,b,c;
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;
}
| 104 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
int main(void) {
int a, b; cin >> a >> b;
string ans;
if(a==1) a=14;
if(b==1) b=14;
if(a==b) ans = "Draw";
else if(a < b) ans = "Bob";
else ans = "Alice";
... | 117 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw\n";
}
else {
if (A == 1) A = 14;
if (B == 1) B = 14;
cout << (A>B?"Alice":"Bob")<<"\n";
}
return 0;
}
| 105 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned lon... | 210 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <bitset>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | 399 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <cstring>
#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 << "Draw" << endl;
else cout << "Bob" << endl;
}
| 100 |
Project_CodeNet | 2,019 | // One Card Poker
#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\n";
if(a==b) cout<<"Draw\n";
if(a<b) cout<<"Bob\n";
return 0;
} | 85 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
us... | 215 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
#include <numeric>
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;}
... | 112 |
Project_CodeNet | 2,017 | /*
* C++11 code template for contests.
* @author: Andrey Kalendarov
* @e-mail: andreykalendarov@gmail.com
*/
//#pragma GCC optimize ("O3")
//#define ANDREIKKAA_TOPCODER
//#define ANDREIKKAA_ALLOCATOR
#define ANDREIKKAA_CLASS Solution
#define ANDREIKKAA_METHOD solve
#define ANDREIKKAA_PARAMETERS void
#define ANDREIKKAA... | 1,372 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make... | 1,834 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b;
cin >> a >> b;
if(a == 1 || b == 1){
if(a == 1 && b != 1) cout << "Alice" << endl;
if(a != 1 && b == 1) cout << "Bob" << endl;
if(a == 1 && b == 1) cout << "Draw" << endl;
}els... | 198 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
/*
*/
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){//aのb乗をpで割った余り
if(b == 0) return 1;
else if(b%2 == 0){
... | 432 |
Project_CodeNet | 2,017 | /*************************************************************************
> File Name: test.cpp
> Author: Akira
> Mail: qaq.febr2.qaq@gmail.com
************************************************************************/
#include<bits/stdc++.h>
typedef long long LL;
typedef unsigned long long ULL;
typedef... | 264 |
Project_CodeNet | 2,018 | #include <cstdio>
using namespace std;
int main()
{
int a, b;
scanf("%d", &a);
scanf("%d", &b);
if (a>b){
if (b == 1) {
printf("Bob");
}else{
printf("Alice");
}
}else if (a<b){
if (a == 1) {
printf("Alice");
}else{
printf("Bob");
}
}
else if (a==b) printf... | 118 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio( false );
int A, B;
cin >> A >> B;
if( A == 1 ) { A += 13; }
if( B == 1 ) { B += 13; }
cout << (A > B ? "Alice" : (A < B ? "Bob" : "Draw")) << endl;
}
| 91 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);... | 332 |
Project_CodeNet | 2,018 | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char * argv[]) {
// insert code here...
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 c... | 120 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
int a,b;
... | 156 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll,... | 357 |
Project_CodeNet | 2,019 | #include<iostream>
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 << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
int a, b; cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}
else if(a==1){
cout << "Alice" << endl... | 167 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main() {
int a,b;
cin >> a >> b;
if(a==b)
cout << "Draw" << endl;
else if(a!=1&&b!=1){
if(a<b)
cout << "Bob" << endl;
else
cout << "Alice" << endl;
}
else{
if(a==1){
cout << "Al... | 131 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;
while(cin>>a>>b){
if(a==1) a=14;
if(b==1) b=14;
if(a>b) puts("Alice");
else if(a<b) puts("Bob");
else puts("Draw");
}
return 0;
} | 76 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
class A{
public:
void solve(int a,int b){
if(a==1||b==1){
if(a==b)cout<<"Draw"<<endl;
else if(a<b)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
else{
if(a==b)cout<<"Dr... | 136 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
#include<vector>
int main(){
vector<int> x;
x = {13,1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
int a, b;
cin >> a >> b;
if (x[a-1] > x[b-1]){
cout << "Alice" << endl;
}
else if(x[a-1]==x[b-1]){
cout << "Draw" << endl;
}
else {
cout << "Bob" << endl;
... | 138 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std;
int main() {
int A,B;
scanf("%d %d",&A,&B);
if(A==B) printf("Draw");
else if(A>B && B!=1 || A==1) printf("Alice");
else printf("Bob");
return 0;
} | 62 |
Project_CodeNet | 2,019 | #include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <iterator>
#define loop(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define... | 245 |
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;
}
| 100 |
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;
}
else if(b>a){
cout<<"Bob"<<endl;
}
else if(a==b){
cout<<"Draw"<<endl;
}
}
| 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<<"Alice"<<endl;
else if(a<b) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return 0;
} | 74 |
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!=1) cout << "Bob" << endl;
else if(b!=1) cout << "Alice" << endl;
}
else if(a<b) cout << "Bob" << endl;
else if(a>b) cout << "Alice" << endl;
} | 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int strongness(int n) {
return (n + 11) % 13;
}
int main() {
int a, b;
cin >> a >> b;
int sa = strongness(a);
int sb = strongness(b);
string ans;
if (sa > sb) {
ans = "Alice";
} else if (sa == sb) {
ans = "Draw";
} else {
ans = "Bob";
}
c... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A, B;
cin >> A >> B;
if(A == 1){
A = A + 13;
}
if(B == 1){
B = B + 13;
}
if(A > B){
cout << "Alice";
} else if(A == B) {
cout << "Draw";
} else {
cout << "Bob";
}
} | 102 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b; cin >> a >> b;
if(a ==b)
cout << "Draw" << endl;
else if(a==1)
cout << "Alice"<< endl;
else if(b == 1)
cout << "Bob" << endl;
else if(a > b)
cout << "Alice"<< endl;
else if(b >a)
cout << "Bob" << endl;
} | 101 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int score[] = {0, 14, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};
if (A == B) {
cout << "Draw" << endl;
} else if (score[B] < score[A]) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
} | 130 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void)
{
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 << "Bob";}
else{cout << "Alice";}
return 0;
} | 87 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 192 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int arr[20];
int main(){
for(int i=2;i<=13;i++){
arr[i]=i-1;
}
arr[1]=13;
int a,b;
scanf("%d%d",&a,&b);
if(arr[a]>arr[b]){
printf("Alice");
}else if(arr[a]==arr[b]){
printf("Draw");
}else printf("Bob");
} | 90 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) fo... | 318 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main(void)
{
int a,b,flg;
scanf("%d %d",&a,&b);
flg=0;
if(a==b){
printf("Draw\n"); flg=1;
}
else if(a==1&&b>1){
printf("Alice\n"); flg=1;
}
else if(b==1&&a>1){
printf("Bob\n"); flg=1;
}
if(flg==0){
if(a>b) printf("Alice\n");
else printf("Bob\n");
}
return 0;
} | 129 |
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<<"Draw"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
}
| 91 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#... | 245 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
cout << (a == b ? "Draw" : (a < b ? "Bob" : "Alice")) << endl;
return 0;
}
| 101 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
#define inf 1000000000
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define rep1(i, a, b) for(int i =a; i >=b; i--)
#define f fir... | 194 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B) {
if (A == 1) {
cout << "Alice" << endl;
return 0;
}
cout << "Bob" << endl;
} else if (A > B) {
if (B == 1) {
cout << "Bob" << endl;
return 0;
}
cout << "Alice" <... | 138 |
Project_CodeNet | 2,019 | // atcoder/abc054/A/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template<typename... | 456 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
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... | 134 |
Project_CodeNet | 2,018 | #include<iostream>
#include<sstream>
using namespace std;
int main(){
int a, b;
cin >> a >> b ;
if (a == 1 and b != 1){
cout << "Alice" << endl;
}else if (b == 1 and a != 1){
cout << "Bob" << endl;
}else if (a < b){
cout << "Bob" << endl;
}else if (a > b){
cout << "Alice" << endl;
}else{
cout <<... | 129 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repr(i, n) for(int i = (int)(n); i >= 0; i--)
#define repm(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define repmr(i, m, n) for(int i = (int)(n); i >= (int)(m); i--)
#define all(x) (x).begin(),(x).end()
#define inf 2e9
using ... | 247 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
typedef long long ll;
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw";
}
else if(a==1 && b!=1 || b!=1 && a>b)
{... | 108 |
Project_CodeNet | 2,017 | #include <cstdlib>
#include <iostream>
int
main()
{
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int a, b;
std::cin >> a >> b;
auto x = (a + 11) % 13;
auto y = (b + 11) % 13;
std::cout << (x > y ? "Alice" : x < y ? "Bob" : "Draw") << std::endl;
return EXIT_SUCCESS;
}
| 109 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#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<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Draw"<<endl;
return 0;
}
| 79 |
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(A<B){
cout<<"Bob"<<endl;
}
else if(B==1){
cout<<"Bob"<<endl;
}
else if(A>B){
cout<<"Alice"<<endl;
}
} | 104 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b;
if(a>b){
c=1;
if(b==1){
c=2;
}
}else if(a<b){
c=2;
if(a==1){
... | 153 |
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(b>a) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return 0;
}
| 82 |
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;
} | 94 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
a = (a + 11) % 13;
b = (b + 11) % 13;
if (a > b)
puts("Alice");
else if (a < b)
puts("Bob");
else
puts("Draw");
} | 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <iomanip>
using namespace std;
int main()
{
int a, b; cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1 && b != 1)
cout << "Alice" << endl;
else if (b == 1 && a != 1)
cout << "Bob" << endl;
else if (a > ... | 135 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,... | 364 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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" << endl;
} else if(a > b){
cout << "Alice" << endl;
} else {
co... | 138 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(... | 698 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main()
{
int a, b, i;
scanf("%d %d",&a,&b);
if((a==1&&b!=1)||a>b&&b!=1)
{
printf("Alice\n");
}
else if((b==1&&a!=1)|| b>a&&a!=1)
{
printf("Bob\n");
}
else
{
printf("Draw\n");
}
} | 88 |
Project_CodeNet | 2,019 | #include<iostream>
#include<vector>
#include<bitset>
#include<string>
#include<cmath>
#include<algorithm>
#include<stack>
#include<list>
#include<queue>
#include<map>
using namespace std;
int INF=1e9;
int main(){
int A,B;
cin>>A>>B;
int x=A-B;
if(A!=1&&B!=1){
if(x>0){
cout<<"Alic... | 189 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a += 20;
if (b == 1) b += 20;
if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << en... | 111 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
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"<... | 110 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if (a==1&&b==1){
a = 14;
b = 14;
}else if(a==1){
a = 14;
}else if(b==1){
b = 14;
}
if (a>b){
cout << "Alice";
}else if(a<b){
cout << "Bob";
}else{
cout << "Draw";
}
} | 113 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.