Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author cherrypi59
*/
#pragma GCC optimize ("O2")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define FFOR(i, a, b) FOR(i, a, b+1)... | 527 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <typeinfo>
#include <cxxabi.h>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__ , i)
DbgTimer D_t;
#define TSTART() D_t.start()
#define TSTOP() D_t.stop()
#else
#define DUMP(i)
#define TSTART()
#define TS... | 357 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1 && b==1){
cout << "Draw" << endl;
}
else if(a==1 && b!=1){
cout << "Alice" << endl;
}
else if(a!=1 && b==1){
cout << "Bob" << endl;
}
else if(a==b){
cout << "Draw" << endl;
}
else if(a>b){
... | 141 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
a = (a+11)%13;
b = (b+11)%13;
if(a > b) cout << "Alice" << endl;
if(a == b) cout << "Draw" << endl;
if(a < b) cout << "Bob" << endl;
return 0;
}
| 91 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1&&b!=1)
cout << "Alice" << endl;
else if(a!=1&&b==1)
cout << "Bob" << endl;
else if(a>b)
cout << "Alice" << endl;
else if(a<b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
} | 103 |
Project_CodeNet | 2,020 | #pragma region template
// clang-format off
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("tree-vectorize")
#pragma GCC diagnostic ignored "-Wunused-result"
#define here
#define com(msg)
#define obs(...)
#define see(vec)
#define local(x)
#define alter(x,y) y
#else
#define here ... | 3,586 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
using namespace std;
int main() {
// string A, B;
int a, b;
int power[14] = { 0,13,1,2,3,4,5,6,7,8,9,10,11,12 };
// cin >> A;
// cin >> B;
cin >> a;
cin >> b;
// a = std::stoi(A);
// b = std::stoi(B);
if ( a == b ) { cout << "Draw" << endl; }
else {
cou... | 156 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <utility>
#include <climits>
#include <vector>
using namespace std;
#define ll long long int
const int MOD = 1000000007;
int main() {
int A, B;
cin >> A >> B;
if (A == 1)A = 14;
if (B == 1)B = 14;
if (A > B)cout << "Alice" ... | 132 |
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";
else if(a<b)cout << "Bob";
else cout << "Draw";
return 0;
} | 76 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if(a == 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" <... | 114 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b)
cout << "Alice" << endl;
else if (a < b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
return 0;
}
| 102 |
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 << "Alice\n";
if (m > n) cout << "Bob\n";
if (n == m) cout << "Draw\n";
return 0;
}
| 91 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if((a>b&&b!=1)||(a==1&&b!=1))cout<<"Alice"<<endl;
else if((a<b&&a!=1)||(b==1&&a!=1))cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
| 79 |
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" << '\n';
else if (A < B)cout << "Bob" << '\n';
else cout << "Draw" << endl;
} | 95 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
string fa="Alice";
if(a==b){
fa="Draw";
}
else if(b==1||a!=1&&a<b){
fa="Bob";
}
cout<<fa<<endl;
}
| 75 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int a, b; cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a == 1 || b == 1){
... | 178 |
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 {
cout << (a < b ? "Bob" : "Alice") << endl... | 110 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define FOR(i,n) for(int i=0;i<n;i++)
#define PRINT(a) cout<<a<<"\n"
int main(){
int a,b;
cin>>a>>b;
if(a==b)PRINT("Draw");
else if(a==1||(a>b&&b!=1))PRINT("Alice");
else PRINT("Bob");
return 0;
} | 95 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i... | 249 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int A, B;
cin >> A >> B;
if(A == B) cout << "Draw" << endl;
else if(A == 1) cout << "Alice" << endl;
else if(B == 1) cout << "Bob" << endl;
else cout << ((A > B) ? "Alice": "Bob") ... | 106 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <vector>
#include <cstdio>
#include <bits/stdc++.h>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <deque>
#include <numeric>
#include<bits/stdc++.h>
#include <utility>
... | 368 |
Project_CodeNet | 2,019 | /* ＵＴＦ－８ */
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <array>
#include <queue>
#include <stack>
#include <algorithm>
#include <tuple>
#include <numeric>
#include <type_traits>
#include... | 533 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
void solve() {
long A, B;
ci... | 182 |
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 << "Bob" << endl;
} else if (A > B) {
cout << "Alice" << endl;
} else {
cout << "Draw" << endl;
}
return 0;
} | 108 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == b) puts("Draw");
else if(b != 1 && b < a || a == 1) puts("Alice");
else puts("Bob");
return 0;
}
| 66 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y;
if (x == 1)x = 14;
if (y == 1)y = 14;
if (x == y)cout << "Draw" << endl;
else if (x>y)cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 92 |
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,020 | #include <bits/stdc++.h>
using namespace std;
#define each(i, c) for (auto& i : c)
#define mkp(a, b) make_pair(a, b)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9+7;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p... | 338 |
Project_CodeNet | 2,019 | #include <iostream>
#include <list>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int A, B;
string ans;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A == B) ans = "Dra... | 128 |
Project_CodeNet | 2,017 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long dou... | 234 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a,b; cin>>a>>b;
if(a==b){ cout<<"Draw";
}else if(a!=1 && b!=1){
(a<b)? cout<<"Bob":cout<<"Alice";
}
else if(a==1) cout<<"Alice";
else if(b==1) cout<<"Bob";
return 0;
}
| 94 |
Project_CodeNet | 2,018 | #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;
}
else if (A < B) {
if (A == 1) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
else cout << "Draw" << endl;
} | 112 |
Project_CodeNet | 2,018 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(... | 280 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
using Graph = vector<vector<int>>;
int main(){
int A,B;
cin >> A >> B;
A = (A + 11) % 13;
B = (B + 11) % 13;
if(A > B) cout << "Alice" << endl;
else if(A ... | 132 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
const int mINF = -1001001001;
int main() {
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b... | 164 |
Project_CodeNet | 2,017 | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<random>
#include<map>
#include<queue>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if( a == 1 ) a = 14;
if( b == 1 ) b = 14;
if( a == b ) cout << "Draw" << endl;
if( a > b... | 140 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
if(A==1)
A=A+13;
if(B==1)
B=B+13;
if(A>B)
cout<<"Alice";
if(A<B)
cout<<"Bob";
if(A==B)
cout<<"Draw";
system("pause");
return 0;
} | 76 |
Project_CodeNet | 2,018 | //おまじない
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define INF 1e9+7
#define roop(i,m,n) for(int i=m;i<n;i++)
#define mroop(i,m,n) for(int i=m;i<n;i--)
#define NO cout<<"NO"<<endl;
#define YES cout << "YES"<<endl;
#define No cout << "No"<<endl;
#define Yes cout << "Yes"<<endl;
using na... | 219 |
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(a==b)cout<<"Draw"<<endl;
else cout<<"Bob"<<endl;
} | 75 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
x=(x+11)%13;
y=(y+11)%13;
if (x>y)
cout<<"Alice";
if (x==y)
cout<<"Draw";
if (x<y)
cout<<"Bob";
system ("pause");
return 0;
}
| 87 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
... | 209 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#include<string>
using namespace std;
int main(){
int a, b; cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a == 1 || b == 1){
if(a < b) cout<< "Alice" << endl;
else cout << "Bob" << endl;
}
else if(a > 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<B){
if((A==1)&&(B!=1)){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
else if(A>B){
if((B==1)&&(A!=1)){
cout << "Bob" << e... | 136 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... | 984 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <sstream>
using namespace std;
int main() {
int a,b,flag = 1;
cin >> a >> b;
if(a > b){
if(b == 1){
cout << "Bob" << endl;
flag = 0;
}
if(flag){
cout << "Alice" ... | 162 |
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;
if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 83 |
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 << "Bob" << endl;
else if(A>B)
cout << "Alice" << endl;
else
cout << "Draw" << endl;
} | 89 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> pll;
int main(){
int A, B;
cin >> A >> B;
if (A == 1 && B != 1){
cout << "Alice" << endl;
}
else if (A != 1 && ... | 179 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main()
{
int A, B;
cin >> A >> B;
if (A == B)
{
cout << "Draw" << endl;
return 0;
}
else if (A < B)
{
if (A == 1)
{
cout << "Alice" << endl;
return 0;
}
... | 168 |
Project_CodeNet | 2,020 | #define ENABLE_DEBUG 1
// Kana's kitchen {{{
#include<bits/stdc++.h>
#define ALL(v) std::begin(v),std::end(v)
#define LOOP(k) for(i64 ngtkana_is_a_genius=0; ngtkana_is_a_genius<(i64)k; ngtkana_is_a_genius++)
using i32 = std::int_least32_t;
using i64 = std::int_least64_t;
using u32 = std::uint_least32_t;
using u64 = st... | 332 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int A,B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
}
else if (A == 1) cout << "Alice";
else if (B == 1) cout << "Bob";
else if (A > B) cout << "Alice";
else cout << "Bob";
... | 108 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#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+=100;
if(b==1) b+=100;
if(a<b) puts("Bob");
if(a==b) puts("Draw");
if(a>b) ... | 128 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int a,b;
int main(){
cin>>a>>b;
if(a==1){
a+=15;
}
if(b==1){
b+=15;
}
if(a>b){
cout<<"Alice"<<endl;
}else if(a<b){
cout<<"Bob"<<endl;
}else{
cout<<"Draw"<<endl;
}
return 0;
} | 92 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++) // ex)REP(i,10) i=0~i=9
#define REPR(i, n) for(int i = n;i >= 0;i--) // ex)REPR(i,10) i=10~i=0
#define FOR(i, m, n) for(int i = m;i < n;i++) //ex)FOR(i,3,10) i=3~i=9
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#def... | 366 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fo(x, n) for(int i = x; i <= n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector <int> vi;
const int MOD = 1e9 + 7;
void solve(){
int a, b;
cin >> a >> b;
int x = 0;
if(a == b) x = 1;
else i... | 229 |
Project_CodeNet | 2,017 | #include <iostream>
#include <map>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef unsigned long long ull;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1)
{
A += 13;
}
if (B == 1)
{
B += 13;
}
printf("%s\n",
... | 120 |
Project_CodeNet | 2,019 | using namespace std;
#include<bits/stdc++.h>
#define BEGIN ios_base::sync_with_stdio(0);cin.tie(0);
#define END return EXIT_SUCCESS;
#define FOR(I,A,B) for((I)=(A);(I)<(B);(I)++)
#define REP(I,N) FOR((I),0,(N))
#define UP(I,A,B) for((I)=(A);(I)<=(B);(I)++)
#define DW(I,A,B) for((I)=(A);(I)>=(B);(I)--)
#define IN(P) cin... | 507 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed 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;
} | 112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
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
... | 130 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
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;
}
| 98 |
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 << "Draw" << endl;
else cout << ((a > b)? "Alice":"Bob") << endl;
return 0;
} | 82 |
Project_CodeNet | 2,017 | #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;
return 0;
} | 85 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b,c;
scanf("%d%d",&a,&b);
if(a == b) printf("Draw");
else if(a == 1) printf("Alice");
else if(b == 1) printf("Bob");
else if(a>b) printf("Alice");
else if(a<b) printf("Bob");
return 0;
}
| 77 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int a, b;
scanf("%d%d",&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 <... | 126 |
Project_CodeNet | 2,019 | #include<iostream>
#include<string>
#include <algorithm>
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 >... | 124 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define i... | 624 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;cin >> A >> B;
if(A==B){
cout << "Draw" << endl;
return 0;
}
if(A==1){
cout << "Alice" << endl;
}else if(B==1){
cout << "Bob" << endl;
}else if(A>B){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
} | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,ans=0;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;
} | 89 |
Project_CodeNet | 2,020 | #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";
}
| 80 |
Project_CodeNet | 2,017 | #include <stdio.h>
int main()
{
int A;
int B;
scanf("%d %d",&A,&B);
if(A==1||B==1)
{
if(A==B)printf("Draw");
else if(A==1)printf("Alice");
else printf("Bob");
}
else
{
if(A>B)printf("Alice");
else if(A<B)printf("Bob");
else printf("Draw");
}
return 0;
} | 101 |
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 Alice, Bob;
cin >> Alice >> Bob;
if (Alice == 1)Alice = 14;
if (Bob == 1)Bob = 14;
if (Alice > Bob)cout << "Alice"... | 122 |
Project_CodeNet | 2,019 | #include<iostream>
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 < b) {
cout << "Alice" << endl;
}
else if(a>b){
cou... | 151 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define VI vector<int>
#define SI set<int>
#define QI queue<int>
#define PII pair<int, int>
#define MP make_pair
#define PB push_back
#define REP(i,a,b) for(int i = a; i < b; ++i)
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define M 1000000007
using n... | 209 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B;
cin >> A >> B;
if (A==B)
cout << "Draw" << endl;
else if (A==1)
cout << "Alice" << endl;
else if (B==1)
cout << "Bob" << endl;
else if (A<B)
cout << "Bob" << endl;
else if... | 118 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
const int N = 0;
int n,m,q,potato;
int main()
{
cin >> n >> m;
if(n==1) n = 14;
if(m==1) m = 14;
if(m==n) cout << "Draw" << endl;
else if(n > m) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
| 95 |
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;
} | 99 |
Project_CodeNet | 2,017 | #include<cmath>
#include<cstdio>
#include<cassert>
#include<cstring>
#include<algorithm>
#define MN 51
#define Cx 0.03
#define Cy 0.03
#define eps 1e-7
using namespace std;
int read_p,read_ca;
inline int read(){
read_p=0;read_ca=getchar();
while(read_ca<'0'||read_ca>'9') read_ca=getchar();
while(read_ca>='... | 190 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | 276 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std ;
int main () {
int a , b;
cin >> a >> b ;
if (( b== 1 ) && ((a>=2 && a<=13))){
cout << "Bob";
}
else if (( a== 1 ) && ((b>=2 && b<=13))){
cout << "Alice";
}
else if (a> b){
cout << "Alice";
}
else if (a< b){
cout << "Bob";
}
else {
cout << "Draw" ;
}
ret... | 117 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
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;
return 0;
} | 106 |
Project_CodeNet | 2,019 | // This is free and unencumbered software released into the public domain.
// Anyone is free to copy, modify, publish, use, compile, sell, or
// distribute this software, either in source code form or as a compiled
// binary, for any purpose, commercial or non-commercial, and by any
// means.
// In jurisdictions that... | 1,122 |
Project_CodeNet | 2,017 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Yulian
*/
#include <iostream>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <deque>
#include <string>
#include <algorithm>
#include <map>
#include ... | 427 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
int main(int argc, char* argv[])
{
int n = 13;
std::map< int, int > mp;
mp[1] = 99;
for (int i = 2; i <= n; i++) {
mp[i] = i;
}
int a, b;
std::cin >> a >> b;
std::string judge = "Draw";
... | 175 |
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 << "Draw" << endl;
} else if( A > B ) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
}
| 99 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <climits>
using namespace std;
bool comp(pair<int, string> a, pair<int, string> b){
if(a.first != b.first) return a.first > b.first;
else return a.second... | 281 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
vector<int> alice{ 2,3,4,5,6,7,8,9,10,11,12,13,1 };
ve... | 305 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
#define dumpi(x1) fprintf(stderr, "#%s.%d (%s) = (%d)\n", __func__, __LINE__, #x1, x1);
#define dumpii(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%d, %d)\n", __func__, __LINE__, #x1, #x2, x1, x2);
#define dumpiii(x1, x2, x3)... | 767 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeindex>... | 682 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int a,b;
string ans;
main(){
cin>>a>>b;
if(a==1||b==1){
if(a==1&&b==1){
ans="Draw";
}else if(a==1){
ans="Alice";
}else if(b==1){
ans="Bob";
}
}else if(a>b){
ans="Alice";
}else if(a<b){
ans="Bob";
}else{
ans="Draw";
}
... | 125 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A , B;
cin >> A >> B;
if ( A >=1 && A <=13 && B >=1 && B <=13 ){
if ( A == 1 && B !=1)
cout << "Alice";
else if ( B==1 && A != 1)
cout << "Bob";
else if ( A > B)
cout << "Alice";
else if ( B ... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int A, B;
int main() {
cin >> A >> B;
vector<int> power(13, 0);
for(int i = 0; i < 13; ++i) {
if(i == 0) {
power.at(i) = 13;
}else {
power.at(i) = i;
}
}
if(power.at(A-1) > power.at(B-1)) {
cout <<... | 156 |
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;
}
... | 117 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#defin... | 456 |
Project_CodeNet | 2,017 | #ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <valarray>
//#include <array>//x ... | 396 |
Project_CodeNet | 2,020 | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i)... | 1,117 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
// Create a boolean a... | 533 |
Project_CodeNet | 2,018 | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | 174 |
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 (a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 93 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int A,B;
cin >> A >> B;
if (A == B)
cout << "Draw";
else if (A > B)
{
if (B == 1)
cout << "Bob";
else
cout << "Alice";
}
else
{
if (A == 1)
cout << "Alice";
... | 108 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; //1e18
const double EPS = 1e-10; //
int main(void)
{
int A, B;
cin >> A >> B;
string ans;
if (A == B)
{
ans = "Draw";
... | 194 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.