Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | 1,086 |
Project_CodeNet | 2,019 | #include <cstring>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(ll i = ... | 379 |
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;
} | 101 |
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;
}
return 0;
}
| 95 |
Project_CodeNet | 2,017 | #include<iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
int a,b;
int main(){
while (~scanf("%d%d", &a,&b)){
if (a == b){ printf("Draw\n"); }
else{
if (a == 1){
printf("Alice\n");
}
else if (b == 1){ printf("Bob\n"); }
else{
if (a > b){ ... | 128 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
usi... | 325 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main(void){
// Here your code !
int a,b;
scanf("%d %d",&a,&b);
if(a == b){
printf("Draw\n");
}else if(a == 1){
printf("Alice\n");
}else if(b == 1){
printf("Bob\n");
}else if(a > b){
printf("Alice\n");
}else{
printf... | 107 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
using namespace std;
int main() {
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;
else if (a < b)cout << "Bob" << endl;
else c... | 115 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a == b)
cout << "Draw";
else if(a == 1)
cout << "Alice";
else if(b == 1)
cout << "Bob";
else if(a < b)
cout << "Bob";
else if(a > b)
cout << "Alice";
return... | 100 |
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;
}
return 0;
} | 109 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <functional>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
//#define INF 1000000000;
#define MOD 100000000... | 356 |
Project_CodeNet | 2,019 | // abc054a: One Card Poker
#include <bits/stdc++.h>
using namespace std;
#define in(x) cin>>(x)
#define oute(x) cout<<(x)<<endl
int main(){
int a,b;in(a);in(b);
if(a==1) a+=13;
if(b==1) b+=13;
if(a==b) oute("Draw");
else if(a>b) oute("Alice");
else if(a<b) oute("Bob");
} | 107 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
vector<int> n(14);
n={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
if(n[a]>n[b])cout<<"Alice"<<endl;
if(n[a]==n[b])cout<<"Draw"<<endl;
if(n[a]<n[b])cout<<"Bob"<<endl;
}
| 107 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
while(scanf("%d%d",&a,&b)==2){
if(a==1) a=14;
if(b==1) b=14;
if(a>b) printf("Alice\n");
else if(a<b) printf("Bob\n");
else printf("Draw\n");
}
return 0;
}
| 89 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define revp(i,a,b) for(int i=b;i>=a;i--)
int a,b;
int main()
{
cin>>a>>b;
if(a>b and b!=1 || a==1 and b!=1)
cout<<"Alice";
else if(b>a and a!=1 || b==1 and a!=1)
cout<<... | 121 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
{
switch (b)
{
case 1:cout << "Draw";
break;
default:cout << "Alice";
break;
}
}
else if (b == 1)
{
switch (a)
{
case 1:cout << "Draw";
break;
default:cout << "Bob";
break;
}
}
else
{
i... | 180 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b; cin>>a>>b;
if(a == b) cout<<"Draw\n";
else if(b == 1){
cout<<"Bob";
}
else if(a == 1) cout<<"Alice\n";
else if(a > b){
cout<<"Alice\n";
}
else cout<<"Bob\n";
}
| 81 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (long i = (s); i < (long)(n); i++)
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;
}... | 124 |
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;
else if (a>b)
cout<<"Alice";
if (b>a)
cout<<"Bob";
if (b==a)
cout<<"Draw";
system ("pause");
return 0;
} | 79 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
#define PB push_back
#define MP make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
int a,b;
cin>>a>>b;
if(a==b){
cout<<"Draw"<<endl;
}else if(a==1){
cout<<"Alice"<<endl;
}else if(b==1){
cout<<"Bob"<<endl;
}else if(a... | 126 |
Project_CodeNet | 2,017 |
#include "stdio.h"
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if (a == 1)
a += 13;
if (b == 1)
b += 13;
if (a > b)
puts("Alice");
else if (a == b)
puts("Draw");
else if (a < b)
puts("Bob");
return 0;
} | 95 |
Project_CodeNet | 2,019 | #include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
if (a == b) {
std::cout << "Draw" << std::endl;
} else if (a == 1 || (b != 1 && a > b)) {
std::cout << "Alice" << std::endl;
} else {
std::cout << "Bob" << std::endl;
}
return 0;
}
| 103 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type
summation(InputIterator first, InputIterator last) {
using T = typename InputIterator::value_type;
T *p = new T();
const auto sum = std::accumulate(first, last, *p);
delete p;
return sum;
}
template <typename T>
std... | 370 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1<b){
cout<<"Alice"<<endl;
}
else if(b==1<a){
cout<<"Bob"<<endl;
}
else if(a>b){
cout<<"Alice"<<endl;
}
else if(b>a){
cout<<"Bob"<<endl;
}
else{
cout<<"Draw"<<endl;
}
... | 99 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i, n) for(int (i)=0 ;i <(n); ++(i))
#define REP(i,m,n) for(int (i) = (m); (i) <= (n); ++(i))
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)? "YES":"NO")
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) {
cout << "Dr... | 224 |
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;
if(a < b) cout << "Bob" << endl;
if(a == b) cout << "Draw" << endl;
return 0;
} | 100 |
Project_CodeNet | 2,018 | #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 << "Draw" << endl;
} else if(A > B){
cout << "Alice" << endl;
} else if(A < B){
cout << "Bob" << endl;
}
... | 112 |
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 << "Bob" << endl;
}
else if(A == B) {
cout << "Draw" << endl;
}
else {
cout << "Alice" << endl;
}
return 0;
}
| 106 |
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 << "Bob" <<endl;
else if (a>b) cout << "Alice" << endl;
else cout << "Draw" << endl;
} | 81 |
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(int i=(ll)(r); i<(ll)(n); i++)
#define REP(i, n) FOR(i, (0), n)
#define ALL(r) r.begin(), r.end()
#define ll long long int
using namespace std;
string s;
vector<ll>... | 347 |
Project_CodeNet | 2,020 | #include<iostream>
#include<unordered_map>
#include<algorithm>
#include<vector>
#include<string>
#include<string.h>
#include<unordered_set>
using namespace std;
vector<int> prime_sieve(int n)
{
int* arr = new int[n+1];
int i, p;
for (i = 0; i <= n; ++i) {
arr[i] = i;
}
for (i = 2; ... | 324 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll 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;
}
| 93 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
using namespace std;
int a,b;
int main(){
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;
}
| 77 |
Project_CodeNet | 2,018 | #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(b>a){
cout << "Bob";
}else{
cout << "Draw";
}
} | 84 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | 288 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin >> a >> b;
if(a == b)
cout << "Draw\n";
else if(a == 1)
cout << "Alice\n";
else if(b == 1)
cout << "Bob\n";
else if(a > b)
... | 120 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <stdio.h>
#include <cstdio>
#include <math.h>
#include <cmath>
#include <sstream>
#include <cassert>
#include <functional>
#include <cfloat>
#include <climits>
#includ... | 175 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a) ; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#d... | 496 |
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";
else if(A>B)cout<<"Alice";
else cout<<"Bob";
cout<<endl;
return 0;
}
| 80 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
A = A == 1 ? 14 : A;
B = B == 1 ? 14 : B;
cout << (A == B ? "Draw" : A > B ? "Alice" : "Bob") << endl;
return 0;
}
| 77 |
Project_CodeNet | 2,019 | #include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
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 << "Draw\n";
else cout << "Bob\n";
return 0;
} | 87 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
vector<int> vec={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
if(vec.at(a)<vec.at(b)){
cout<<"Bob"<<endl;
}else if(vec.at(a)>vec.at(b)){
cout<<"Alice"<<endl;
}else{
cout<<"Draw"<<endl;
}
} | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
int main(){
int a,b;
std::cin>>a>>b;
a=a==1?14:a;
b=b==1?14:b;
std::string str[3] = {"Alice", "Draw", "Bob"};
std::string* ans = &str[1];
std::cout<<ans[(a>b?-1:(a==b?0:1))] << std::endl;
return 0;
} | 103 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <deque>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include "iomanip"
using namespace std;
#include <cstdio>
#include <cstring>
int main() {
int a, b;
cin >> a >> b;
if (a == 1){
a += 13;
}
i... | 122 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A, B;
cin >>A >>B;
if(A < B)
{
if(A == 1)
printf("Alice");
else
printf("Bob");
}
if(A > B)
{
if(B == 1)
printf("Bob");
else
printf("Alice");
}
if... | 104 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd... | 271 |
Project_CodeNet | 2,019 | //includes
#include<iostream>
#include<vector>
#include<set>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<string>
#include<stack>
#include<map>
#include<queue>
#include<iomanip>
#include<numeric>
#include<assert.h>
#include<cstring>
#include<unordered_map>
#include<bitset>
//macros and consts
#define R... | 5,039 |
Project_CodeNet | 2,017 | #include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a==1){
a+=13;
}
if(b==1){
b+=13;
}
if(a>b){
puts("Alice");
}else if(b>a){
puts("Bob");
}else{
puts("Draw");
}
... | 114 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
void solve(long long A, long long B){
if (A == 1 && B == 1) {
cout << "Draw" << endl;
} else if (A == 1) {
cout << "Alice" << endl;
} else if (B == 1) {
cout << "Bob" << endl;
} else {
if (A == B) {
cout << "Draw" << endl;
} else if ( A > B... | 176 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(),(obj).end()
#define sortall(obj) sort(ALL(obj))
#define revall(obj) reverse(ALL(obj))
#define SortRevAll(obj) revall(sortall(obj))
typedef string str;
typedef long long ll;
const int mod=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
#define V ... | 396 |
Project_CodeNet | 2,017 | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#i... | 881 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(void)
{
int a,b;
cin >> a >> b;
if(a==1)a=14;
if(b==1)b=14;
cout << (a==b ? "Draw":(a>b? "Alice" : "Bob")) << endl;
} | 63 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){
A+=13;
}
if(B==1){
B+=13;
}
if(A>B){
cout<<"Alice"<<endl;
}else if(A<B){
cout<<"Bob"<<endl;
}else if(A==B){
cout<<"Draw"<<endl;
}
}
| 92 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const 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 << "Draw" << endl;
else if (a > b) cout << "Alice" << endl;
else c... | 136 |
Project_CodeNet | 2,019 | #include<cstdio>
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a==1) a=14;
if(b==1) b=14;
if(a>b) printf("Alice\n");
else if(a<b) printf("Bob\n");
else printf("Draw\n");
return 0;
} | 72 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main (){
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw";
else if (a==1)cout<<"Alice";
else if(b==1)cout<<"Bob";
else if (a>b)cout<<"Alice";
else if (a<b)cout<<"Bob";
return 0;
}
| 79 |
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... | 1,276 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
if(N==1){
N=14;
}
if(M==1){
M=14;
}
if(N<M){
cout << "Bob" << endl;
}
else if(N==M){
cout << "Draw" << endl;
}
else{
cout << "Alice" << endl;
}
}
| 101 |
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;
}
| 98 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#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
... | 1,726 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void init();
void solve();
#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-... | 429 |
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 << "Bob" << endl;
else if(A > B) cout << "Alice" << endl;
else cout << "Draw" << endl;
return 0;
} | 93 |
Project_CodeNet | 2,020 | #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if((a>b || (a==1 && b==13)) && !(a==13 && b==1)) cout<<"Alice";
else if(a==b) cout<<"Draw";
else cout<<"Bob";
} | 86 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#... | 253 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll a, b;
cin >> a >> b;
if (a == 1) a ... | 164 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int a,b;
vector<string> s = {"Draw","Alice","Bob"};
cin >> a >> b;
if(a == b){
cout << s[0];
}else if((a > b && b != 1) || a == 1){
cout << s[1];
}else{
cout << s[2];
}
return 0;
}
| 103 |
Project_CodeNet | 2,019 | #include <cstdio>
using namespace std;
int main()
{
int a, b, c, d;
scanf("%d %d", &a,&b);
if(a==1 || b==1){
if(a==b){
printf("Draw");
}
else if(a>b){
printf("Bob");
}
else {
printf("Alice");
}
}
else {
if(a==b){
printf("Draw");
}
else if(a>b){
printf("Alice");
}
else {
... | 128 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
a=20;
}
if(b==1){
b=20;
}
if(a==b){
cout<<"Draw";
}
else if(a>b){
cout<<"Alice";
}
else{
cout<<"Bob";
}
} | 79 |
Project_CodeNet | 2,018 | #include<stdio.h>
#include<iostream>
using namespace std;
int A,B;
int main (){
cin >> A >> B;
if( A == B ) cout << "Draw" << endl;
else if ( (B != 1) & (A == 1 || A > B) ) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 87 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#include"bits/stdc++.h"
#ifdef _DEBUG
#define DBG(n) n
#else
#define DBG(n)
#endif
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i,n) for(ll i=0,i##_len=(n);i<i##_len;++i)
#define REP1(i,n) for(ll i=1,i##_l... | 370 |
Project_CodeNet | 2,020 | /*
A - ABC/ARC
Contest 054
Rakesh Kumar --> 04/08/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a = 0, b = 0;
std::cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b)
std::cout << "A... | 175 |
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;
}
| 80 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
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" << e... | 126 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(... | 339 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B && A != 1) {
cout << "Bob" << endl;
} else if (A > B && B != 1) {
cout << "Alice" << endl;
} else if (A == B) {
cout << "Draw" << endl;
} else if (A == 1) {
cout << "Alice" << endl;
} else {
... | 132 |
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 << "Bo... | 109 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdi... | 1,116 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
string ans[] = {"Bob", "Draw", "Alice"};
int a, b;
cin >> a >> b;
a = a == 1 ? 14 : a;
b = b == 1 ? 14 : b;
cout << ans[(a > b) + (a >= b)] << endl;
} | 77 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
int main() {
int a, b;
std::cin >> a >> b;
if (a == 1) {
if (b == 1) {
std::cout << "Draw" << std::endl;
return 0;
} else {
std::cout << "Alice"... | 234 |
Project_CodeNet | 2,018 | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <iterator>
#include <math.h>
#include <cmath>
#include <set>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b){
cout << "Draw" << endl;
}
else if(a == 1)
{
... | 152 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B; cin >> A >> B;
if (A == B) cout << "Draw";
else if (A == 1 and B != A) cout << "Alice";
else if (B == 1 and A != B) cout << "Bob";
else if ((A > B)) cout << "Alice";
else cout << "Bob";
} | 96 |
Project_CodeNet | 2,020 | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V ve... | 5,617 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | 552 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm> // sort
using namespace std;
int main(){
int A,B;
string res;
cin >> A >> B;
if(A == B) res = "Draw";
else if(A == 1)res = "Alice";
else if(B == 1)res = "Bob";
else if(A > B)res = "Alice";
else res = "Bob"... | 106 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void) {
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... | 122 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
} else if(a > b){
if(b != 1){
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
} else {
if(a != 1){
cout << "Bob" << endl;
... | 115 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
A = (A + 11) % 13;
B = (B + 11) % 13;
cout << (A > B ? "Alice" : A == B ? "Draw" : "Bob") << endl;
return 0;
}
| 80 |
Project_CodeNet | 2,017 | #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("Draw\n");
else if(a<b) printf("Bob\n");
else printf("Alice\n");
return 0;
} | 72 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(var,cnt) for(int (var)=0; (var)<(int)(cnt); ++(var))
#define REP(var,init,cnt) for(int (var)=(init); (var)<(cnt); ++(var))
#define ran(var,vec) for(auto &(var):(vec))
#define all(v) (v).begin(),(v).end()
#define TF(flag) (flag)?1:0
using namespace std;
using ll = long long;
using u... | 588 |
Project_CodeNet | 2,019 | #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 > 0)
{
cout << "Alice" << endl;
}
else if (a - b < 0)
... | 134 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n,m; cin >> n >> m;
if(n == 1){
n += 13;
}
if(m == 1){
m += 13;
}
if(n>m){
cout << "Alice";
}
else if(n<m){
cout << "Bob";
}
else{
cout << "Draw"... | 124 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int a, b;
int main(){
cin >> a >> b;
if(a == 1) a+=100;
if(b == 1) b+=100;
if(a>b) cout << "Alice" << endl;
else if(a==b) cout << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 92 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()... | 365 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <cstdio>
#include <cmath>
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)co... | 136 |
Project_CodeNet | 2,019 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <regex>
#include <numeric>
using namespace std;
/*--- Macro ---*/
#define rep(i, n) for(int i=0; i<(int)n; i... | 406 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <limits>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1... | 141 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) {
puts("Alice");
} else if (b > a) {
puts("Bob");
} else {
... | 121 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B;
int Bob = 0, Alice = 0;
for (int i = 1; i <= 13; i++) {
if (A == i) Alice = i;
if (B == i) Bob = i;
if (i == 1 && A == 1) Alice += 100;
if (i == 1 && B == 1) Bob += 100;
}
if (Alice > Bob)... | 156 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
typedef long long unsigned int ll;
int main() {
int a,b,c,d;
cin >> a;
cin >> b;
if(a==b){
cout <<"Draw" <<endl;
return 0;
}
if(a==1){
cout <<"Alice" <<endl;
return 0;
}
if(b==1) {
cout <<"Bob" <<endl;
return 0;
}
if(a>b){
... | 139 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == 1){
a = 14;
}
if(b == 1){
b = 14;
}
if(a > b){
cout << "Alice" << endl;
}else if(b > a){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
... | 103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.