Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
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) > 0) {
cout << "Alice" << endl;
}else if((A - B) < 0) {
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
return 0;
} | 109 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <iomanip>
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,... | 210 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
else if(a>b&&!(a==13&&b==1)||(a==1&&b==13))cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
} | 73 |
Project_CodeNet | 2,020 | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#d... | 284 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
{
a *= 100;
}
if (b == 1)
... | 161 |
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";
else if (b>a) cout<<"Bob";
else cout<<"Draw";
system("pause");
return 0;
} | 83 |
Project_CodeNet | 2,019 |
#include "bits/stdc++.h"
using namespace std;typedef long long lint;typedef vector<lint> liv;
//#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(),v.end()
#define linf 1152921504606846976
#define MAXN 110
#define md 1000000007//998244353
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#defi... | 1,145 |
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 cout << "Bob";
}... | 101 |
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&&b!=1)||(a>b&&b!=1)){
cout<<"Alice"<<endl;
}else if((a!=1&&b==1)||(a<b&&a!=1)){
cout<<"Bob"<<endl;
}
return 0;
}
| 99 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){A=14;}
if(B==1){B=14;}
if(A>B){cout<<"Alice"<<endl;}
else if(A==B){cout<<"Draw"<<endl;}
else{cout<<"Bob"<<endl;}
}
| 80 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
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" ... | 133 |
Project_CodeNet | 2,017 | #include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
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;
} | 95 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if(a==1)
{
a=14;
}
if(b==1)
{
b=14;
}
if(a>b)
{
printf("Alice");
}
else if(a<b)
{
printf("Bob");
}
else
... | 116 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x == 1) {
x = 14;
}
if (y == 1) {
y = 14;
}
if (x > y) {
cout << "Alice";
}
else if (y > x) {
cout << "Bob";
}
else {
cout << "Draw";
}
} | 97 |
Project_CodeNet | 2,017 | #include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <numeric>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
typedef long long ll;
vector<int> line_to_... | 486 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <iostream>
#include <string>
int main(void)
{
int A, B;
std::cin >> A >> B;
if (A == B)
{
std::cout << "Draw";
}
else if (A == 1)
{
std::cout << "Alice";
}
else if (B == 1)
{
std::cout << "Bob";
}
if (A > B&&B!=1)
{
std::cout << "Alice";
}
else if (B > A &&A!=1)
{
... | 144 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
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" << endl;
}
else if(a < b){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
return 0;
} | 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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;
} | 82 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b == 1) {
cout << "Draw" << endl;
} else if(a == 1) {
cout << "Alice" << endl;
} else if(b == 1) {
cout << "Bob" << endl;
}else{
if(a > b) {
cout << "Alice" << endl;
}else if(a < b) {
cou... | 138 |
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 << "Draw" << endl;
} else if (a > b) {
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
return 0;
}
| 111 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstring>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map> //pair is also included in this library
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | 351 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#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(B>A) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 90 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using veci = vector<int>;
using vecll = vector<ll>;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i,a,b) for(int i = (a);i < (b); ++i)
#define REP(i,n) for(int i= 0;i<(int)(n);++i)
#defin... | 297 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int MOD = 1e9+7;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin >> a >> b;
if(a ... | 164 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll long long
#define make_pair mkp
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ALL(v... | 309 |
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
co... | 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
el... | 160 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, z, n) for(int i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
//const int INF = 1<<29;
//const int MODINF = 1000000007;
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A > B) cou... | 151 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cctype>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <vector>
#define REP(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int a, b; cin >> a... | 161 |
Project_CodeNet | 2,020 | //保留所有权利。
#include<iostream>
#include<stdio.h>//printするよ
#include<vector>
#include<algorithm>//辞書順はnext_permutationだよ
#include<set>
#include<string>
#include<sstream>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility... | 890 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1 and b != 1 or ((a != 1 and b != 1) and a > b)){
cout << "Alice" << endl;
}
else if(a != 1 and b == 1 or ((a != 1 and b != 1) and a < b)){
cout << "Bob" << endl;
}
else{
cout << "Draw" << endl;
}
return ... | 122 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
ll max(ll a, ll b){
if(a >= b) return a;
else if(a < b) return b;
}
int gcd(int a, int b){
if(b == 0) return a;
return gcd(b, a%b);
}
int main(){
ll a, b;
cin >> a >> b;
string ans;
if(a ==... | 209 |
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;
}
}
... | 209 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; ... | 253 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/abc054/tasks/abc054_a
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
int main() {
ios::s... | 219 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int main()
{
... | 132 |
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(a<b) cout << "Bob" << endl;
else cout << "Draw" << endl;
}
| 87 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 223 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
#define pl pair<ll,ll>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<... | 279 |
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 << "Draw";
else if (a > b) cout << "Alice";
else cout << "Bob";
return 0;
}
| 79 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ... | 242 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// int/long: -2,147,483,648 - 2,147,483,647 (-2^31 <= int < 2^31)
// long/long long: -9,223,372,036,854,775,808 - 9,223,372,036,854,775,807 (-2^63 <= long < 2^63)
// lower_bound(A.begin(), A.end(), N)
// upper_bound(...
// A.erase(unique(A.begin(),... | 507 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
vector<int> arr(2, 0);
f... | 188 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if(a == b)
cout << "Draw" << endl;
else if(a == 1 || (a > b && b != 1))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
} | 87 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main(void)
{
int card1, card2;
scanf("%d %d",&card1,&card2);
if(card1>card2 && card2!=1){
printf("Alice\n");
}
else if(card1>card2 && card2==1){
printf("Bob\n");
}
else if(card1<card2 && card1!=1){
printf("Bob\n");
}
else if(card1<card2 && card1==1){
printf("Alice\n");
}
else if... | 132 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
void solve()
{
int A, B;
cin >> A >> B;
if (A == B)
{
cout << "Draw" << endl;
}
else
{
if (A == 1)
{
A += 13;
}
if (B == 1)
{
B += 13;
}
if (A > B)
{
cout << "Alice" << endl;
}
else
{
cout << "Bob" << endl;
}
}
}
int main()
{
sol... | 141 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 272 |
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;
return 0;
}
if (a==1) {
cout << "Alice" << endl;
return 0;
}
if (b==1) {
cout << "Bob" << endl;
return 0;
}
if (a>b) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 121 |
Project_CodeNet | 2,018 | #include<cstdio>
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a==b)printf("Draw");
else if(a==1)printf("Alice");
else if(b==1 || a<b)printf("Bob");
else printf("Alice");
return 0;
} | 69 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a>b && b!=1){
cout<<"Alice"<<endl;
}else if(a>b && b==1){
cout<<"Bob"<<endl;
}else if(a<b && a!=1){
cout<<"Bob"<<endl;
}else if(a<b && a==1){
cout<<"Alice"<<endl;
}else if(a==b){
cout<<"Draw"<<endl;
}
... | 115 |
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 << "Bob";
}else if(a > b){
cout << "Alice";
}else{
cout << "Draw";
}
} | 96 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void) {
int alice, bob;
cin >> alice >> bob;
alice = (alice + 11) % 13;
bob = (bob + 11) % 13;
if (alice > bob)
cout << "Alice" << endl;
else if (alice < bob)
cout << "Bob" << endl;
else if (alice == bob)
cout << ... | 105 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int a, b;
cin >> a >> b;
if (a == b)
{
puts("Draw");
}
else if (a == 1)
{
puts... | 171 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <ctype.h>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int dx4[4] = {... | 309 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <list>
#include <string>
using namespace std;
int main()
{
ifstream fin("input.txt");
long long A, B;
cin >> A >> B;
if (A == 1 && B != 1)
{
cout << "Alice" << endl;
return 0;
}
if (A != 1 && B == 1)
{
cout << "Bob" << ... | 170 |
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;
} | 78 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void)
{
int A, B;
cin >> A >> B;
if(A == 1) A = 14;
if(B == 1) B = 14;
if(A > B) cout << "Alice" << endl;
else if(A < B) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
} | 95 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream> //入出力
#include <stdio.h>
#include <map>
#include <set>
#include <string>
#include <math.h> //算術演算子
#include <vector>
#include <cstdlib>
#include <queue>
#include <stack>
#include <list>
#include <iomanip> //小数点以下を表示させる(setprecision())
//#include <bits/stdc++.h>
using namespace s... | 373 |
Project_CodeNet | 2,020 | #include <iostream>
int main()
{
int a, b;
std::cin >> a >> b;
if (a == b)
{
std::cout << "Draw";
}
else
{
a = (a + 11) % 13;
b = (b + 11) % 13;
std::cout << (a > b ? "Alice" : "Bob");
}
std::cout << std::endl;
return 0;
}
| 107 |
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||(a>b&&b!=1)) cout << "Alice";
else if(b==1||(b>a&&a!=1)) cout << "Bob";
cout << endl;
return 0;
} | 86 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
using namespace std;
void judg(int a,int 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 if(b>a){
cout<<"Bob"<<endl;
}
}
int main(){
int alice;
int bob;
cin>>alice>>bob;
judg(alice,bob);
return 0;
}... | 105 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
int A,B;
cin >> A >... | 184 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rfor(i, a, b) for(int i = a; i < (int)b; i++)
#define all(ary) (ary).begin(), (ary).end()
#define debug(x) cerr << #x << ": " << x << '\n'
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
using namespace std;
using v = vector<int... | 237 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
#define rep(a,b) for(int a = 0;a < b;a++)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define P(a) cout << a << endl
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ssort(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define vP(v) for(int i = 0;i < ... | 293 |
Project_CodeNet | 2,017 | #include<cstdio>
using namespace std;
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a == 1)a = 14;
if(b == 1)b = 14;
if(a < b) printf("Bob\n");
else if(a > b) printf("Alice\n");
else printf("Draw\n");
return 0;
} | 101 |
Project_CodeNet | 2,019 | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(int argc, const char * argv[]) {
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else if(a == 1){
cout << "Alice" << endl;
}else if(b == 1){
... | 138 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a == b)cout << "Draw" << endl;
else if(a > 1 && b > 1){
if(a > b)cout << "Alice" << endl;
else cout << "Bob" << endl;
} else {
if(a == 1)cout << "Alice" << endl;
else cout << "Bob... | 109 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <list>
#include <queue>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
template <typename T>
T gcd(T a, T b) {
if(b == 0) return a;
else return gcd(b, ... | 337 |
Project_CodeNet | 2,019 | #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";
}
return 0;
} | 86 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <string>
#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <map>
#include <math.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a == b) printf("Draw\n");
... | 136 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
using ll = long long;
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a == b) {
cout << "Draw" << endl;
} else if( a != 1 && a < b || b == 1) {
cout << "Bob" <<endl;
} else {... | 124 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
int a, b; scanf("%d%d", &a, &b);
if(a == b) printf("Draw\n");
else if(a == 1 or (b != 1 and b < a)) printf("Alice\n");
else printf("Bob\n");
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define ll long long
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __F... | 225 |
Project_CodeNet | 2,017 | #include<cstdio>
int main(){
int a,b;
scanf("%d %d",&a,&b);
if(a==b) printf("Draw\n");
else if((a>b && b!=1) || (a==1 && b!=1)) printf("Alice\n");
else printf("Bob\n");
return 0;
}
| 67 |
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 ll;
typedef pair<int, int> P;
const int INF = 100000000;
int main()
{
int a,b;
cin >> a >> b;
if(a==b)
{
cout<<"Draw"<<endl;
}
else if((a==1||a>b)&&b!=1)
{
cout<<"Al... | 136 |
Project_CodeNet | 2,017 | #include <iostream>
#include <sstream>
#include <vector>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iomanip>
#include <cstdio>
#include <float.h>
#include <queue>
#include <set>
#include <map>
#include <fstream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <n... | 381 |
Project_CodeNet | 2,017 | //
// Created by tattsun on 2017/02/11.
//
#include <iostream>
using namespace std;
int main() {
int alice, bob;
cin >> alice >> bob;
if(alice == bob) {
cout << "Draw" << endl;
return 0;
}
if(alice == 1) {
cout << "Alice" << endl;
return 0;
}
if(bob == 1... | 149 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | 382 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed 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;
} | 88 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a>b){
cout<<"Alice"<<endl;
}
if(b>a){
cout<<"Bob"<<endl;
}
else if(b==a){
cout<<"Draw"<<endl;
}
} | 91 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
for(;;)
{
if(a==b){cout<<"Draw";break;}
if(a==1){cout<<"Alice";break;}
if(b==1){cout<<"Bob";break;}
if(a<b){cout<<"Bob";break;}
if(a>b){cout<<"Alice";break;}
}
cout<<endl;
}
| 84 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin >> A >>B;
if(A == B){
cout << "Draw" <<endl;
}
else{
if(A == 1){
cout << "Alice" <<endl;
return 0;
}
if(B == 1){
cout << "Bob" <<endl;
re... | 134 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
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... | 138 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1 and b!=1){
cout<<"Alice"<<endl;
}else if(b==1 and a!=1){
cout<<"Bob"<<endl;
}else{
if(a==b){
cout<<"Draw"<<endl;
}else if(a>b){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
}
} | 104 |
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 << "Draw" << endl;
}else{
cout << "Alice" << endl;
}
... | 109 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int A,B;
cin >> A >> B;
if (A == 1) {
A = 14;
}
if (B == 1) {
B = 14;
}
if (A > B) {
cout << "Alice";
}
else if (A < B) {
cout << "Bob";
}
else {
cout << "Draw";
}
} | 111 |
Project_CodeNet | 2,019 | #include <iostream>
#include<algorithm>
using namespace std;
int main(void){
int a,b,c=0;
cin>>a>>b;
c=max(a,b);
if(a==1&&b>1) cout<<"Alice"<<endl;
else if(b==1&&a>1) cout<<"Bob"<<endl;
else if(a==b) cout<<"Draw"<<endl;
else if(c==a) cout<<"Alice"<<endl;
else if(c==b) cout<<"Bob"<<endl;
return 0;
} | 105 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
int a,b; cin>>a>>b;
if(a==b)cout<<"Draw"<<endl;
... | 151 |
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<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<malloc.h>
int my_gets(char *buf,int nBuf,FILE *fp){
int ch;
while(--nBuf >0){
ch=getc(fp);
if(ch==EOF || ch=='\n')
break;
*(buf++)=(char)ch;
}
*(buf)='\0';
return nBuf;
}
int ma... | 176 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >>a>>b;
if(a==b) {cout << "Draw"; return 0;}
if(a==1 ) {cout << "Alice"; return 0;}
if(b==1 ) {cout << "Bob"; return 0;}
if(a>b) cout << "Alice";
else cout << "Bob";
} | 94 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 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;
return 0;
} | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i... | 365 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> 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) cout << "Alice" << endl;
els... | 128 |
Project_CodeNet | 2,017 | #include <iostream>
int a,b;
int main(){
std::cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
std::cout << (a > b ? "Alice" : (a < b ? "Bob" : "Draw")) << std::endl;
} | 72 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
#include <ios>
#include <iomanip>
using namespace std;
#define N_MAX (100000)
#define LL_MAX_NUM (1LL<<60)
#define IN... | 206 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define yes cout<<"yes"<<'\n'
#define no cout<<"no"<<'\n'
v... | 1,003 |
Project_CodeNet | 2,018 | #include<iostream>
#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) cout << "Bob" << endl;
else if (A > B) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 109 |
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)
{
cout << "Alice" << endl;
}
else
{
cout << "Bob" << endl;
}
}
if(b<a)
{
if(b==1)
... | 143 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 590 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.