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;
cin >> a >> b;
if (a == b){
cout << "Draw" << endl;
}
else if (a == 1){
cout << "Alice" << endl;
}
else if (b == 1){
cout << "Bob" << endl;
}
else if (a < b){
cout << "Bob" << endl;
}
else{
cout << "Alice"... | 122 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
int a, b;
int main()
{
while(scanf("%d %d", &a, &b) != EOF)
{
if(a == 1 || b == 1)
{
if(a == 1 && b != 1) printf("Alice");
else if(a != 1 && b == 1) printf("Bob\n");
else if(a == 1 && b == ... | 173 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#define print(n) std::cout << n << std::endl
#define print_no_indention(n) std::cout << n
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a > b) print("Alic... | 119 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int s1,s2;
cin>>s1>>s2;
if(s1==s2)cout<<"Draw"<<endl;
else if((s1>s2&&s2!=1)||s1==1)cout<<"Alice"<<endl;
else if((s2>s1&&s1!=1)||s2==1)cout<<"Bob"<<endl;
return 0;
} | 106 |
Project_CodeNet | 2,018 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tup... | 242 |
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){
if(A==1){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
else {
if(B==1){
cout << "Bob" << endl;
}
else{
... | 117 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
a = (a + 11) % 13;
b = (b + 11) % 13;
if(a == b){
cout << "Draw" << endl;
}else if(a > b){
cout << "Alice" << endl;
}else{
cout << "Bob" << endl;
}
return 0;
}
| 107 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | 1,350 |
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 > b && b != 1) || a == 1) cout << "Alice" << endl;
else cout << "Bob" << endl;
} | 81 |
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<<"Alice"<<endl;
else if(b>a)cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
}
| 76 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b; scanf("%d%d", &a, &b);
if (a==b) printf("Draw\n");
else if (a==1) printf("Alice\n");
else if (b==1) printf("Bob\n");
else if (a>b) printf("Alice\n");
else printf("Bob\n");
} | 84 |
Project_CodeNet | 2,017 | #include <fstream>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <cassert>
#include <deque>
#include <set>
#include <map>
#include <vector>
#include <regex>
#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 (... | 236 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;cin>>a>>b;
if(a==b){
cout << "Draw" << endl;
}else{
if(a==1)cout << "Alice" << endl;
else if(b==1)cout << "Bob" << endl;
else cout << (a<b?"Bob":"Alice") << endl;
}
} | 88 |
Project_CodeNet | 2,017 | #include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;
using llng = long long;
/* Declarations */
int A, B;
void solve() {
A = (A+11) % 13;
B = (B+11) % 13;
if (A == B) {
cout << "Draw" << en... | 151 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a, b, c, d;
cin >> a >> b;
if (a == b)
cout << "Draw" << endl;
else if (a == 1 || (b != 1 && a > b))
cout << "Alice" << endl;
else
cout << "Bob" << endl;
return 0;
} | 96 |
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"<<endl;
} else if(A >B){
cout <<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
return 0;
} | 98 |
Project_CodeNet | 2,020 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream> /... | 476 |
Project_CodeNet | 2,020 | #include<iostream>
#include <algorithm>
#include<string>
#include <numeric>
#include<math.h>
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b;
cin >>a>>b;
string ans="";
if(a>b)ans="Alice";
else if(a<b)ans="Bob";
if(a==1&&b!=1)ans="Alice";
if(a!=1&&b==1)ans="Bob";
... | 116 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
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 << "Bob";
else if(a == b) cout << "Draw";
else if(a > b) cout << "Alice";
cout << endl;
... | 118 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
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" << end... | 129 |
Project_CodeNet | 2,019 | // https://atcoder.jp/contests/abc054/tasks/abc054_a
#include <iostream>
using namespace std;
int main()
{
/* Magic word */
cin.tie(0);
ios::sync_with_stdio(false);
/* ---------- */
int a, b;
string r;
cin >> a >> b;
r = a == b ? "Draw" : (a + 11) % 13 < (b + 11) % 13 ? "Bob" : "Alice";
cout << ... | 122 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
using namespace std;
int a = 0;
int b = 0;
void get_input()
{
cin >> a >> b;
return;
}
int main()
{
get_input();
if(a == b)
{
cout << "Draw";
}
else if(a == 1)
{
cout << "Alice";
}
else if(b == 1)
{
cout... | 139 |
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 || (B!=1 && A>B))
cout << "Alice";
else
cout << "Bob";
cout << endl;
return 0;
}
| 78 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a , b;
cin >> a >> b;
if (a == b) cout << "Draw\n";
else if(a == 1 ) cout << "Alice\n";
else if(b == 1 ) cout << "Bob\n";
else if(a > b) cout << "Alice\n";
else cout << "Bob\n";
return 0;
} | 95 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
scanf("%d", &A);
scanf("%d", &B);
if((A>B && B!=1) || (A==1 && B!=1)){
printf("Alice");
}else if((A<B && A!=1) || (B==1 && A!=1)){
printf("Bob");
}else if(A==B){
printf("Draw");
}
return 0;
} | 110 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <ios>
#include <iomanip>
#include <stack>
#include <queue>
#include <algorithm>
#define REP(i, n) for(int i = 0;i < n;i++)
using namespace std;
const int INF = 100000000;
int main(){
int card[2];
cin >> card[0] >> card[1];
int ans = 0;
if (ca... | 262 |
Project_CodeNet | 2,017 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <string>
#define SS(i) scanf("%s",i)
#define SC(i) scanf("%d",&i)
#define SCC(i,j) scanf("%d%d",&i,&j)
#define SCCC(i,j,z) scanf("%d%d... | 348 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A == 1) {
A = 14;
}
if (B == 1) {
B = 14;
}
if (A == B) {
cout << "Draw";
}
else if (A > B) {
cout << "Alice";
}
else if (A < B) {
cout << "Bob";
}
return 0;
} | 106 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#define DIVIDER9 1000000007
#define lli long long int
#include <iostream>
#include <string.h>
#include <fstream>
#include <math.h>
using namespace std;
#ifdef _WIN32
#pragma warning(disable : 4101)
signed wait(){
char wai... | 2,379 |
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;
}
if(a < b){
cout << "Bob" << endl;
}
if(a == b){
cout << "Draw" << endl;
}
} | 101 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cmath>
#include<cstring>
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\n";
else if(a>b)cout<<"Alice\n";
else cout<<"Bob";
return 0;
} | 75 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | 285 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i) // one rep
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i,s,t) for(long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),(x)... | 334 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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;
}... | 115 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
using namesp... | 148 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a; i<... | 399 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a,b;
cin >> a >> b;
if (a == 1) {a = 14;};
if (b == 1) {b = 14;};
if (a > b) {
cout << "Alice" << endl;
return 0;
}
if (a == b) {
cout << "Draw" << endl;
return 0;
}
... | 118 |
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){
if(b == 1){
cout << "Bob" << endl;
}
else{
cout << "Alice" << endl;
}
}
else{
if(a == 1... | 123 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
} | 91 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
}
else if((a>b || a == 1)&&b!=1){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
return 0;
} | 87 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (b == 1) b = 14;
if (a == 1) a = 14;
if (a > b) cout << "Alice\n";
else if (b > a) cout << "Bob\n";
else cout << "Draw\n";
return 0;
} | 91 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
main() {
int64_t 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;
}
}
| 108 |
Project_CodeNet | 2,018 | #include<bitset>
#include<math.h>
#include<limits.h>
#include<iostream>
#include<string>
#include<vector>
#include<stdio.h>
#include<sstream>
#include<list>
#include<queue>
#include<algorithm>
#include<functional>
#include<map>
#include<set>
#include<utility>
#include<initializer_list>
#include<tuple>
#include<regex>
u... | 278 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
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... | 145 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, c... | 252 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#define PI 3.141592653589793238
#define INF 1050000000
using namespace std;
//cout << fixed << setprecision(15) << << endl;
//cout << << endl;
int main() {
int A,B;
cin >> A>>B;
if (A == B) {
cout << "Draw" << endl;
}
else if (A =... | 166 |
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";
if(a<b)
cout<<"Bob";
if(a==b)
cout<<"Draw";
return 0;
} | 77 |
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<b){
if(a==1) {
cout <<"Alice";;
}else {
cout <<"Bob";
}
}else if(b==1){
cout <<"Bob";
}else{
cout <<"Alice";
}
} | 95 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
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 < B)
cout << "Bob" << endl;
else... | 126 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 411 |
Project_CodeNet | 2,018 | #include <cstdio>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a == b) {
puts("Draw");
} else if (a == 1) {
puts("Alice");
} else if (b == 1) {
puts("Bob");
} else if (a > b) {
puts("Alice");
} else {
puts("Bob");
}
} | 98 |
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 (b < a)
cout << "Alice" << endl;
else
cout << "Bob" <... | 116 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0);
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)
... | 158 |
Project_CodeNet | 2,019 | #define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<string>
#include<stack>
#include<algorithm>
#include<cmath>
#include<set>
#include<queue>
#include<sstream>
#include<utility>
#include<map>
#include<ctime>
#include<cstdio>
... | 453 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
int a,b;
int rank[14];
scanf("%d %d",&a,&b);
//the strength of cards
for(int i=2;i<=13;i++){
rank[i] = i-1;
}
rank[1] = 13;
if(rank[a]>rank[b])
printf("Alice");
else if(rank[a]==rank[b])
printf("Draw");
else
printf("Bob");
p... | 118 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#ifdef WIN32
#define I64 "%I64d"
#else
#define I64 "%lld"
#endif
typedef long long ll;
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int(s.size()))
#define fname "a"
int main()
{
#ifdef L... | 179 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii,nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade,bde) __gcd(ade,bde)
#define vi vector<int>
#define vll vector<ll>
#define vs v... | 1,570 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define rep(i, first, to) for(ll i = first; i < to; ++i)
using namespace std;
typedef long long ll;
void solve() {
int x[2];
rep(i, 0, 2) {
cin >> x[i];
}
if (x[0] == x[1]) cout << "Draw" << endl;
else if (x[0] == 1 || (x[0] > x[1] && x[1] != 1)) cout << "Alice" << endl;
else cout <<... | 143 |
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\n";
}
else if(a<b)
{
cout<<"Bob\n";
}
else
{
cout<<"Draw\n";
}
return 0... | 104 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
if(n==1) n=14;
if(m==1) m=14;
if(n==m){
cout<<"Draw"<<endl;
}else if(n>m){
cout<<"Alice"<<endl;
}else{
cout<<"Bob"<<endl;
}
system("pause");
return 0;
} | 86 |
Project_CodeNet | 2,017 | #include<cstdio>
int main()
{
int a,b;scanf("%d%d",&a,&b);
if(a==1)a=14;if(b==1)b=14;
puts(a>b?"Alice":a==b?"Draw":"Bob");
} | 51 |
Project_CodeNet | 2,020 | #include<iostream>
using namespace std;
main(){
int a,b;
cin>> a>>b;
if(a==1) a +=100;
if(b ==1) b+=100;
if(a == b) cout<<"Draw"<<endl;
else if (a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
return 0;
} | 80 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
#... | 267 |
Project_CodeNet | 2,017 | #include <iostream>
#include <map>
#include <vector>
#include <cstring>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <string>
#include <stack>
#include <set>
#include <deque>
#define mp make_pair
using namespace std;
int a,b;
int main(){
cin>>a>>b;
if (a==1) a=100;
if (b==1) b=... | 129 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long long> vll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int A, B;
cin >> A >> B;
if (A == 1)
{
A = 14;
}
if (B == 1)
{
B = 14;
}
if (... | 159 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <string>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==b){
cout<<"Draw"<<endl;
}else if(a==1){
cout<<"Alice"<<e... | 133 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
// #include "bits/stdc++.h"
#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)
typedef long long ll;
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a = 100;
if(b == 1) b = 100;
if(a > b){
printf("Alice\n");
}... | 145 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 433 |
Project_CodeNet | 2,020 | #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 << "Draw" << endl;
else
cout << (A > B ? "Alice" : "Bob") << endl;
} | 97 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
//--------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3
//------------------------------... | 192 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
string ans;
if(A == 1 && B == 1){
ans = "Draw";
}
else if(A == 1){
ans = "Alice";
}
else if(B == 1){
ans = "Bob";
}
else if(A == B){
ans = "Draw";
}
else if(A > B){
ans = "Alice";
}
e... | 138 |
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;
} else if (b == 1){
cout << "Bob" << endl;
} else {
if (max(a, b) == a) {
cout << "Alice" << endl;
... | 139 |
Project_CodeNet | 2,019 | // 2:04
#define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned ... | 1,162 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
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(b<a){
cout<<"Alice"<<endl;
return 0;
}
... | 135 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{ int a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw"<<"\n";
}
else if(a==1)
{
cout<<"Alice"<<"\n";
}
else if(b==1)
{
cout<<"Bob"<<"\n";
}
else if(a>b)
{
cout<<"Alice"<<"\n";
}
else
{
cout<<"Bob"... | 122 |
Project_CodeNet | 2,018 | #include <iostream>
#include <vector>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
using ull = unsigned long long;
using pii = pair<int,int>;
using vi = vector<int>;
using vs = vector<string>;
using vull = vector<ull>;
using vpii = vector<pii>;
#de... | 357 |
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";
else if(a>b)
cout<<"Alice";
else cout<<"Bob";
system ("pause");
return 0;
} | 70 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
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;
else if(b>a) cout << "Bob" << endl;
else cout << "Draw" << endl;
} | 106 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <cstdlib>
int main(){
unsigned int A, B;
std::cin >> A >> B;
A = (A == 1 ? 14 : A);
B = (B == 1 ? 14 : B);
if (A == B){
std::cout << "Draw" << std::endl;
}
else if (A > B){
std::cout << "Alice" << std::endl;
}
else {
std::cout << "Bob" << std::endl;
}
return 0;
} | 114 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int a,b;
cin>>a>>b;
if(a==1) a=14;
if(b==1) b=14;
if(a==b) cout<<"Draw\n";
else cout<<(a<b?"Bob\n":"Alice\n");
}
| 86 |
Project_CodeNet | 2,017 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d %d",&a,&b);
if(a==b){
printf("Draw\n");
}
else if(a==1){
printf("Alice\n");
}
else if(b==1){
printf("Bob\n");
}
else if(a>b){
printf("Alice\n");
}
else if(a<b){
printf("Bob\n");
}
return 0;
} | 95 |
Project_CodeNet | 2,019 | #include <iostream>
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 << "Draw" << endl;
} else if (a > b) {
c... | 158 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main(){
int a,b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
... | 157 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1 && b==1)puts("Draw");
else if(a==1)puts("Alice");
else if(b==1)puts("Bob");
else
{
if(a>b)puts("Alice");
else if(a==b)puts("Draw");
else puts("Bob");
}
} | 96 |
Project_CodeNet | 2,019 | #include<stdio.h>
int main(void)
{
int a,b;
scanf("%d %d",&a,&b);
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a>b){
printf("Alice\n");
}
else if(a<b){
printf("Bob\n");
}
else{
printf("Draw\n");
}
return 0;
} | 87 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define INF 2000000000
#ifdef LOCAL
#define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define eprintf(...) 0
#endif
using namespace std;
typedef long long LL;
typedef unsig... | 378 |
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";
else if (a < b && a != 1 || b == 1) cout << "Bob";
else cout << "Alice";
} | 71 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b){
puts("Draw");
return 0;
}
if(a==1){
puts("Alice");
return 0;
}
if(b==1){
puts("Bob");
return 0;
}
if(a>b){
puts("Alice");
return 0;
}
if(a<b){
puts("Bob");
return 0;
}
return 0;
} | 112 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
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 ;
}
... | 116 |
Project_CodeNet | 2,017 | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 20110... | 541 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
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;
r... | 119 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if (a==b)
cout << "Draw" << endl;
else if (a==1)
cout << "Alice" << endl;
else if (b==1)
cout << "Bob" << endl;
else if(a>b)
cout << "Alice" << endl;
else
cout << "Bob" <<endl;
return 0;
} | 95 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <math.h>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <random>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
ll a, b;
cin >> a >> b;
if (a... | 131 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
int main(){
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) puts("Alice");
else if(a==b) puts("Draw");
else puts("Bob");
return 0;
}
| 91 |
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 << "Alice";
else if(a<b) cout << "Bob";
else cout << "Draw";
} | 76 |
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<<"Alice"<<endl;
}
else if(a<b){
cout<<"Bob"<<endl;
}
else {
cout<<"Draw"<<endl;
}
} | 95 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
int m... | 221 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll 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... | 118 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int a,b;
string ans;
cin>>a>>b;
if(a==1)a=14;
if(b==1)b=14;
if(a>b)ans="Alice";
if(b>a)ans="Bob";
if(a==b)ans="Draw";
cout<<ans<<endl;
} | 100 |
Project_CodeNet | 2,019 | #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 if (A<B){
cout<<"Bob"<<endl;
... | 103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.