Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
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 (b > a) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
return 0;
}
| 116 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::multiset;
using st... | 520 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | 590 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
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 (a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
... | 108 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
typedef pair< int, P > iP;
typedef pair< P, P > PP;
static const int INF = INT_MAX;
static const LL LI... | 254 |
Project_CodeNet | 2,019 | #include<cstdio>
using namespace std;
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a==1)
a=14;
if(b==1)
b=14;
if(a>b)
printf("Alice\n");
else if(a==b)
printf("Draw\n");
else
printf("Bob\n");
return 0;
} | 88 |
Project_CodeNet | 2,019 | #include <cstdio>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if (a == b)
{
puts("Draw");
}
else
{
puts(a == 1 || b != 1 && a > b ? "Alice" : "Bob");
}
return 0;
} | 79 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main () {
int A;
int B;
scanf("%d %d", &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 (B > A) {
cout << "Bob" << endl;
} else {
co... | 138 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} //最大公約数
int lcm(int ... | 1,377 |
Project_CodeNet | 2,018 | #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;
}else{
cout<<"Draw"<<endl;
}
}
| 96 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int a,b;
cin>> a>>b;
if(a==1&&b!=1)
{
cout<<"Alice"<<"\n";
}
else if(b==1 && a!=1)
{
cout <<"Bob"<<"\n";
}
else if(a==b)
{
cout<<"Draw"<<"\n";
}
else if (a... | 146 |
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" << endl;
} | 98 |
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" << 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;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a,b;
cin >> a >> b;... | 211 |
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 << "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 << "B... | 138 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
map<string, int> hand;
cin >> hand["Alice"] >> hand["Bob"];
if (hand["Alice"] == 1) hand["Alice"] += 13;
if (hand["Bob"] == 1) hand["Bob"] += 13;
if (hand["Alice"] > hand["Bob"]) {
cout << "Alice" << endl;
} else if (hand["Alice"] < han... | 143 |
Project_CodeNet | 2,019 | // ABC054
// A - One Card Poker
#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;
}
| 103 |
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==1)cout << "Alice" << endl;
else if (b==1)cout << "Bob" << endl;
else if (a<b)cout << "Bob" << endl;
else if (a>b)cout << "Alice" << endl;
return 0;
} | 99 |
Project_CodeNet | 2,018 | //#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<numeric>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<ctype.h>
#include <fstream>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0... | 249 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
#define ALICE cout << "Alice" << endl
#define BOB cout << "Bob" << endl
#define DRAW cout << "Draw" << endl
class A {
int a, b;
public:
void solve()
{
if (a != b)
{
if (a != 1)
{
if (b != 1)
{
if (a > b) ALICE;
else BOB;
}
else BOB;
... | 154 |
Project_CodeNet | 2,020 | #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 << "Draw" << endl;
}
els... | 149 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A == B) {
cout << "Draw" << endl;
}
else if (A > B) {
cout << "Alice" << endl;
}
else {
cout << "Bob" << endl;
}
retur... | 114 |
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 (a < b)
cout << "Bob";
} | 85 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int a,b;
cin>>a>>b;
if(a==1)a+=13;
if(b==1)b+=13;
if(a>b)cout<<"Alice";
... | 124 |
Project_CodeNet | 2,020 | /*
* cpp_filepath
*/
// C++ 14
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring> // memset
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> ostream & operator << (o... | 231 |
Project_CodeNet | 2,019 | #include <cstdio>
int main()
{
int A,B;
scanf("%d %d", &A, &B);
if (A==B)
{
printf("Draw");
}
else if (A == 1)
{
printf ("Alice");
}
else if (B == 1)
{
printf ("Bob");
}
else if (A>B)
{
printf("A... | 121 |
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";
}
if(A == B){
cout << "Draw";
}
if(A < B){
cout << "Bob";
}
}
else{
if(A == 1 && B != 1){
cout << "Alice";
}
else if(B... | 144 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring... | 826 |
Project_CodeNet | 2,017 | //Author : pakhandi
//
using namespace std;
#include <bits/stdc++.h>
#define wl(n) while(n--)
#define fl(i,a,b) for(i=a; i<b; i++)
#define rev(i,a,b) for(i=a; i>=b; i--)
#define si(n) scanf("%d", &n)
#define sll(l) scanf("%lld",&l)
#define debug(x) cout<<"\n#("<<x<<")#\n"
#define nline printf("\n")
#define mem(a,i... | 278 |
Project_CodeNet | 2,017 | #include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <set>
#include <deque>
#include <utility>
#include <chrono>
#include <sstream>
#include <iomani... | 515 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#d... | 384 |
Project_CodeNet | 2,020 | #ifdef DEBUG
#else
# pragma GCC optimize("O3,no-stack-protector")
# pragma GCC optimize("unroll-loops")
# if __cplusplus < 201703L
# pragma GCC target("avx")
# else
# pragma GCC target("avx2")
# endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x <... | 293 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
... | 318 |
Project_CodeNet | 2,020 | #include <iostream>
#include <bits/stdc++.h>
#include <math.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<<"A... | 121 |
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 << "Draw" << endl;
else if(B > A)
cout << "Bob" << endl;
else if(A > B)
cout << "Alice" << endl;
} | 103 |
Project_CodeNet | 2,020 |
#include <iostream>
using namespace std;
int main()
{
int strong[] = {0, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
int A, B;
cin >> A >> B;
if (strong[A] < strong[B])
cout << "Bob";
else if (strong[B] < strong[A])
cout << "Alice";
else
cout << "Draw";
return 0;
}
| 121 |
Project_CodeNet | 2,020 | #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;
}
}
| 114 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int a, b;
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,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) cout << "Alice" << '\n';
else if (a < b) cout <<... | 200 |
Project_CodeNet | 2,017 | //include <bits/stdc++.h>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <utility>
#include <string>
#include <set>
#include <map>
#include <cassert>
using namespace std;
type... | 409 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#defi... | 233 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == 1)
{
a = 14;
}
if (b == 1)
{
b = 14;
}
if (a == b)
... | 136 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > b && b != 1) {
cout << "Alice" << endl;
}
if (a == b) {
cout << "Draw" << endl;
}
if (a < b && a != 1) {
cout << "Bob" << endl;
}
if (a == 1 && a != b) {
cout << "Alice" << endl;
}
if (b =... | 145 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a += 13;
if (b == 1)
b += 13;
if (a > b)
... | 159 |
Project_CodeNet | 2,019 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <cctype>
#define REP(i,n) for(int i=0; i<(n); ++i)
#define FOR(i,a,b) for(int ... | 310 |
Project_CodeNet | 2,018 | #include<iostream>
#define INF 10000
using namespace std;
int main(){
int a,b;
cin >>a>>b;
if(a==1)a=INF;
if(b==1)b=INF;
if(a<b)cout<<"Bob"<<endl;
else if(a>b)cout<<"Alice"<<endl;
else cout<<"Draw"<<endl;
}
| 78 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int main()
{
int A, B;
cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
} else if (A == 1 || (B != 1 && A > B)) {
cout << "Alice" << endl;
} else {
cout << "... | 131 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A == B) {
cout << "Draw" << endl;
return 0;
}
if (A == 1) {
cout << "Alice" << endl;
return 0;
}
if (B == 1) {
cout << "Bob" << endl;
return 0;
}
if (A > B) {
cout << "Alice" <... | 135 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<... | 687 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==B)
cout<<"Draw"<<endl;
else if(A==1)
cout<<"Alice"<<endl;
else if(B==1)
cout<<"Bob"<<endl;
else if(A-B>0)
cout<<"Alice"<<endl;
else
cout<<"Bob"<<endl;
return 0... | 98 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
string k = "Bob";
if(A == B)
{
k = "Draw";
}
else if(A == 1 ||(B != 1 && A > B))
{
k = "Alice";
}
cout << k << endl;
}
| 81 |
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 << "Bob" << endl;
}else {
if (a > b) {
cout << "Alice" << endl;
}
else
{
cout << "Draw" << endl;
}
}
} | 104 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef un... | 888 |
Project_CodeNet | 2,019 | #include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>
using name... | 265 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout<<"Alice"<<endl;
else if(a<b) cout<<"Bob"<<endl;
else cout<<"Draw"<<endl;
} | 76 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define fr(i1,m) for(int i1=0;i1<m;i1++)
using namespace std;
int main()
{
long n,m;
while(cin>>n>>m)
{
if(n==m)
cout<<"Draw\n";
else if(n==1||n>m&&m!=1)
{
cout<<"Alice\n";
}
else if(m==1||m>n&&n!=1)
cout<<"B... | 119 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a==b) cout << "Draw";
else if (a==1) cout << "Alice";
else if (b==1) cout << "Bob";
else if (a>b) cout << " Alice";
else cout << "Bob";
return 0;
}
| 91 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else if(A==1){
cout<<"Alice"<<endl;
}
else if(B==1){
cout<<"Bob"<<endl;
}
else if(A>B){
cout<<"Alice"<<endl;
}
else{
cout<<"Bob"<<endl;
}
}
| 96 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int al;int bb;
cin>>al>>bb;
if(al==1) al=100;
if(bb==1) bb=100;
if(al==bb) cout<<"Draw\n";
else if(al>bb) cout<<"Alice\n";
else cout<<"Bob\n";
return 0;
} | 72 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1){
if(B!=1){
cout<<"Alice"<<endl;
}else{
cout<<"Draw"<<endl;
}
}else if(B==1){
cout<<"Bob"<<endl;
}else{
if(A>B)cout<<"Alice"<<endl;
else if(A<B)cout<<"Bob"<<endl;
else cout<<"Draw"... | 116 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
using namespace std;
#define INF 2000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
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... | 171 |
Project_CodeNet | 2,017 | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 312 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 if (b < a) ans = "Alice";
cout << ans << endl;
return 0;
} | 106 |
Project_CodeNet | 2,018 | //
// main.cpp
// ProCon
//
// Created by hashimotoryoma on 2017/08/20.
// Copyright © 2017年 hashimotoryoma. All rights reserved.
//
#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < (n); ++ (i)... | 264 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1){
a+=13;
}
if(b==1){
b+=13;
}
if(a>b){
cout << "Alice" << endl;
}else if(a<b){
cout << "Bob" << endl;
}else{
cout << "Draw" << endl;
}
} | 98 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;cin >> a >> b;
if(a == b)cout << "Draw" << endl;
else if(a == 1)cout << "Alice" << endl;
else if(b == 1)cout << "Bob" << endl;
else if(a>b)cout << "Alice" << endl;
else if(b>a)cout << "Bob" << endl;
return 0;
} | 104 |
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;
string ans;
if(A < B) ans = "Bob";
else if(A > B) ans = "Alice";
else ans = "Draw";
cout << ans << endl;
return 0;
} | 99 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a==1) a+=13;
if(b==1) b+=13;
if(a>b) cout << "Alice" << endl;
else if(a==b) cout << "Draw" << endl;
else cout << "Bob" << endl;
} | 82 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1234567;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-3;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
int main(){
int ... | 189 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repa(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define COUT(x) cout << (x) << endl;
#define _GLIBCXX_DEBUG
int main(){
int a, b;
cin >> ... | 185 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
#define int long long
#define ll long long
#define F first
#define S second
#define pb push_back
#define ld long double
using namespace std ;
const int MAXN = 1001 * 1001 , MOD = 1e9 + 7 ;
int32_t main()
{
ios::sync_with_stdio(0) ;
int a , b;
cin >> a >> b ;
if(a==1) a = 14 ;
... | 156 |
Project_CodeNet | 2,019 | #include <iostream>
int main(){
int a, b;
std::cin >> a >> b;
if(1 == a){
a = 14;
}
if(1 == b){
b = 14;
}
if(a > b){
std::cout << "Alice" << std::endl;
}else if(b > a){
std::cout << "Bob" << std::endl;
}else{
std::cout << "Draw" << std::end... | 117 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==B) cout<<"Draw"<<endl;
else if(A==1) cout<<"Alice"<<endl;
else if(B==1) cout<<"Bob"<<endl;
else if(A>B) cout<<"Alice"<<endl;
else if(A<B) cout<<"Bob"<<endl;
} | 89 |
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");
};
if(a<b){
printf("Bob");
};
if(a==b){
printf("Draw");
};
return 0;
};
| 94 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main (void) {
int n, m;
cin >> n >> m;
if (m < n) {
if (m == 1) {
cout << "Bob" << endl;
}else if(n != 1) {
cout << "Alice" << endl;
}
}
if (n < m) {
if (n == 1) {
cout <... | 151 |
Project_CodeNet | 2,019 | #include <iostream>
#include <functional>
using namespace std;
class Card {
int power;
public:
Card(int x) {
power = x == 1 ? 99999 : x;
}
bool operator==(Card other)const {
return ((*this > other) || (*this < other)) == false;
}
bool operator<(Card other)const {
return power < other.power;
}
bool ... | 157 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
void solve() {
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;
}
}
int main() {
std::ios::sync_w... | 131 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int A,B;
cin >> A >> B;
if (A==1) A+=13;
if (B==1) B+=13;
if (A==B)
cout << "Draw" << endl;
else if (A>B)
cout << "Alice" << endl;
else
cout << "Bob" << endl;
} | 98 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a>>b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
cout << "Alice" << endl;
}
else if (a < b) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
return 0;
} | 114 |
Project_CodeNet | 2,017 | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | 240 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep1(i,n) for(int i=1; i<=(n); ++i)
#define repi(i,a,b) for(int i=a; i<=(b); ++i)
#define rrep(i,n) for(int i=(n-1); i>=0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#def... | 387 |
Project_CodeNet | 2,020 | #include <iostream>
using namespace std;
int main()
{
int numbA, numbB;
cin >> numbA >> numbB;
if( numbA == 1)
{
numbA += 13;
}
if( numbB == 1)
{
numbB += 13;
}
if( numbA > numbB)
cout << "Alice";
else if( numbA == numbB)
cout << "Draw";
else
cout << "Bob";
return 0;
}
| 105 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin>>A>>B;
if(A == 1) A = A + 13;
if(B == 1) B = B + 13;
if(A == B) cout<<"Draw"<<endl;
if(A > B) cout<<"Alice"<<endl;
if(A < B) cout<<"Bob"<<endl;
return 0;
} | 98 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a;
cin>>b;
a>0;
b>0;
a<14;
b<14;
if(a==1 and b>1) cout<<"Alice";
if(b==1 and a>1) cout<<"Bob";
if(b>1 and a>b) cout<<"Alice";
if(a>1 and b>a) cout<<"Bob";
if(a==b) cout<<"Draw";
system("pause");
return 0;
} | 107 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
string ans;
if (A == B) ans = "Draw";
else if (A == 1 || (B != 1 && A > B)) ans = "Alice";
else ans = "Bob";
cout << ans << endl;
} | 85 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b != 1 && a > b) {
cout << "Alice" << endl;
} else if (a != 1 && a < b) {
cout << "Bob" << endl;
} else if (a == b) {
cout << "Draw" << endl;
} else if (a == 1 && b != 1) {
co... | 146 |
Project_CodeNet | 2,017 | #include <vector>
#include <map>
#include <string>
#include <iostream>
#include <cmath>
#include <random>
#include <cctype>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define MK make_pair
#define PB push_back
#define VI vector<int>
#define VII vector<int,int>
#define MSI map<string,int>
#define FOR(i,... | 214 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int A,B;
scanf("%d %d",&A,&B);
if(A == 1){
A += 13;
}
if(B == 1){
B += 13;
... | 146 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
int a, b;
cin >> a >> b;
if(a == 1 && b == 1) {
cout << "Draw" << endl;
return 0;
}else if(a ==... | 203 |
Project_CodeNet | 2,020 | #include <iostream>
int main () {
int alice_num, bob_num;
std::cin >> alice_num >> bob_num;
if (alice_num == 1) {
alice_num = 14;
}
if (bob_num == 1) {
bob_num = 14;
}
if (alice_num == bob_num) {
std::cout << "Draw" << std::endl;
} else if (alice_num > bob_num) {
std::cout << "Alice" <... | 133 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
#include<stdio.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;
}
| 80 |
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) {
cout << "Alice" << endl;
}
else if (b == 1) {
cout << "Bob" << endl;
}
else if (a > b) {
cout << "Alice" << endl;... | 131 |
Project_CodeNet | 2,019 | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#define REP(idx, end) for(int idx = 0; idx < end; ++idx)
#define DBG(x) cerr << #x << ": " << x << "\n"
using namespace std;
typedef long long lint;
const int MOD = 100... | 172 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == b){cout << "Draw" << endl;}
else if(a == 1){cout << "Alice" << endl;}
else if(b == 1){cout << "Bob" << endl;}
else if(a>b){cout << "Alice" << endl;}
else if(a<b){cout << "Bob" << endl;}
} | 102 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
int A,B;
cin >> A >> B;
if(A == 1) A += 100;
if(B == 1) B += 100;
if(A > B){
cout << "Alice" << endl;
}
else if(A < B){
cout << "Bob" << endl;
}
else cout << "Draw" << endl;
}
| 105 |
Project_CodeNet | 2,020 | #include <iostream>
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;
} | 102 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int A, B;
cin >> A >> B... | 190 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == 1 && b == 1){
cout << "Draw\n";
}else if(a == 1){
cout << "Alice\n";
}else if(b == 1){
cout << "Bob\n";
}else{
if(a == b){
cout <<"Draw\n";
}else if(a > b){
cout << "Alice\n";
}else{
cout << "Bob\n";
}
... | 121 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <tuple>
#include <cmath>
#include <map>
#include <cstring>
template<typename T> bool chmax( T &a, const T &b ) { if ( a <= b ) { a = b; return ( true ); } else { return ( false );... | 1,599 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
a==1?a=14:a=a;
b==1?b=14:b=b;
cout << (a>b?"Alice":a<b?"Bob":"Draw") << endl;
}
| 63 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.