Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
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;
} | 87 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#ifdef DEBUG
#include "_debug.cpp"
#include "callable.hpp/callable.hpp"
#endif
#define endl '\n'
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a... | 154 |
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 (b>a){
cout<<"Bob";
}
else {
cout<<"Draw";
}
}
| 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;//int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,i... | 269 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | 224 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a == b){
cout << "Draw";
return 0;
}
if(a == 1){
a = 14;
}
if(b == 1){
b = 14;
}
if(a > b){
cout << "Alice";
}else{
cout << "Bob";
}
}
| 98 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ll long long
#define PRIME 1000000007
using namespace std;
vector<bool> isprime(1000001, true);
void sieve()
{
for(int i=2;i*i<=1000001;i++)
{
if(isprime[i]==true)
{
for(int j=(i+i);j<=1000001;j=j+i)
{
isprime[j]=false;
}
}
}
}
int main()
{
ios_base::sync_with_std... | 199 |
Project_CodeNet | 2,018 | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | 146 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <iomanip>
#include <math.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;... | 128 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vl = vector<ll>; ... | 392 |
Project_CodeNet | 2,017 | # include <iostream>
# include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1 || b == 1) {
if (a == 1 && b != 1) {
cout << "Alice" << endl;
}
else if (a != 1 && b == 1) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
}
else {
if (a > b) {
cout <... | 173 |
Project_CodeNet | 2,019 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_CAT_I(x,y) x ## y
//#define CPP_STR(x) CPP_STR_I(x)
//#define CPP_STR_I(args...) #args
//#define ASSERT(expr...) assert((expr))
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = ui... | 895 |
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 << "Draw" << endl;
}else if(A > B ){
cout << "Alice" << endl;
}else if(A < B ){
cout << "Bob" << endl;
}
return 0;
}
| 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin >> A >> B;
if(A == B) cout << "Draw" << endl;
else if((A > B && B != 1) || A == 1) cout << "Alice" << endl;
else if((A < B && A != 1) || B == 1) cout << "Bob" << endl;
}
| 97 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
template<class like_bool> inline void YES(like_bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class like_bool> inline void Yes(like_bool condition){ if(condition) cout << "Yes" ... | 570 |
Project_CodeNet | 2,019 | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <limits.h>
#include <map>
#include <numeric>
namespace test {
std::string to_string (char val) {
return std::string (1, val);
// return std... | 180 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int A,B; cin >... | 180 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int x , y ;cin>>x>>y;
if( x==y )cout<<"Draw"<<endl;
else{
if( x==1 )cout<<"Alice"<<endl;
else
if( y==1 )cout<<"Bob"<<endl;
else
if( x>y )cout<<"Alice"<<endl;
else
if( x<y )cout<<"Bob"<<endl;
}
return 0;
}
| 109 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A; int B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
} else if (A == 1 || A > B && B != 1 ){
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
} | 87 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a,b,c[13],i;
int main(){
cin>>a>>b;
for(i=0;i<12;++i){
c[i]=i+2;
}
c[12]=1;
for(i=0;i<13;++i){
if(a == c[i]){
a = i;
break;
}
}
for(i=0;i<13;++i){
if(b == c[i]){
b = i;
break;
}
}
if(a>b){
cout<<"Alice"<... | 158 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
int A,B;
cin>>A>>B;
if (A==1 || B==1){
if (A==B){
cout<<"Draw"<<endl;
}else if (A<B){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
}
if (A==B){
cout<<"Draw"<<endl;
}else if (A>B){
cout<<"Alice"<<endl;
... | 132 |
Project_CodeNet | 2,020 |
//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1,... | 558 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int numa, numb;
cin >> numa >> numb;
numa += 11;
numb += 11;
numa %= 13;
numb %= 13;
if(numa > numb){
cout << "Alice\n";
}else if(numa < numb){
cout << "Bob\n";
}else{
cout << "Draw\n";
}
re... | 99 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if (A > B && B != 1){
cout << "Alice" << endl;
}else if(A < B && A != 1){
cout << "Bob" << endl;
}else if(A == 1 && B != 1){
cout << "Alice" << endl;
}else if(B == 1 && A != 1){
cout << "Bob" << endl;
}else{
... | 134 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
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";
}
else {
if(a == b) {
cout << "Draw\n";
}
els... | 116 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define OUT(x) std::cout << (x) << std::endl
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" << end... | 170 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,m,n) for(ll i=m;i<(ll)(n);i++)
typedef pair<int,long long> pint;
typedef long long ll;... | 226 |
Project_CodeNet | 2,020 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | 552 |
Project_CodeNet | 2,019 | #include <cstdio>
int main(){
int A, B;
scanf("%d%d", &A, &B);
if(A==B) printf("Draw\n");
else if((A+11)%13>(B+11)%13) printf("Alice\n");
else printf("Bob\n");
return 0;
} | 70 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | 327 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i ,n) for(int i = 1 ; i <=(n) ; i ++ )
#define all(x) (x).begin(),(x).end()
using ll = long long;
using namespace std;
double pi=3.141592;
int main() {
int a,b;
cin>>a>>b;
if(a==1||b==1){
if(a==1&&b==1) cout<<"Draw"<<endl;
else if(a!=1) cout<<... | 174 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long (i)=0;(i)<(n);(i)++)
#define ll long long
#define pr_qu priority_queue
#define vec(name,size,common) vector<ll> (name)((size),(common))
int main(){
int a,b;
cin>>a>>b;
if(a==1){
a=100;
}
if(b==1){
b=100;
}
if(... | 135 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
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)
... | 140 |
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 << "Draw" << endl;
else if(A>B) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 86 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int CardStrength(int num)
{
return (num == 1 ? 20 : num);
}
int main()
{
int a, b;
cin >> a >> b;
auto strength_a = CardStrength(a);
auto strength_b = CardStrength(b);
if (strength_a > strength_b) {
cout << "Alice\n";
} else if (strength_... | 119 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
scanf("%d%d",&A,&B);
if (A==1) A=14;
if (B==1) B=14;
if (A==B) printf("Draw\n");
else printf("%s\n",A>B?"Alice":"Bob");
}
| 78 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<vector>
#include<string.h>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<cmath>
#include<random>
#include<set>
#include<queue>
using namespace std;
long long dp[3][100100] = {};
const long long INF = 1LL ... | 1,077 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a == 1){
if(b != 1){
cout << "Alice" << endl;
}
else{
cout << "Draw" << endl;
}
}
else if(b == 1){
cout << "Bob" << endl;
}
else if(a>b){
... | 142 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i,n) for(int i=0;i<n;... | 257 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
string ans;
if (a == b) ans = "Draw";
else {
if (a == 1) ans = "Alice";
else if (b == 1) ans = "Bob";
else if (a < b) ans = "Bob";
else if (a > b) ans = "Alice";... | 121 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <set>
#include <regex>
using namespace std;
int main () {
int n, m;
cin >> n >> m;
n = (n!=1 ? n-1 : 13);
m = (m!=1 ? m-1 : 13);
cout << (n == m ? "Draw" : (n > m ? "Alice" : "Bob")) << endl;
} | 96 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int a,b;
int main() {
cin >> a >> b;
if (a == b)
{
cout << "Draw" << endl;
}
else if(a == 1){
cout << "Alice" << endl;
}
else if(b == 1){
cout << "Bob" << endl;
}
else if(a > b){
cout << "Alice" << endl;
}
else if(b > a){
cout ... | 123 |
Project_CodeNet | 2,020 | #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 << "Draw" << endl;
else if (a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 101 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<string> s = {
"2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12", "13", "1"
};
string a, b;
cin >> a >> b;
int ai = distance(s.begin(), find(s.begin(), s.end(), a));
int bi = distance(s.begin(), find(s.begin(), s.e... | 160 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main () {
int a,b;
cin >> a >> b;
if (a>b && b!=1) cout << "Alice" << endl;
else if (b>a && a!=1) cout << "Bob" << endl;
else if (a==1 && a<b) cout << "Alice" << endl;
else if (b==1 && b<a) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;... | 118 |
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\n";
else if (A < B) cout << "Bob\n";
else cout << "Draw\n";
return 0;
}
| 95 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d,x,y=0,n;
char s[100];
cin>>a>>b;
if(a==b)
cout<<"Draw"<<endl;
else if(a==1)
cout<<"Alice"<<endl;
else if(b==1)
cout<<"Bob"<<endl;
else if(a>b)
cout<<"Alice"<<endl;
else if(a<b)
cout<<"Bob"<<endl;
return(0);
... | 112 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int s[13]={13,1,2,3,4,5,6,7,8,9,10,11,12};
if(a==b){
cout << "Draw";
}else if(s[a-1]>s[b-1]){
cout << "Alice";
}else{
cout << "Bob";
}
}
| 102 |
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(){
int a,b;
cin >> a >> b;
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a == b) puts("Draw");
if(a > b) puts("Alice");
if(a < b) puts("Bob");
return 0;
}
| 116 |
Project_CodeNet | 2,019 | // In The Name Of Allah
// Mehrkish Makuei
#include <bits/stdc++.h>
#define pb push_back
#define debug1(x) cerr << #x << " : " << x << endl;
#define debug2(x, y ) cerr << #x << " : " << x << " " << #y << " : " << y << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
type... | 335 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) //for文マクロ
using namespace std;
typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア タイプでふ
int main()
{
int A, B;
cin >> A >> B;
if (A == B)
{
cout << "Draw";
}
else if (A - 1 > 0 && B - 1 > 0... | 197 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <locale>
#include <iostream>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include ... | 477 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#define int long long
#define MAX(a,b) ((a) > (b)) ? (a) : (b)
#define MIN(a,b) ((a) < (b)) ? (a) : (b)
using namespace std;
signed main()
{
int a, b;
cin >> a >> b;
if (a == 1) a = 20;
... | 172 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
string result;
if (a == b)
{
result = "Draw";
}
else
{
if (a == 1 || b == 1)
{
result = (a == 1)? "Alice" : "Bob";
}else
{
result = (a> b)? "Alice... | 114 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; ++i)
#define all(a) (a).begin(), (a).end()
int A, B;
int main() {
cin >> A >> B;
if (A == B) {
cout << "Draw";
} else if (A == 1) {
cout << "Alice";
} else if (B == 1) {
cout << "Bob"... | 157 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
... | 337 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repo(i,o,n) for(int i=o;i<n;i++)
#define repm(i,n) for(int i=n-1;i>=0;i--... | 275 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a==1||b==1){
if(a==1&b!=1){
printf("Alice");
}
else if(a!=1&b==1){
printf("Bob");
}
else{
printf("Draw");
}
}
else{
if(a>b){
printf("Alice");
}
else if(a<b){
printf("Bob");
}
... | 134 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
int main(){
int a, b;
std::cin>>a>>b;
std::string ans;
if(a == b){
ans = "Draw";
}else if(a == 1 || (a > b && b != 1)){
ans = "Alice... | 122 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll 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; }
} | 110 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#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 << "Alice" << endl;
}
else if (a < b) {
cout << "Bob" <<... | 128 |
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 << "Draw" << endl;
else if (A > B) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 97 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == 1) A += 13;
if(B == 1) B += 13;
if(A > B)
cout << "Alice" << endl;
else if(A < B)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
} | 94 |
Project_CodeNet | 2,020 | #include <iostream>
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?"Bob":"Draw")<<endl;
}
| 61 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
int a,b;
cin>>a>>b;
if (a==b){
cout<<"Draw";
}
a=a==1?14:a;
b=b==1?14:b;
if (a>b){
cout<<"Alice";
}
else if (a<b){
cout<<"Bob";
}
return 0;
} | 111 |
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 << ... | 125 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define inf 1000000100
int main()
{
int a, b;
cin >> a >> b;
if(a!= 1 && b!= 1)
{
if(a > b)
{
cout << "Alice" << endl;
}
else if (a < b)
{
... | 210 |
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;
return 0;
} | 99 |
Project_CodeNet | 2,017 | #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>
#in... | 464 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i,from, to) for(lli i=from;i<to;i++)
#define REPE(i,from, to) for(lli i=from;i<=to;i++)
#define REP_R(i,from, to) for(lli i=from;i>to;i--)
#define REPE_R(i,from, to) for(lli i=from;i>=to;i--)
#define REPIT(it,container) for(auto it = container.begin... | 604 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, x);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { r... | 250 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <cmath>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<string> VS;
//container util
#define SORT(c) sort((c).begin(),(c).end())
//repetition
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
int A, B; ci... | 164 |
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 << "Draw" << endl;
}
else if (a > b)
{
cout << "Alice" << endl;
}
else
... | 127 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
// #define DEBUG
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be() , (a).en()
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++) //repeat n times
#define REP2(i,s,n)... | 2,481 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long
int main() {
int A, B;
cin >> A >> B;
i... | 153 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
bool ch(int a,int b){
if (a==2){
return 0;
}
if (b==2){
return 1;
}
if (a==1){
return 1;
}
if (b==1){
return 0;
}
return (a>b);
}
int main(){
int a,b;
cin >> a >> b;
if (a==b){
cout << "Draw"<<endl;
return 0;
}
if (ch(a,b)==1)cout<<"Alice"<<endl;
else ... | 135 |
Project_CodeNet | 2,017 | #include <iostream>
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;
return 0;
}
| 90 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b,tmp;
string res;
cin >> a >> b;
tmp = (a+11)%13-(b+11)%13;
if(tmp>0) res = "Alice";
else if(tmp==0) res = "Draw";
else res = "Bob";
cout << res << endl;
} | 81 |
Project_CodeNet | 2,020 | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x... | 365 |
Project_CodeNet | 2,018 | #include <stdio.h>
#include <stdlib.h>
int main(void){
int a, b;
scanf("%d %d", &a, &b);
if (a == 1) a = a + 13;
if (b == 1) b = b + 13;
if (a > b) printf("Alice");
else if (a == b) printf("Draw");
else printf("Bob");
return 0;
}
| 98 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;... | 226 |
Project_CodeNet | 2,020 | #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;
}
}
if(b>a){
if(a==1){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
if(a==b){
... | 118 |
Project_CodeNet | 2,017 | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#define REP(i, N) for(int i = 0; i < N; ++i)
#define REEP(i, N) for(int i = N - 1; i >= 0; --i)
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == B) {
cout << "... | 195 |
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... | 142 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LO... | 572 |
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";
else
if(a<b)
cout<<"Bob";
else
cout<<"Draw";
}
| 78 |
Project_CodeNet | 2,017 | #include <cstdio>
int a, b;
int main(){
scanf("%d %d", &a, &b);
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a < b) printf("Bob\n");
else if(a == b) printf("Draw\n");
else printf("Alice\n");
} | 74 |
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;
}
| 102 |
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(a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 97 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw";
else if(a<b&&a!=1)
cout<<"Bob";
else if(b<a&&b!=1)
cout<<"Alice";
else if(a==1)
cout<<"Alice";
else if(b==1)
cout<<"Bob";
} | 94 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
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";
... | 97 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1&&b==1){
cout<<"Draw"<<endl;
}
else if(a==1){
cout<<"Alice"<<endl;
}
else if(b==1){
cout<<"Bob"<<endl;
}
else if(a>b){
cout<<"Alice"<<endl;
}
else if(a<b){
cout<<"Bob"<<endl;
}
else if(a==b){
cout<<"Draw"<<endl;... | 115 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#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(B>A)
cout << ... | 102 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <algorithm>
#include <chrono>
using namespace std;
using namespace std::chrono;
int main() {
auto start = high_resolution_clock::now();
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int a, b;
cin >> a >> b;
a += 13 * (a == 1);
b += 13 * (b == 1);
... | 169 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int a,b;
cin>>a>> b;
if(a==b){cout<<"Draw"<<endl;return 0;}
if(a==1 || (a>b && b!=1)){cout<<"Alice"<<endl;}
else{
cout<<"Bob"<<endl;
}
return 0;
} | 81 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
string ans;
if(A==B) ans="Draw";
else if(A==1) ans="Alice";
else if(A>B&&B!=1) ans="Alice";
else ans="Bob";
cout<<ans<<endl;
} | 80 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | 321 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define modulo ll (1e9 + 7)
typedef long long ll;
typedef pair<int,int> pii;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const int N = 1e5 + 9, M = 2e3 + 9, OO = 0x3f3f3f3f;
const ll llOO = 0x3f3f3f3f3f3f3f3f;
int main(... | 195 |
Project_CodeNet | 2,020 | #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 << "Alice";
... | 119 |
Project_CodeNet | 2,019 | #include<stdio.h>
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\n");
}
else if(B>A){
printf("Bob\n");
}
else{
printf("Draw\n");
}
return 0;
} | 87 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.