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;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
#define FOR(i, begin, end) for(int i... | 298 |
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 || ( b != 1 && a > b))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
} | 86 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
using namespace std;
#define COUT(v) cout<<(v)<<endl
#define CIN(n) int(n);cin >> (n)
#define LCIN(n) LL(n);cin >> (n)
#define SCIN(n) string(n);cin >> (n)
#define YES(n) cout<<((n)? "YES" : "NO")<<endl
#de... | 475 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define rp(i,n) for(int i=0;i<n;i++)
#define rep(i,m,n) for(int i=m;i<=n;i++)
#define lrp(i,n) for(long long i=0;i<n;i++)
#define lrep(i,m,n) for(long long i=m;i<=n;i++)
#define mrp(i,n) for(int i=n-1;i>=0;i--)
#define mrep(i,m,n) for(int i=m;i>=n;i--)
#define mlrp(i,n) for(... | 275 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a == 1 && b == 1) cout << "Draw";
else 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 0;
}
| 104 |
Project_CodeNet | 2,019 | //--https://kenkoooo.com/atcoder/#/table/soma62jp
#include <iostream>
#include <string>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
int main(int argc, char* argv[])
{
int A,B;
int a,b;
cin >> A >> B;
a=A;b=B;
if(a==1) a=14;
if(b==1) b=14;
if(a-b>0){
cout << "Al... | 149 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b)
cout << "Alice";
if (a < b)
cout << "Bob";
if (a == b)
cout << "Draw";
}
| 103 |
Project_CodeNet | 2,017 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 514 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a==1) a+=15;
if (b==1) b+=15;
if (a==b) cout << "Draw\n";
else if (a>b) cout << "Alice\n";
else if (b>a) cout << "Bob\n";
// your code goes here
return 0;
} | 92 |
Project_CodeNet | 2,017 | #include<cstdio>
using namespace std;
int main(){
int a, b; scanf("%d %d", &a, &b);
int s[14]; s[1] = 13;
for(int i = 2; i <= 13; i++) s[i] = i - 1;
if(s[a] > s[b]) puts("Alice");
if(s[a] < s[b]) puts("Bob");
if(s[a] == s[b]) puts("Draw");
return 0;
} | 105 |
Project_CodeNet | 2,017 | // think twice code once
// Start:[]
// End :[]
/*{{{*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for(int i = (x), _ = (y); i <= _; ++ i)
#define per(i, x, y) for(int i = (x), _ = (y); i >= _; -- i)
#define dprintf(...) fprintf(stderr, __VA_ARGS__)
#define disp(x) cout << #x << " = " << x << ... | 373 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c, d;
int l[13] = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1};
cin >> a >> b;
for (int tmp = 0; tmp < 2; tmp++){
for (int tmp2 = 0; tmp2 < 13; tmp2++){
if (l[tmp2] == a){
c = tmp2;
... | 209 |
Project_CodeNet | 2,020 | /*
author : nishi5451
created: 11.08.2020 00:15:27
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if(a==1) a=14;
if(b==1) b=14;
if(a>b) cout << "Alice" << endl;
else if(a==b) cout <... | 138 |
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 > B && B != 1) || A == 1)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
} | 81 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
a = (a+11)%13;
b = (b+11)%13;
if (a>b) cout << "Alice" << endl;
else if (a<b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
} | 83 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<string>
#include<vector>
#include<set>
using namespace std;
int main(void){
ios::sync_with_stdio(false); cin.tie(0);
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;
el... | 106 |
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) {
cout << "Alice" << endl;
}
else if (b == 1) {
cout << "Bob" << endl;
}
else if (a > b) {
cout << "Alice" << endl;
}
else if (a < b) {
cout << "Bob" << end... | 123 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define X first
#define Y second
#define pb push_back
#define max_el(x) max_element(x.begin(),x.end())-x.begin()
#define min_el(x) min_element(x.begin(),x.end())-x.begin()
#define mp make_pair
#define endl '\n'
#define fastread ios_base::sync_with_std... | 236 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main(int argc, char *argv[]) { ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int a,b;cin>>a>>b;
if(a==b){
cout<<"Draw"<<endl;
}else if (a==1){
cout<<"Alice"<<endl;
} else if (b==1){
c... | 136 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#define INF 2147483647
#define lli long long int
using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
int main() {
int a,b; cin >> a >> b;
vi N = {13,1,2,3,4,... | 173 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
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 {
... | 123 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) fo... | 637 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<int> s = {0, 14, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};
if(s.at(a) > s.at(b)) cout << "Alice" << endl;
if(s.at(a) < s.at(b)) cout << "Bob" << endl;
if(s.at(a) == s.at(b)) cout << "Draw" << endl;
} | 128 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <cstring>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int MOD = 1000000007;
int main() {
int N, M; c... | 181 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <string>
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 cout << "Draw" <<endl;
return 0;
} | 100 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
scanf("%d%d",&x,&y);
if(x==y)printf("Draw");
else if(x==1)printf("Alice");
else if(y==1)printf("Bob");
else if(x>y)printf("Alice");
else if(x<y)printf("Bob");
return 0;
}
| 88 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
if (a == 1 && b != 1) cout << "Alice";
else if (b == 1 && a != 1) cout << "Bob";
else {
if (a == b) cout << "Draw";
else {
if (a > b) cout << "Alice";
else cout << "Bob";
}
}
}
return 0;
} | 113 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int A,B;
cin >> A >>B;
if((A>=2 && A<=13) && (B>=2 && B<=13)){
if(A==B){
cout << "Draw" << endl;
}else if(A<B){
cout << "Bob" << endl;
}else if(A>B){
cout << "Alice" << endl;
}
}else if(A==1 && (B>=2 && B<=13)){
cout << "Alice" << endl;
}else if((A>=2 && A<=... | 157 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
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;
}
| 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)cout << "Alice" << endl;
else if(b == 1)cout << "Bob" << endl;
else if(a>b)cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 100 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b)cout << "Draw" << endl;
else if (a == 1)cout << "Alice" << endl;
else if (b == 1)cout << "Bob" << endl;
else if (a > b)cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 100 |
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;
}
} | 110 |
Project_CodeNet | 2,018 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>... | 590 |
Project_CodeNet | 2,019 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include<complex>
#include <cassert>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i+... | 277 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long int i=0;i<n;++i)
typedef long long int ll;
int main(){
int a,b;
cin >> a >>b;
if(a==b){
cout << "Draw" << endl;
}else if(a==1){
cout << "Alice" << endl;
}else if(b==1){
cout << "Bob" << endl;
}... | 134 |
Project_CodeNet | 2,020 | /*
Author: ankrypt
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll l... | 761 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
int main() {
int A, B;
std::cin >> A >> B;
if (A == 1) {
A = 14;
}
if (B == 1) {
B = 14;
}
if (A > B) {
std::cout << "Alice\n";
} else if (A < B) {
std::cout << "Bob\n";
} else {
std::cout << "Draw\n";
}
re... | 117 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a = (a + 12) % 13;
if (a == 0) {
a = 13;
}
b = (b + 12) % 13;
if (b == 0) {
b = 13;
}
if (a > b) {
cout << "Alice" << endl;
}
else if (a == b) {
cout << "Draw" << endl;
}
else {
cout << "Bob" << endl;
}
} | 132 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
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,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<<"Alice"<<endl;
if(B>A)cout<<"Bob"<<endl;
if(A==B)cout<<"Draw"<<endl;
return 0;
} | 85 |
Project_CodeNet | 2,019 | #include <iostream>
#include <map>
using namespace std;
int main(){
map<int , int> m;
m[1] = 13;
m[2] = 1;
m[3] = 2;
m[4] = 3;
m[5] = 4;
m[6] = 5;
m[7] = 6;
m[8] = 7;
m[9] = 8;
m[10] = 9;
m[11] = 10;
m[12] = 11;
m[13] = 12;
int a, b;
cin >> a >> b;
string ans = "";
if(m[a] == m[b])... | 200 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <ctype.h>
#include <map>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <cctype>
#include <queue>
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define REP1(j,n) for(int j=0;j<(int)n;++j)
#define REPD(i,n) for(int i=n;i... | 324 |
Project_CodeNet | 2,018 | #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 itrfor(itr,A) for(auto itr = A.begin(); itr !=A.end();itr++)
typedef long long llong;
char moji[26]={'a','b','c','d','e','f','g','h'... | 337 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1)
A += 13;
if (B == 1)
B += 13;
if (A > B)
cout << "Alice" << endl;
else if (A == B)
cout << "Draw" << endl;
else
cout << "Bob" << endl;
return 0;
}
| 105 |
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 ) puts("Alice");
else if ( a==b ) puts("Draw");
else puts("Bob");
return 0;
} | 83 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tr... | 866 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
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){
cout << "Bob" << endl;
}else if(a==b){
cout << "Draw" << endl;
}else if(a>b){
cout << ... | 134 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define LL long long
#define FOR(i,c) for(__typeof(c.begin()) i = c.begin(); i != c.end(); i++)
#define F first
#define S second
using namespace std;
const LL mod = 1e9 + 7;
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 ... | 508 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char ** argv){
int a,b;
cin>>a>>b;
if( a == 1 && b == 1 ){
cout<<"Draw\n";
return 0;
}else if( a == 1 && b != 1){
cout<<"Alice\n";
return 0;
}else if( a != 1 && b == 1 ){
cout<<"Bob\n";
return 0;
}
if(a > b) cout<<"Alice\... | 138 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <array>
#include <tuple>
#... | 295 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw"<<endl;
else if(b==1)
cout<<"Bob"<<endl;
else if(a==1)
cout<<"Alice"<<endl;
... | 116 |
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;
}... | 117 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 331 |
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 || (b != 1 && a > b))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
}
//system("pause");
return 0;
} | 92 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin>>a>>b;
string ret;
if(a==b)ret="Draw";
else if((a>b&&b!=1)||a==1)ret="Alice";
else ret="Bob";
cout<<ret<<endl;
} | 70 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1){
a =14;
}
if(b == 1){
b =14;
}
if (a > b){
cout << "Alice" << endl;
}else if(a < b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
return 0;
} | 105 |
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 || b == 1){
if(a == 1){
cout << "Alice" << endl;
}else if(b == 1){
cout << "Bob" << endl;
}
}else if(b < a){
... | 126 |
Project_CodeNet | 2,019 | #include<iostream>
#include<algorithm>
using namespace std;
int main(void){
long long 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;
} | 99 |
Project_CodeNet | 2,020 | #define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define rrep(i,n) for(ll i##_len=(n) ,i=i##_len-1;i>=0;--i)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define fe(vec,lambda) std::for_each(vec.begin(), vec.end(), lambda );
#define printd(val) std::cout<< #val" = " <<val<<"\n";
#define printv(val) std::for... | 555 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <map>
#include <queue>
#include <iomanip>
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vp... | 454 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a > b || a == 1) && (a != b && b != 1 )) {
cout << "Alice" << endl;
}
else if ((b > a || b == 1) && (a != b && a != 1)) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl... | 115 |
Project_CodeNet | 2,020 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.14159265358979323846264338327950288419716939937... | 1,718 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b,c=-1,d=-1,e[]={2,3,4,5,6,7,8,9,10,11,12,13,1};
cin>>a>>b;
for(int i=0;i<=12;i++){
c=(a==e[i]?i:c);
d=(b==e[i]?i:d);
}
if(c>d)cout<<"Alice";
else if(c<d)cout<<"Bob";
else if(c==d)cout<<"Draw";
return 0;
}
| 126 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >>b;
if(a == 1 && b != 1)cout << "Alice" << endl;
else if(b == 1 && a != 1)cout << "Bob" << endl;
else if(a > b)cout << "Alice" << endl;
else if(a < b)cout << "Bob" << endl;
else cout << "Draw" << endl;
return... | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if (A !=1 && B !=1){
if (A<B){
cout << "Bob" << endl;
}
else if(A>B){
cout << "Alice" << endl;
}
else {
cout << "Draw" << endl;
}
}
else if (A ==1 && B ==1){
cout << "Draw" << endl;
}
el... | 150 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a,b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else {
if(a == 1) cout << "Alice" << endl;
else if(b == 1) cout << "Bob" << endl;
else if(a > b) cout... | 133 |
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,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int p[] = {14, 2,3,4,5,6,7,8,9,10, 11, 12, 13};
if (p[a-1] - p[b-1] > 0)
cout << "Alice" << endl;
else if (p[b-1] - p[a-1] > 0)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
} | 131 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
const long long INF = LLONG_MAX / 2;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ll long long int
#define ALL(x) x.begin(),x.end()
using namespace std;
ll ans = 0, sum = 0, n, k, ... | 279 |
Project_CodeNet | 2,019 | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
t... | 1,424 |
Project_CodeNet | 2,019 | #include <cstdio>
using namespace std; //This makes the code much more cleaner
int main()
{
/*
int a, b, c, d;
scanf("%d %d %d %d",&a,&b,&c,&d);
int area = a*b;
int areatwo = c*d;
if (area>=areatwo)
{
printf("%d", area);
}
else
{
printf("%d",areatwo);
}
*/
int a,b;
scanf("%d %d", &a, &b);... | 211 |
Project_CodeNet | 2,017 |
#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 && b > a) {
cout << "Alice" << endl;
}
else if(b == 1 && a > b) {
cout << "Bob" << endl;
}
else if(a > b) {
cout << "Alice" << endl;
}
else if... | 162 |
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"<<endl;
... | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 313 |
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 ( b > a ){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
... | 120 |
Project_CodeNet | 2,017 | #include <iostream>//cin/cout/wcin/wcout/left/right/internal/dec/hex/oct/fixed/scientific
#include <string>//stoi/stol/stoul/stoll/stoull/stof/stod/stold/to_string/getline
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
a = (a+11)%13;
b = (b+11)%13;
if (a > b) { cout << "Alice\n"; }
... | 144 |
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;
}
}
| 107 |
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 << "Alice";
else if (A < B)
cout << "Bob";
else
cout << "Draw";
cout << endl;
} | 96 |
Project_CodeNet | 2,019 | #include <cstdio>
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (A == 1) A += 13;
if (B == 1) B += 13;
if (A < B) {
puts("Bob");
} else if (B < A) {
puts("Alice");
} else {
puts("Draw");
}
} | 93 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A , B ;
cin >> A >> B ;
if (( A == 1 ) && ( B != 1 ))
cout << "Alice" ;
else if (( B == 1) && ( A != 1 ))
cout << "Bob" ;
else if ( A > B )
cout << "Alice" ;
else if ( A < B )
cout << "Bob" ;
... | 120 |
Project_CodeNet | 2,019 | //file_name:ABC54_A.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define max... | 833 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main () {
int A, B;
cin >> A >> B;
if (A != 1 && B!= 1) {
if (A > B) cout << "Alice" << endl;
else if (A < B) cout << "Bob" << endl;
else cout << "Draw" << endl;
}
else if (A == 1 && B == 1) cout << "Draw" << endl;
else if (A == 1) cout << "Alic... | 136 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
typedef double ld;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF =... | 192 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void) {
int A,B;cin>>A>>B;
if (A == B) {
cout << "Draw" << endl;
return 0;
}
if (A > B) {
if (B == 1) cout << "Bob" << endl;
else cout << "Alice" << endl;
} else {
if (A == 1) cout << "Alice" << endl;
... | 120 |
Project_CodeNet | 2,018 | #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;
}
| 93 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, FN) for(int i = 0; i < ( FN ); i++)
int main() {
int a, b;
cin >> a >> b;
if(a == b) {
cout << "Draw\n";
} else if( ( a > b && b != 1 ) || a == 1) {
cout << "Alice\n";
} else cout << "Bob\n";
ret... | 113 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin >> a >> b;
if(a!=b && a==1) cout << "Alice" << "\n";
else if(a!=b && b==1) cout << "Bob" << "\n";
else if(a==b) cout << "Draw" << "\n";
else if(a>b) ... | 137 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
/* short names and const
using ll = long long;
using vll = vector<long long>;
using df = vector<vector<long long>>;
df data(n, vector<long long>(m));
const int MOD = 1e9 + 7;
const long long INF = 1e18;
*/
/* Boost!
#include <b... | 426 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
using namespace std;
void solve(){
int a, b; cin >> a >> b;
if(a == 1){
if(b == 1) cout << "Draw\n";
else cout << "Alice\n";
}
else if(b == 1){
cout << "Bob\n";
}
else if... | 150 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
int main(){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a==b)puts("Draw");
else if(a<b)puts("Bob");
else puts("Alice");
return 0;
}
| 83 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
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(a<b)cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 95 |
Project_CodeNet | 2,020 | #include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a == b) std::cout << "Draw" << std::endl;
else if (a > b) std::cout << "Alice" << std::endl;
else std::cout << "Bob" << std::endl;
return 0;
}
| 114 |
Project_CodeNet | 2,017 |
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
//setbase - cout << setbase (16); cout << 100 << endl; Prints... | 406 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int strength[14]={-1,13,1,2,3,4,5,6,7,8,9,10,11,12};
int main(){
int A,B;
cin>>A>>B;
if(strength[A]>strength[B])cout<<"Alice"<<"\n";
else if(strength[A]<strength[B])cout<<"Bob"<<"\n";
else cout<<"Draw"<<"\n";
return 0;
}
| 108 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
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" << ... | 141 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A != 1 && B != 1 && A > B) {
cout << "Alice" << endl;
} else if (A != 1 && B != 1 && A < B) {
cout << "Bob" << endl;
} else if (B == 1 && A > B) {
cout << "Bob" << endl;
} else if (B == 1 && A < B) {
... | 203 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i, n) for(long long i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb... | 226 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a==b) cout<<"Draw"<<endl;
else cout<<(a>b?"Alice":"Bob")<<endl;
}
| 69 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 13;
}
else {
a -= 1;
}
if (b == 1) {
b = 13;
}
else {
b -= 1;
}
if (a > b) {
cout << "Alice" << endl;
}
else if (a == b) {
cout << "Draw" << endl;
}
else {
cout << "Bob" << endl;
}
} | 128 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
void ABC50(void);
void ABC52(void);
void ABC53(void);
void ABC54(void);
void ABC55(void);
void ABC56(void);
void ABC57(void);
void ABC58(void);
void ABC59(void);
int main(void){
ABC54();
return 0;
}
void ABC54(void){
int a,b;
cin>>a>>b;
if(a==1)a=14;
if... | 134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.