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;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 1,079 |
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;
return 0;
}
if(a == 1){
cout << "Alice" << endl;
return 0;
} else if (b == 1){
cout << "Bob" << endl;
return 0;
}
if(a < b... | 130 |
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 += 13;
if(b == 1) b += 13;
if(a > b)cout << "Alice" << endl;
else if(a == b) cout << "Draw" << endl;
else cout << "Bob" << endl;
return... | 124 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
int a, b;
int n[] = { 99,13,1,2,3,4,5,6,7,8,9,10,11,12 };
cin >> a >> b;
if (n[a] > n[b]) {
cout << "Alice";
}
else if (n[a] < n[b]) {
cout << "Bob";
}
else {
cout <<... | 125 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000001
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"<<... | 123 |
Project_CodeNet | 2,017 | #include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
const double PI = acos(-1.0);
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(... | 237 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
string winner;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) winner = "Alice";
else if (a < b) winner = "Bob";
else winner = "Draw";
cout << winner << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==1 && b>1){
cout<<"Alice";
}
if(b==1 && a>1){
cout<<"Bob";
}
if(a>b && a>1 && b>1){
cout<<"Alice";
}
if(b>a && a>1 && b>1){
cout<<"Bob";
}
if(a==b){
cout<<"Draw";
}
} | 103 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (... | 404 |
Project_CodeNet | 2,020 | #include <iostream>
int main(){
int A,B; std::cin>>A>>B; A+=13*(A==1); B+=13*(B==1);
std::cout<<(A==B?"Draw":(A>B?"Alice":"Bob"));
} | 56 |
Project_CodeNet | 2,019 | #include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <limits.h>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
#include <random>
#include <fstream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265358979323846
#define MOD 1000... | 537 |
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==b) cout << "Draw" << endl;
else {
bool flag=false;
if (a==1) flag=true;
else if (a>b && b!=1) flag=true;
if (flag) cout << "Alice" << endl;
else cout <... | 105 |
Project_CodeNet | 2,019 | #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()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
// start
int a, b;
cin >> a >> b;
if(a == 1)
a = 14;
if (b == 1)
b = 14;
if (a... | 168 |
Project_CodeNet | 2,019 |
/*****/
#include <iostream>
#include <array>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <iomanip> //cout << fixed << setprecision(桁数);
#include <stdexcept>
//#define int long long
using namespace std;
using ll = long long;
usin... | 1,003 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
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;
if(a>b) cout<<"Alice";
if(a<b) cout<<"Bob";
if(a==b) cout<<"Draw";
cout<<"\n";
}
| 94 |
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";
return 0;
}
if (a == 1){
cout << "Alice\n";
return 0;
}
if (b == 1){
cout << "Bob\n";
return 0;
}
if (a < b){
cout << "Bob\n";
}
else
{
cout << "... | 129 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
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 << "Draw" << endl;}
else {cout << "Bob" << endl;}
}
else {
if (A == 1 && B != 1) {cout << "Alice" << endl;}
else if (A ==... | 150 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define ll long long
#define bit __builtin_popcountll
#define sqr(x) (x) * (x)
#define forit(it,S) for(__typeof((S).begin()) it = (S).begin(); it != (S).end(); it++)... | 422 |
Project_CodeNet | 2,018 | #include <iostream>
#include <climits>
#include <string>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int ascSort(const void* v1, const void* v2) {
const int _v1 = *((const int*)v1);
const int _v2 = *((const int*)v2);
if ( _v1 < _v2 ) {
return 1;
} else if ( _v1 > _v2 ) {
... | 182 |
Project_CodeNet | 2,017 | #include <iostream>
#include <sstream>
#include <algorithm>
#include <functional>
#include <iterator>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define __DEBUG__ 1
typedef signed long long int slli;
typedef unsigned long lon... | 451 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a>b){
if(b==1){
cout<<"Bob"<<endl;
}
else cout<<"Alice"<<endl;
}else if(a<b){
if(a==1){
cout<<"Alice"<<endl;
}
else cout<<"Bob"<<endl;
}else{
cout<<"Draw"<<endl;
}
}
| 95 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define F(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) F(i, 0, n)
#define REP1(i, n) for(int i=1;i<=n;i++)
#define REV(i, n) for(int i=n;i>=0;i--)
#define PTR(it, x) for(auto it=x.begin();it!=x.end();++it)
#define MOD 1000000007... | 211 |
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" << en... | 120 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int,int> pi;
typedef tuple <int,int,int> ti;
#define forn(i,a,n) for(int i = a; i < n ; i++)
#define mem(str,a) memset(str, a, sizeof(str));
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie... | 296 |
Project_CodeNet | 2,017 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
int a, b;
scanf("%d%d", &a, &b);
if(b != 1 && a > b)printf("Alice\n");
else if(a != 1 && a < b)printf("Bob\n");
else if(a == 1 && b != 1)printf("Alice\n");
else if(b == 1 && a != 1)printf("Bo... | 124 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#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 += 13;
if (b == 1) b += 13;
if (a == b) cout << "Draw" << endl;
else if (a > b) cout << "Alice" << endl;
else cou... | 130 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a += 13;
if (b == 1) b += 13;
if (a > b) cout << "Alice\n";
else if (a == b) cout << "Draw\n";
else if (a < b) cout << "Bob\n";
}
| 96 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
#define lp3(i,a,b) for(int i=a;i<b;i++)
#define lp2(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
string ans="Alice";
int a,b;
cin>>a>>b;
if(a==1)a+=100;
if(b==1)b+=100;
if(a==b)ans="Draw";
else if(a<b)ans="Bob";
cout<<ans<<endl;
return 0;
} | 103 |
Project_CodeNet | 2,019 | #include<iostream>
#include<cmath>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long ll;
typedef std::pair<int, int> ipair;
bool lessPair(const ipair& l, const ipair& r){return l.second < r.... | 502 |
Project_CodeNet | 2,017 | #include <cstdio>
using namespace std;
int a,b;
int main()
{
scanf ("%d %d", &a, &b);
if (a==1)
a+=13;
if (b==1)
b+=13;
if (a>b)
printf ("Alice\n");
else if (a<b)
printf ("Bob\n");
else
printf ("Draw\n");
return 0;
}
| 93 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(void) {
int a ,b;
cin >> a >> b;
if(a==b){
cout << "Draw" << endl;
return 0;
}else if (a==1 || a>b && b!=1){
cout << "Alice" << endl;
return 0;
}else if (b==1 || b>a){
cout << "Bob" << endl;
return 0;
}
}
| 100 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
}
else if (A == 1) {
cout << "Alice" << endl;
}
else if (B == 1) {
cout << "Bob" << endl;
}
else if (A > B) {
cout << "Alice" << endl;
}
else {
cout... | 126 |
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 << "Bob";
else if(a == b) cout << "Draw";
else cout <<"Alice";
return 0;
} | 83 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
#include <iomanip>
#include <typeinfo>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <tuple>
#include <map>
#include <set>
#include <numeric>
using n... | 751 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
long long lnA,lnB;
cin >> lnA;
cin >> lnB;
if (1 == lnA)
lnA += 13;
if (1 == lnB)
lnB += 13;
if (lnA > lnB)
cout << "Alice";
else if (lnA == lnB)
cout << "Draw";
else
cout << "Bob";
return 0;
}
| 107 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int a = (A + 11) % 13, b = (B + 11) % 13;
if (a > b) cout << "Alice" << endl;
if (a < b) cout << "Bob" << endl;
if (a == b) cout << "Draw" << endl;
} | 93 |
Project_CodeNet | 2,017 | #include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.... | 477 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<vector>
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";
}
... | 120 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a > b) cout << "Alice";
else if (a < b) cout << "Bob";
else cout << "Draw";
cout << endl;
return 0;
} | 90 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a,b,st[14]={0,13,1,2,3,4,5,6,7,8,9,10,11,12};
cin >> a >> b;
if (st[a]>st[b]) cout << "Alice" << endl;
else if (st[a]<st[b]) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
} | 110 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int A[20];
int main()
{
int a,b;
cin>>a>>b;
int k=0;
for(int i=2;i<=13;i++)
A[i]=++k;
A[1]=++k;
if(A[a]>A[b])
{
cout<<"Alice";
}
else if(A[a]<A[b])
{
cout<<"Bob";
}
else
{
cout<<"Draw";
}... | 116 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) {... | 265 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define... | 250 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template<class T, class U> using P = pair<T,U>;
template<class T> using Heap = priority_queue<T>;
template<class T> using heaP... | 397 |
Project_CodeNet | 2,019 | #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cctype>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdlib>
#include <iomanip>
#include <list>
#incl... | 1,993 |
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";
if (a==b) cout<<"Draw";
if (a<b) cout<<"Bob";
return 0;
} | 72 |
Project_CodeNet | 2,017 | #include <iostream>
int main() {
int a, b;
std::cin >> a >> b;
if (a > b) {
if (b == 1) {
std::cout << "Bob\n";
}
else {
std::cout << "Alice\n";
}
}
else if (a < b) {
if (a == 1) {
std::cout << "Alice\n";
}
... | 131 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,s;
cin >> a>>s ;
if(a==1&&s!=1)
cout << "Alice" << endl;
else if(a!=1&&s==1)
cout << "Bob" << endl;
else if(a<s)
cout << "Bob"<< endl;
else if(a>s)
cout << "Alice" << endl;
else
cout << "Draw" <... | 108 |
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 || b==1) {
if(a==1){
cout << "Alice" << endl;
} else {
cout << "Bob" << endl;
}
} else if(a>b){
cout << "Al... | 120 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main () {
int a, b;
cin >> a >> b;
string ans;
if (a == 1 || b == 1) {
if (a == 1 && b == 1) {
ans = "Draw";
}
else if (a == 1) {
ans = "Alice";
}
else {
ans = "Bob";
}
... | 153 |
Project_CodeNet | 2,017 | #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 || (B!=1 && A>B))
cout << "Alice\n";
else if(B==1 || (A!=1 && B>A))
cout << "Bob\n";
return 0;
}
| 90 |
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++ )
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 ( b ... | 139 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1 && b != 1)
{
cout << "Alice" << endl;
return 0;
}
else if(a != 1 && b == 1)
{
cout << "Bob" << endl;
return 0;
}
if(a >= b)
{
if(a == b)
{
cout << "Draw" << endl;... | 153 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main (){
int a,b;
cin >> a >> b;
if (a == b) {cout<<"Draw"; return 0;}
if (a == 1) {cout<<"Alice"; return 0;}
if (b == 1) {cout<<"Bob"; return 0;}
if (a > b) cout<<"Alice";
if (a < b) cout<<"Bob";
} | 99 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bo... | 613 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int A,B;
int main(){
cin >> A >> B;
if(A==B) cout << "Draw" << endl;
else cout << (((A<B || B==1) && A!=1)? "Bob":"Alice") << endl;
} | 62 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <string>
using namespace std;
//cout << << endl;
typedef long long int ll;
typedef long double ld;
int main(){
ll a,b;
cin >> a >> b;
if (a==1){
a+=13;
}... | 143 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==1)
a=14;
if(b==1)
b=14;
if(a>b)
cout<<"Alice"<<endl;
else if(a==b)
cout<<"Draw"<<endl;
else
cout<<"Bob"<<endl;
return 0;
}
| 92 |
Project_CodeNet | 2,019 | #include <bits/stdc++.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 MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e18;
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(... | 148 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <cctype>
#include <algorithm>
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(... | 127 |
Project_CodeNet | 2,017 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RE... | 394 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
... | 150 |
Project_CodeNet | 2,017 | #include <iostream>
#include <vector>
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 << "Draw" << endl;
else cout << "Bob" << endl;
return 0;
} | 99 |
Project_CodeNet | 2,017 | #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 << "Bob" << endl;
} else if(a == b) {
cout << "Draw" << endl;
} else {
cout << "Alice" << endl;
}
return 0;
} | 101 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <climits>
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 << "Draw" << endl;
else cout << (a > b ? "A... | 116 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <map>
#include <set>
#include <deque>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | 405 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf (1e4)
#define pi acos(-1)
using namespace std;
int main()
{
int a, b;
scanf("%d%d", &a, &b);
if(a == b)
puts("Draw\n");
else
{
if(a == 1)
puts("Alice\n");
else if(b == 1)
... | 133 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <cmath>
#include <vector>
#include <numeric>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
using ll = long long int;
using ul = unsigned long long int;
const ll LL_MAX (1LL<<60);
const ll MOD (100000... | 275 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, n) for(int i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
using vi = vector<int>;
const int MOD = 1e9+7;
bool IsPrime(int num){
if (num < 2) return false;
else if (num == 2) return true;
else if (num % ... | 256 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
if (A == 1) {
if (B == 1) {
printf("Draw\n");
return 0;
} else {
printf("Alice\n");
return 0;
}
}
if (B == 1) {
printf("Bob\n");
return 0;
}
if (A > B) {
printf("Alice\n");
return 0;
} else ... | 154 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x, &y)
#define sc3(x,y,z) scanf("%d%d%d",&x, &y, &z)
#define pr(a) printf("%d\n",a)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define ll long long
#define F first
#define S second
... | 209 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main(){
int A, B;
cin >> A >> B;
if(A == 1)
A = 14;
if(B == 1)
B = 14;
if(A == B)
cout << "Draw" << endl;
if(A > B)
cout << "Alice" << endl;
if(A < B)
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){
A = 14;
}
if(B == 1){
B = 14;
}
if(A == B){
cout << "Draw" << endl;
return 0;
}
else if(A > B){
cout << "Alice" << endl;
return 0;
}
el... | 122 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b)
cout << "Alice" << endl;
else if(a<b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
return 0;
}
| 94 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std ;
int main ()
{
int A, B;
cin >> A>>B;
if (A==B)
cout << "Draw" ;
else if (B==1 )
cout << "Bob" ;
else if (A==1)
cout << "Alice";
else if (A<B)
cout << "Bob" ;
else if (A>B)
cout << "Alice" ;
retu... | 107 |
Project_CodeNet | 2,019 | #include <iostream>
int main() {
int A, B;
std::string res;
std::cin >> A >> B;
if (A == B) res = "Draw";
else if ( A == 1 || B == 1 ) res = (A == 1) ? "Alice" : "Bob";
else res = (A > B) ? "Alice" : "Bob";
std::cout << res << std::endl;
return 0;
} | 105 |
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 if(... | 117 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (long long)(10e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
int main(void)
{
int a, b;
cin >> a >> b;
if(a == 1) a = 14;
if(b == 1) b = 14;
if(a > b) {
cout << "... | 158 |
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)
... | 111 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int A, B;
scanf("%d%d", &A, &B);
int card[13];
for (int i = 0; i < 12; i++) {
card[i] = i + 2;
}
card[12] = 1;
int a, b;
for (int i = 0; i < 13; i++) {
if (card[i] == A) a = i;
if (card[i] == B)... | 174 |
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;
}
| 103 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf(... | 336 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
if(x==y) cout << "Draw" << endl;
else if(y==1) cout << "Bob" << endl;
else if(x==1) cout << "Alice" << endl;
else if(x<y) cout << "Bob" << endl;
else if(x>y) cout << "Alice" << endl;
}
| 95 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a = (a == 1) ? 14 : a;
b = (b == 1) ? 14 : b;
if(a == b) cout << "Draw";
else if(a > b) cout << "Alice";
else cout << "Bob";
cout << endl;
}
| 90 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <sstream>
#include <stack>
#include <map>
#include <set>
#define STARTUP {(cin.tie(0));\
(ios::sync_with_stdio(false));}
#define REP(i... | 475 |
Project_CodeNet | 2,019 | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include<numeric>
using namespace std;
long long gcd(long long a,... | 194 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
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 << "Bob" << endl;
else if(a==b) cout <<"Draw" << endl;
else cout << "Alice" << endl;
} | 89 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a, b, c;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a == 1 || b != 1 &&... | 150 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
int main... | 233 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
int main(int argc, char *argv[])
{
int judge[] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
int a, b;
cin >> a >> b;
if (judge[a] > judge[b])
cout << "Alice";
else if (judge[a] < judge... | 141 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
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) {
if (A == 1) cout <<... | 170 |
Project_CodeNet | 2,019 | // warm heart, wagging tail,and a smile just for you!
//
// ▒█████▒▒
// ██████████▒
// ▒████████████▒
// ██████████████████
// ████████████████████▒
// ▒██████... | 1,058 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii... | 304 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1)
A = 14;
if (B == 1)
B = 14;
if (A > B)
cout << "Alice" << endl;
else if (A == B)
cout << "Draw" << endl;
else
cout << "Bob" << endl;
} | 99 |
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;
}
}
| 92 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
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 = "Bob";
}
else {
ans = "Alice";
}
cout << ans << endl;
} | 112 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)>(b))?(b):(a))
#define ABS(x) ((x>0)?(x):(-(x)))
#define ulli unsigned long long int
#define lli long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se se... | 2,031 |
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;
string ans;
if( a > b ) {
ans = "Alice";
}
if( a < b ) {
ans = "Bob";
}
if( a == b ) {
ans = "Draw";
}
cout << ans << endl;
return 0;
} | 106 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int a,b;
cin >> a >> b;
if(a == 1)a = 100;
if(b == 1)b = 100;
if(a > b)puts("Alice");
else if(a == b)puts("Draw");
else puts("Bob");
}
| 107 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
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";
}
| 99 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.