Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int a, b;
cin >> a >> b... | 181 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A==B){
cout << "Draw" << endl;
}
else if(A>B&&B!=1){
cout << "Alice" << endl;
}
else if(A<B&&A!=1){
cout << "Bob" << endl;
}
else if(A==1){
cout << "Alice" << endl;
}
else if(B==1){
cout <<... | 123 |
Project_CodeNet | 2,020 | /* Obada */
#include <bits/stdc++.h>
using namespace std;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
int main ()
{
int a , b ;
cin >> a >> b ;
if (a == 1) a = 14 ;
if (b == 1) b = 14 ;
if (a > b) cout << "Alice" ;
els... | 131 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(),(v).end()
using namespace std ;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main()
{
int a, b ;
cin >> a >> b ;
if(a==1){
a = 14 ;
}
else{
a = a ;
}
if(b=... | 328 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1&&b!=1){cout<<"Alice"<<endl;}
else if(a>b&&b!=1){cout<<"Alice"<<endl;}
else if(a==b){cout<<"Draw"<<endl;}
else{cout<<"Bob"<<endl;}
}
| 76 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const... | 337 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#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 <cs... | 579 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using vs=vector<string>;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define rep(i, a,... | 355 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B)
cout << "Draw" << endl;
else if (A == 1)
cout << "Alice" << endl;
else if (B ==1)
cout << "Bob" << endl;
else if (A > B)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
} | 102 |
Project_CodeNet | 2,020 | #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;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>... | 420 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
using namespace std;
const char en = '\n';
using ll = long long;
using ull = unsigned long long;
#define REP(i ,n) for(int i=0;i<n;i++)
#define FOR(i,s,g) for(int i=s;i<g;i++)
const ll INFL = 810000001919114514;
const int INF = 1919114514;
int main(){
ios::sync_with_std... | 165 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}else if(A==1){
cout<<"Alice"<<endl;
}else if (B==1){
cout<<"Bob"<<endl;
}
if(A>B&&B!=1) cout<<"Alice"<<endl;
if(B>A&&A!=1) cout<<"Bob"<<endl;
ret... | 110 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
vector<int> s ={0,14,2,3,4,5,6,7,8,9,10,11,12,13};
if(s.at(a)>s.at(b)){
cout << "Alice";
}
else if(s.at(a)==s.at(b)){
cout << "Draw";
}
else{
cout << "Bob";
}
} | 110 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
if (a > b && b != 1) cout << "Alice" << endl;
if (a < b && a != 1) cout << "Bob" << endl;
if (a == 1 && b != 1) cout << "Alice" << endl;
if (b == 1 && a != 1) cout << "B... | 127 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void) {
int A,B ;
cin >> A >>B;
A += 11;
B += 11;
if(A%13 > B%13) cout << ("Alice") ;
else if(A%13 < B%13) cout << ("Bob") ;
else cout << ("Draw") << endl;
return 0;
}
| 90 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
if ((a < b && a > 1) || (a == 13 && b == 1)) cout << "Bob" << endl;
else if (a != b) cout << "Alice" << endl;
else cout << "Draw" << endl;
return 0;
} | 82 |
Project_CodeNet | 2,017 | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<list>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<stack>
using namespace std;
#define REP(i,m,n) for(int i = (m); i < (n);i++)
#define rep(i,n) RE... | 157 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A == 1){
A += 13;
}
if(B == 1){
B += 13;
}
if(A == B){
cout << "Draw" << endl;
}
else if(A > B){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
| 107 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a==1) a=9999;
if(b==1) b=9999;
if(a>b)cout << "Alice";
if(a<b)cout << "Bob";
if(a==b)cout << "Draw";
}
| 78 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pii pair<int,int>
const long long MOD=1000000007;
int main(){
int a,b;
cin>>a>>b;
map<int,int> strength;
rep(i,13) strength[i+1]=i;
strength[1]=13;
if(st... | 144 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
//A=(A+11)%13;
//B=(B+11)%13;
if(A==1)A=14;
if(B==1)B=14;
if(A>B)
cout<<"Alice";
if(A<B)
cout<<"Bob";
if(A==B)
cout<<"Draw";
system ("pause");
return 0;
} | 107 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
... | 148 |
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;
return 0;
} | 88 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int a,b;
cin >>a >>b;
if(a==1) a = 14;
if(b==1) b = 14;
if(a>b) cout << "Alice" << endl;
if(a==b) cout << "Draw" << endl;
if(a<b) cout << "Bob" << endl;
return 0;
}
| 120 |
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 && b != 1)
cout << "Alice";
else if(b == 1 && a != 1)
cout << "Bob";
else if(a < b)
cout << "Bob";
else if(a > b)
cout << "Alice";
... | 107 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <functional>
using namespace std;
using Int = long long;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,f,t) for(int i=f;i<t;i++)
#define P(r) do{for(auto i:r){cout<<i<<' ';}... | 172 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<math.h>
using namespace std;
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;
}
| 83 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int A,B;cin >> A >> B;
if(A == 1)A+=100;
if(B == 1)B+=100;
if(A>B){
cout << "Alice" << endl;
}else if(A < B){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
}
| 85 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a==b)
cout << "Draw" << endl;
else if(a==1)
cout << "Alice" << endl;
else if(b==1)
cout << "Bob" << endl;
else if(a>b)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
} | 98 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a==1)a+=19;
if(b==1)b+=19;
if(a>b)cout<<"Alice"<<endl;
if(a==b)cout<<"Draw"<<endl;
if(a<b)cout<<"Bob"<<endl;
}
| 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 ? "Alice" : a < b ? "Bob" : "Draw")<< endl;
return 0;
}
| 83 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main (){
int A,B;
cin >> A >> B;
A-=1;
B-=1;
if(A==0){
A=13;
}
if(B==0){
B=13;
}
//cout << A << " " << B <<endl;
if(A==B){
cout <<"Draw" <<endl;
}else if(A<B){
cout << "Bob"<<endl;
}else{
cout <<"Alice"<<endl;
}
return 0;
}
| 120 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
string out;
if (a == 1) { a = 14; }
if (b == 1) { b = 14; }
if (a > b) {
out = "Alice";
} else if (a == b) {
out = "Draw";
} else {
out = "Bob";
}
cout << out << '\n';
}
| 113 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <numeric>
#include <map>
#include <utility>
using namespace std;
#define ll long long
#define rep(i,l,r) for(ll i=(l);i<(r);i++)
int main(void){
int a,b;
cin>>a>>b;
if(a==1)a=15;
if(b==... | 121 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <list>
#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int... | 1,380 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
// 引数の受け取り
cin >> N >> K;
if (N==1){
N +=13;
}
if (K==1){
K +=13;
}
// 出力
cout << (K==N?"Draw":K>N?"Bob":"Alice") << endl;
return 0;
}
| 113 |
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 << "Draw" << endl;
else if(A < B) cout << "Bob" << endl;
else cout << "Alice" << endl;
return 0;
} | 91 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if( a==1 && b!=1 )
cout <<"Alice"<<endl;
else if( b==1 && a!=1 )
cout <<"Bob"<<endl;
else if( a>b )
cout <<"Alice"<<endl;
else if( a<b )
cout <<"Bob"<<endl;
else
cout <<"Draw"<<endl;
return 0;
} | 96 |
Project_CodeNet | 2,017 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a == 1)
a = 14;
if (b == 1)
b = 14;
if (a == b)
std::cout << "Draw" << std::endl;
else if (a > b)
std::cout << "Alice" << std::endl;
else
std::cout << "Bob" << std::endl;
} | 102 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if ((a > b && b != 1) || a == 1) cout << "Alice" << endl;
else if ((b > a && a != 1) || b == 1) cout << "Bob" << endl;
else cout << "You must be wrong ..." << endl;
return 0;
}
| 114 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
#define rem(i, m, n) for (int i = m; i > n; --i)
typedef long long ll;
#define 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" << endl;
else if(... | 153 |
Project_CodeNet | 2,019 | #include<bits/stdtr1c++.h>
#include<list>
#include<algorithm>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if (A == 1){
A = 14;
}
if (B == 1){
B = 14;
}
if (A > B){
cout <<"Alice" << endl;
}
else if (A < B){
cout << "Bob" << endl;
}
... | 118 |
Project_CodeNet | 2,017 | #include<iostream>
#include<map>
#include<cmath>
using namespace std;
int main() {
int a, b;
cin >> a;
cin >> 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;
} | 111 |
Project_CodeNet | 2,017 |
#include <bits/stdc++.h>
using namespace std;
int main( int argc, char *argv[] )
{
int A;
int B;
ios::sync_with_stdio( false );
cin.tie( 0 );
cin >> A;
cin >> 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 )
... | 134 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define MOD 1000000007
#define INF 1e9
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define FOR(i, start, end) for(int i = (start); i < (end); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typ... | 279 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long ... | 516 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
using namespace std;
int main(){
int A;
int 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... | 120 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int power[]= {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
int A, B;
cin >> A >> B;
if(A == B)
cout << "Draw";
else
cout << ((power[A] < power[B]) ? ("Bob"):("Alice"));
return 0;
} | 109 |
Project_CodeNet | 2,019 | // -B1nary-
#include<bits/stdc++.h>
using namespace std;
/*----------------------------- DEFINES ------------------------------*/
#define eps 1e-9
#define mod 1000000007
#define ump unordered_map // operations take less time compared to map
#define pb push_back
#define pf push_front
#define pof pop_front()
#define ... | 703 |
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>B && 2<=B && B<=13) cout << "Alice" << endl;
else if (A==1) cout << "Alice" << endl;
else cout << "Bob" << endl;
}
| 94 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a, b;
cin>> a>> b;
if(a==1||b==1){
if(a==1&&b==1){
cout<< "Draw"<< endl;
}else if(a==1){
cout<< "Alice"<< endl;
}else{
cout<< "Bob"<< endl;
}
}else{
if(a>b){
cout<< "Alice"<< endl;
... | 135 |
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 cout << "Draw" << endl;
return 0;
} | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
int main() {
int A, B;
... | 184 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pll pair<ll,ll>
#define P push
#define R return
#define C continue
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define SI size()
#define F first
#define S second
#define B begin()
#define E end()
#define W while
using namespace std;
long long MOD=... | 162 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1&&b==1){cout<<"Draw";return 0;}
if(a==1){cout<<"Alice";return 0;}
if(b==1){cout<<"Bob";return 0;}
if(a==b) {cout<<"Draw";return 0;}
if(a<b) cout<<"Bob";
else cout<<"Alice";
return 0;
}
| 104 |
Project_CodeNet | 2,019 | /*
∧＿∧ やあ
（´・ω・｀) / ようこそ、バーボンハウスへ。
／∇y:::::＼ [￣] このテキーラはサービスだから、まず飲んで落ち着いて欲しい。
|:⊃:|:::::| |──|
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣| うん、「また」なんだ。済まない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|￣ 仏の顔もって言うしね、謝って許してもらおうとも思っていない。
￣￣￣￣￣￣￣￣￣￣￣￣￣￣／|
∇ ∇ ∇ ∇ ／.／| でも、この提出を見たとき、君は、きっと言葉では言い表せない
┴ ┴ ┴ ┴ ／ ／ | 「ときめき」みたいなものを感じて... | 954 |
Project_CodeNet | 2,017 | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include<map>
#include <st... | 210 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int a, b;
cin >> a >> b;
if(a == b) {
cout <<... | 191 |
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;
}
else if(B == 1){
cout << "Bob" << endl;
return 0;
}
... | 132 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string ans;
if(a>b){
if(b!=1)
ans="Alice";
else
ans="Bob";
}
else if(a<b){
if(a!=1)
ans="Bob";
else
ans="Alice";
}
else
ans="Draw";
cout<<ans<<endl;
return 0;
}
| 95 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
i... | 170 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1)a+=100;
if(b==1)b+=100;
if(a<b)cout<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Draw"<<endl;
} | 72 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if (a!=1&&b!=1&&a>b) {
cout<<"Alice"<<endl;
} else if (a!=1&&b!=1&&a<b) {
cout<<"Bob"<<endl;
} else if (a==b) {
cout<<"Draw"<<endl;
} else if (a==1&&b!=1) {
cout<<"Alice"<<endl;
... | 135 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<climits>
#include<string>
#include<bitset>
#include<cfloat>
#include<iomanip>
#include<numeric>
using namespace std;
using ll = long long;
usin... | 489 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
using namespace std;
int main()
{
string a,b; cin >> a >> b;
int A = stoi(a);
int B = stoi(b);
if(A == B) { cout << "Draw" << endl; }
else if((A > B && B != 1) || A == 1) { cout << "Alice" << endl; }
else { cout << "Bob" << endl; }
return 0;
} | 104 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b; cin>>a>>b;
if(a==1){
if(b==1){
cout<<"Draw";
}else cout<<"Alice";
}else if(b==1) cout<<"Bob";
else if(a>b) cout<<"Alice";
else if(b>a) cout<<"Bob";
else cout<<"Draw";
cout<<endl;
} | 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
cin >> a >> b;
if(a==b) cout << "Draw" << endl;
else{
if(a==1){
cout << "Alic... | 178 |
Project_CodeNet | 2,017 | #include <iostream>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <map>
#include <deque>
#include <cmath>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <sstream>
// short keywords
#define ipow(a,b) (int)pow(a,b... | 885 |
Project_CodeNet | 2,020 | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth... | 416 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1,... | 296 |
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{
... | 129 |
Project_CodeNet | 2,017 | // (つД`)
#include <cstdio>
inline int outcome(int a, int b) {
if (a == b) return 0;
else if (a == 1) return 1; else if (b == 1) return -1;
else return (a > b ? 1 : -1);
}
int main()
{
int a, b;
scanf("%d%d", &a, &b);
switch (outcome(a, b)) {
case 1: puts("Alice"); break;
case 0... | 149 |
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 << "Draw" << endl;
}else if( A < B ){
cout << "Bob" << endl;
}
return 0;
} | 106 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<set>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i =... | 264 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
inline int toInt(string s) {int v; istringstream sin(s);sin>>v; return v;}
typedef long long ll;
int main(){
int A, B;
cin... | 181 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define ren(i,j,n) for(li i=(j);i<(n);i++)
#define rep(i,n) ren(i,0,(n))
#define all(a) begin(a),end(a)
using namespace std;
typedef long int li;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;
int main()
{
int a,b;
cin>>a>>b;
if(a==1)a=14;
... | 149 |
Project_CodeNet | 2,019 | #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 ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios::sync_with_stdio(false);
cin.t... | 173 |
Project_CodeNet | 2,020 | #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== 1 && b != 1)
cout << "Alice" << endl;
else if(b== 1 && a != 1)
cout << "Bob" << endl;
else
cout << "... | 123 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
int main(){
int a, b;
cin >> a >> b;
if (a == b)
puts("Draw");
else if ((a > b && b != 1) || a == 1)
puts("Alice");
else
puts("Bob");
return 0;
}
| 89 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#de... | 189 |
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 if(a < b){
cout << "Bob" ... | 120 |
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;
}
} | 108 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <queue>
#include <sstream>
#include <fstream>
#include <float.h>
#include <cmath>
#include <cstring>
using namespace std;
#define ... | 177 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#defi... | 283 |
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>B){
if(B==1){
cout<<"Bob"<<endl;
}else{
cout<<"Alice"<<endl;
}
}else{
if(A==1){
co... | 110 |
Project_CodeNet | 2,020 | //Date and time of submission:
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a,b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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";
return... | 107 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
#define ALL(x) x.begin(),x.end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
A = (A == 1 ? 14 : A);
B = (B == 1 ? 14 : B);
cout << (A == B ? "Draw" : (A > B ... | 132 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define fr(a) freopen(a,"r",stdin)
#define fw(a) freopen(a,"w",stdout)
#define reset(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define ins insert
#define mp make_pair
#define fi first
#define se second
#define bug(x) cout << #x << " = " << x << endl;
using n... | 213 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define ED return 0;
#define SORT(vec) sort(vec.begin(),vec.end());
#define DOUBLECHANGE(count) cout << setprecision(count);
#define REV(vec) reverse(vec.begin(),vec.end());
#define ipow(x,y) int(pow(x,y))
const long long mod = 1000000007;
int main() {
int A, B;
ci... | 168 |
Project_CodeNet | 2,018 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define RFOR(i,a,b) for(long long i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ... | 289 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B;
cin >> A >> B;
A = (A == 1)? 14 : A;
B = (B == 1)? 14 : B;
if(A == B) cout << "Draw" << endl;
else if(A > B) cout << "Alice" << endl;
else cout << "Bob" << endl;;
}
| 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | 1,153 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<stdio.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define SWAP(a,b) (a += b,b = a - b,a -= b)
#d... | 240 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a==1) a += 13;
if(b==1) b += 13;
if(a==b){
cout << "Draw" << endl;
}
else if(a>b){
cout << "Alice" << endl;
}
else cout << "Bob" << endl;
} | 99 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll A,B;
cin>>A>>B;
if(A==B) cout<<"Draw"<<endl;
else if((A>B&&B!=1)||A==1) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 80 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1 && b != 1) cout << "Alice";
else if (a != 1 && b == 1) cout << "Bob";
else {
if (a == b) cout << "Draw";
else if (a > b) cout << "Alice";
else cout << "Bob";
}
cout << '\n';
return 0;
} | 111 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if(A==B){
cout << "Draw" << endl;
}
else if(A>B){
if(B==1){
cout << "Bob" << endl;
}
else{
cout << "Alice" << endl;
}
}
else if(B>A){
if(A==1){
cout << "Alice" << endl;
}
... | 125 |
Project_CodeNet | 2,017 | #include<iostream>
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 << "Alice" << endl;
}
else if (a < b)... | 151 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
int main(){
int a, b;
cin >> a >> b;
if(a == 1 && b == 1) cout << "Draw" << endl;
else if(a == 1) cout << "Alice" << endl;
else if(b == 1) cout << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else if(... | 146 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#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
#define mt make_tuple
#define mp make... | 1,077 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.