Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
if(a==1 || b==1){
if(a==1 && b==1)cout<<"Draw";
else if(a<b)cout<<"Alice";
else if(a>b)cout<<"Bob";
}
else {
if(a>b)cout<<"Alice";
else if(a==b)cout<<"Draw";
else if(a<b)c... | 114 |
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;
} | 84 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<utility>
#include<cmath>
#include<string>
#include<cstring>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define prin(arg) std::cout<<arg<<"\n"
#define prin2(arg1,arg2) std::c... | 281 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#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 (B < A) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 111 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b; cin >> a >> b;
string result="Draw";
if(a==1){
if(b!=1){
result="Alice";
}
}else{
if(b==1){
result="Bob";
}else if(a>b){
result="Alice";
}else if(b>a){
result="Bob";
}
}
cout << result << ... | 103 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
int main(int argc, char *argv[]) {
uint32_t alice_card;
uint32_t bob_card;
std::cin >> alice_card;
std::cin >> bob_card;
std::string result;
if (alice_card == bob_card) {
result = "Draw";
} else {
if (alice_card == 1) {
result = "Alice";
}
if (bob_card == 1) {
result = "... | 159 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a==b||a==b==1)
cout << "Draw";
else if ((a > b)&&(b!=1) ||( a == 1&& b>a))
cout << "Alice";
else
/*else if ((a < b) ||( b == 1&&a>b))*/
cout << "Bob";
} | 96 |
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||b==1){
if(a<b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
else{
if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
}
| 94 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long test;
test=1;
// cin>>test;
while(test--)
{
long a,b;
cin>>a>>b;
if(a==b)cout<<"Draw";
else if(a==1 || b==1)
{
if(a==1)cout<<"Alice";
... | 135 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,x,y) for(int i=x;i<y;i++)
#define rel(i,x,y) for(int i=x-1;i>=y;i--)
#define all(x) x.begin(),x.end()
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int a,b; cin >> a >> b;
... | 161 |
Project_CodeNet | 2,020 | // Created by conan1024hao in 2019.
// Copyright © 2019 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao QQ:810396815
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include ... | 681 |
Project_CodeNet | 2,017 | #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" << endl;
} else if(x < y) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
} | 103 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int... | 410 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
a = a == 1? 14: a;
b = b == 1? 14: b;
printf(a > b? "Alice": (b > a? "Bob": "Draw"));
} | 76 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)a += 13;
if (b == 1)b += 13;
if (a > b)cout << "Alice" << endl;
else if (a < b)cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 87 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pp pair<int, int>
#define ppp pair<pp, int>
#define fi first
#define se second
#define esp 1e-15
#define inf 1000000001
#define mod 1000000007
#define N 1000010
#define base 311097
typedef long long ll;
typedef long double ld;
const long long oo... | 238 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using pli... | 855 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else{
if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else{
if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
}
} | 89 |
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"<<endl;
}
else if(a>b){
cout<<"Alice"<<endl;
}
else{
cout<<"Draw"<<endl;
}
} | 91 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
}
else if (A == 1 || B == 1) {
if (A == 1) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
}
... | 132 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) x.begin(), x.end()
#define rep(i,n) for (i64 i = 0; i < (n); ++i)
#define reps(i,s,t) for (i64 i = (s); i <= (t); ++i)
#define repr(i,s,t) for (i64 i = (s); i >= (t); --i)
#ifdef DBG
#define trace(...) _trace(#__VA_ARGS__, __VA_ARGS__);
#else
#define ... | 588 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define INF 210000000
#define int long long
int gcd(int a, int b) {
int amari = a % b;
int c = b;
if (amari == 0) {
return b;
} else {
return gcd(b, amari);
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
signed main() {
int a,b;
cin >> a ... | 210 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int a,b;
cin... | 174 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for (int i=s;i<e;i++)
#define FOE(i,s,e) for (int i=s;i<=e;i++)
#define FOD(i,s,e) for (int i=s;i>=e;i--)
#define SET(a,e) memset(a,e,sizeof(a))
#define LL long long
#define LD long double
#define pb push_back
#define x first
#define y second
#define PII p... | 245 |
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;
if(A < B) cout << "Bob" << endl;
if(A == B) cout << "Draw" << endl;
return 0;
} | 92 |
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 cout << (a > b ? "Alice" : "Bob");
}
cout << endl;
return 0;
} | 89 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
void solve() {
#ifdef _WIN32... | 215 |
Project_CodeNet | 2,019 | #include <stdio.h>
int main(void)
{
int A, B;
scanf("%d", &A);
scanf("%d", &B);
if (A == 1)
A = 14;
if (B == 1)
B = 14;
if (A > B)
printf("Alice");
else if (A == B)
printf("Draw");
else
printf("Bob");
return 0;
} | 90 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if(A==B){
cout << "Draw" << endl;
}
else if(A==1 && B!=1){
cout << "Alice" << endl;
}
else if(A!=1 && B==1){
cout << "Bob" << endl;
}
else if(A>B){
cout << "Alice" << end... | 122 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if (a == 1) cout << "Alice" << endl;
else if (b == 1) cout << "Bob" << endl;
else if (a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 109 |
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 << "Bob" << endl;
else cout << "Draw" << endl;
} | 85 |
Project_CodeNet | 2,019 | #pragma GCC optimize "-O3"
#pragma GCC target ("avx")
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int,int>
#define vp vector<pair<int,int>>
#define mp make_pair
#define al... | 371 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) for(int i=(n-1);0<=i;--i)
#define each(e,v) for(auto&& e:(v))
#define DUMP(x) cerr<<#x<<": "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<": "<<(x)<< " (L"<<__LINE__<<")"<<endl;
using ... | 242 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
int main()
{
int A, B;
cin >> A >> B;
A = A == 1 ? 14 : A;
B = B == 1 ? 14 : B;
if (A == B... | 137 |
Project_CodeNet | 2,017 | #include <string>
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a!=13&&b!=13)
{
if(a>b) cout<<"Alice";
else if(a<b) cout<<"Bob";
else cout<<"Draw";
}
else if(a==13)
{
if(b==1) cout<<"Bob";
else if(a==b) cout<<"Draw";
else cout<<"Alice";
}
else if(b==13)
{
if(a==... | 145 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a==b){
cout<<"Draw";
}else if(a>b){
cout<<"Alice";
}else{
cout<<"Bob";
}
return 0;
} | 83 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<queue>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int s1,s2;
cin >>s1 >> s2;
if (s1==s2){
cout << "Draw";
}else if( (s1>s2 && s2!=1) || s1==1 ){
cout << "Alice";
}else{
cout << "Bob";
}
return 0;
}
... | 108 |
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";
}
return 0;
} | 93 |
Project_CodeNet | 2,020 | #include <iostream>
#include <numeric>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 292 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
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;
el... | 119 |
Project_CodeNet | 2,017 | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | 300 |
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;
else if(A==B) cout << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 85 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <cstdlib>
#include <cmath>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
vector<int> x={0,14,2,3,4,5,6,7,8,9,10,11,12,13};
if(x.at(A)>x.at(B)) cout << "Alice" << endl;
else if(x.at(A)==x.at(B))... | 136 |
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";
}
else if (a>b){
cout << "Alice";
}
else {
cout << "Bob";
}
} | 101 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
const int MOD=(int)1e9+7;
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;
} | 114 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
int main(){
int a,b;cin >>a >>b;
if( a == b) cout << "Draw" << endl;
else if(a == 1) cout << "Alice" << endl;
else if(b == 1) cout << "Bob" << endl;
else if( a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 95 |
Project_CodeNet | 2,017 | #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;
}
| 82 |
Project_CodeNet | 2,020 | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | 331 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string ans;
if(a == 1){
if(a == b) ans = "Draw";
else ans = "Alice";
}
else if(b == 1) ans = "Bob";
else if(a == b) ans = "Draw";
else if(a > b) ans = "Alice";
else ans = "Bob";
cout << ans << endl;
} | 113 |
Project_CodeNet | 2,018 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
if(a>b && b!=1) cout << "Alice";
else if(a<b && a!=1) cout << "Bob";
else if(a==1 && a<b) cout <<"Alice";
else if(b == 1 && a>b) cout << "Bob";
else cout << "Draw";
} | 92 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(... | 436 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
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 << "... | 133 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
#include<cstring>
#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) puts("Alice");
else if(a<b) puts("Bob");
else puts("Draw");
return 0;
}
| 85 |
Project_CodeNet | 2,018 | #include <iostream>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <list>
using namespace std;
int main(void){
int A, B;
cin >> A >> B;
if(A==1)A = 14;
if(B == 1)B = 14;
cout << ((A<B)?"Bob":(A>B)?"Alice":"Draw") << endl;
}
| 91 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cctype>
#define div 1000000000+7
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b){
cout << "Draw" << endl;
}else if(b == 1 ||... | 137 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;}
else if (A==1&&B!=1){
cout<<"Alice"<<endl;}
else if (B==1&&A!=1){
cout<<"Bob"<<endl;}
else if(A<B&&A!=1){
cout<<"Bob"<<endl;}
else if(A>B&&B!=1){
cout<<"Alice"<<endl;}
// your code goes here
return... | 113 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==13&&b==1){
p("Bob");
}
else if(a==1&&b==13){
p("Alice");
}
else if(a>b){
p("Alice");
}
else if(a<b){
p("Bob");
}
else p("Draw");
return 0;
}
| 115 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 10001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define int long long
const double PI = acos(-1);
typedef pair<int, int> P;
int gcd(int a, int b)
{
return b ? gcd(b, a %... | 691 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define FORE(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define REPU(i, a, b) for (int i = (a); i < (b); ++i)
#define REPD(i, a, b) for (int i = (a); i > (b); --i)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(... | 523 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
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;
}
| 87 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
struct P {
ll time, pos;
};
struct T {
ll time, can;
};
struct B {
ll ... | 375 |
Project_CodeNet | 2,018 | //#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <array>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <limits>
#include <memory>
#include <string>
#include <type_traits>
template <class Integral> class Rirange;
template <class Integral = std::size_t> class irange {
public:
using value_ty... | 1,643 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 410 |
Project_CodeNet | 2,017 |
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define FF(i,a,b) for (int i=a;i<=b;i++)
#define F(i,b,a) for (int i=b;i>=a;i--)
#define mes(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
typedef long long ll;
const int N = 2e5+10;
int main()
{
int a, b;
... | 171 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == 1) {
cout << (b == 1 ? "Draw" : "Alice") << endl;
}
else if (b == 1) {
cout << "Bob" << endl;
}
else {
if (a == b) {
cout << "Draw" << endl;
}
else {
cout << (a > b ? "Alice" : "Bob") << endl;
}
}
retu... | 125 |
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<<"Draw"<<endl;
else cout<<"Bob"<<endl;
return 0;
}
| 73 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | 248 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <climits>
#include <cstdio>
#include <iomanip>
#include <utility>
using namespace std;
typedef long long int ll;
in... | 158 |
Project_CodeNet | 2,020 | #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==1)a+=13;
if(b==1)b+=13;
cout<<(a==b?"Draw"s:a>b?"Alice"s:"Bob"s)<<"\n"s;
} | 73 |
Project_CodeNet | 2,020 | #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
| 97 |
Project_CodeNet | 2,017 | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if(a == b) {
cout << "Draw\n";
} else if(((a>b)&&((a!=13)||(b!=1)))||((a==1)&&(b==13))) {
cout << "Alice\n";
} else {
cout << "Bob\n... | 105 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,a,b) for(int i=a;i<b;i++)
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 << "Bob" << endl;
else cout << "Alice" << endl;
}
| 110 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <numeric>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string ans;
if(a==1)a+=20;
if(b==1)b+=20;
if(a>b)ans="Alice";
... | 114 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a == 1) {
if (b == 1)
cout << "Draw\n";
else
cout << "Alice\n";
}
else if (b == 1) {
cout << "Bob\n";
}
else {
cout << ((a > b) ? "Alice" : (a < b)... | 137 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n)repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
typedef pair<int,int> P;
typedef pair<int, P> PP;
#define all(v) v.begin(),v.end()
#define fi first
#... | 214 |
Project_CodeNet | 2,019 | #include <iostream>
#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){
if(b == 1) cout << "Draw" << endl;
else cout << "Alice" << endl;
}else{
if(b == 1) cout << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else if(a ... | 138 |
Project_CodeNet | 2,018 | #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;
if(a > b) cout << "Alice" << endl;
else if(a == b) cout << "Draw" << endl;
else cout << "Bob" << endl;
}
| 96 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x)((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y) - 1; 0 <= (x); (x)--)
#define nepi(x, y... | 775 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b ;
if(a==b){
cout<< "Draw" <<endl;
}
else if(a==1){
cout<< "Alice" <<endl;
}
else if(b==1){
cout<< "Bob" <<endl;
}
else if(a>b){
cout<< "Alice" <<endl;
}
else{
... | 113 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b; cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) cout << "Alice";
else if (a == b) cout << "Draw";
else cout << "Bob";
cout << endl;
} | 115 |
Project_CodeNet | 2,019 | #include <iostream>
//#include <string>
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" << endl;
}
else if (Alice < Bob) {
cout << "Bob" << endl;
}
else if (Alice == Bob) {
cout ... | 119 |
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<<"Bob"<<endl;
else cout<<"Draw"<<endl;
return(0);
} | 80 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a;
cin >> b;
if( a == b ){
cout << "Draw";
}
else if( a < b ){
if( a == 1 ){
cout << "Alice";
}
else{
cout << "Bob";
}
}
else{
if( b == 1 ){
cout << "Bob";
}
else{
co... | 120 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
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 ... | 136 |
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)
... | 104 |
Project_CodeNet | 2,019 | #include <string>
#include <iostream>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A != 1 && B != 1){
if(A > B){
cout << "Alice" << endl;
}else if(A < B){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
}else{
if(A == 1 && B != 1){
cout << "Alice" << endl;
}else if(A ... | 161 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cstdlib>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <iostream>
#include <limits>
#include <climits>
#include <functional>
#include <numeric>
using namespace std;
#define alloc(type,n) (ty... | 183 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end()) // ユニークな... | 326 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
map<int,int> rank; rank.clear();
for (int i = 0, j = 1; i < 13; ++i, j = (j + 1) % 13){
/... | 224 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#de... | 242 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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;
}
} | 106 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
int main(void){
ll 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;
... | 138 |
Project_CodeNet | 2,020 | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 301 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}else if(a == 1){
cout << "Alice" << endl;
}else if(b == 1){
cout << "Bob" << endl;
}else if( a > b){
cout << "Alice" << endl;
}else{
... | 121 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
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<<"Draw"<<endl;
else if(a>b)
cout<<"Alice"<<endl;
else
cout<<"Bob"<<endl;
return 0;
}... | 111 |
Project_CodeNet | 2,019 | #include <cstdio>
#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" <... | 111 |
Project_CodeNet | 2,017 | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorith... | 491 |
Project_CodeNet | 2,017 | #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";
if (a<b) cout << "Bob";
if (a==b) cout << "Draw";
cout << endl;
return 0;
} | 86 |
Project_CodeNet | 2,019 | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdio>
#include <list>
#define ll long... | 366 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
int main()
{
int A,B;
cin >> A>>B;
string ans;
if(A==B) ans="Draw";
else if (A==1) ans="Alice";
else if (B==1) ans="Bob";
else{
if(A>B) ans="Alice... | 134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.