Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 1,154 |
Project_CodeNet | 2,020 | //include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.s... | 557 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define int long
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
main() {
int A,B; cin >> A >> B;
if(A==B)cout << "Draw" << endl;
else if(A==1 || A>B && B!=1) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
}
| 105 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == b) {
cout << "Draw";
} else {
if (a == 1) cout << "Alice";
else if (b == 1) cout << "Bob";
else cout ... | 130 |
Project_CodeNet | 2,018 | #include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <set>
#include <algorithm>
#include <unordered_map>
#include <queue>
#include <iomanip>
#include <map>
#include <utility>
#include <numeric>
#include <chrono>
#include <ctime>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define P pa... | 247 |
Project_CodeNet | 2,018 | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<array>
#include<vector>
#include<functional>
#include<unordered_map>
#include<map>
#include<numeric>
#include<limits>
#include<utility>
#include<queue>
#include<random>
#include<math.h>
using namespace std;
int main() {
int A,B;
cin >>... | 142 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include<algorithm>
#include<math.h>
using namespace std;
template <class T> using V = vector<T>;
using ll = long long;
using db = double;
using st = string;
using ch = char;
using vll = V<ll>;
using vpll =V<pair<ll,ll>>;
using vst = V<st>;
using vdb = V<db>;
using vch = V<ch>;
#define ... | 513 |
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)
{
cout<<"Alice"<<endl;
}
else if(a<b && a !=1)
{
cout<<"Bob"<<endl;
}
else if(a>b && b==1)
{
cout<<"B... | 134 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>()))>>
: std::true_type {};
template <typenam... | 1,122 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int fetch_card()
{
int card;
cin >> card;
if (card == 1)
{
card += 13;
}
return card;
}
int main()
{
int a = fetch_card();
int b = fetch_card();
if (a > b)
{
cout << "Alice" << endl;
}
else if (a < b)
{
cout << "Bob" << endl;
}
e... | 124 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1)
a = 14;
if (b == 1)
b = 14;
if (a > b)
cout << "Alice" << endl;
else if (a < b)
cout << "Bob" << endl;
else
cout << "Draw" << endl;
}
| 102 |
Project_CodeNet | 2,018 | #include <iostream>
int main() { int a, b;
std::cin >> a >> b;
if(a == 1) a=14;
if(b == 1) b=14;
std::cout << (a > b ? "Alice" : (a == b ? "Draw" : "Bob")) << std::endl;
return 0;
} | 81 |
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 << "Bob" << endl;
}
else if(A>B){
cout << "Alice" << endl;
}
else{
cout << "Draw" << endl;
}
}
| 100 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例：sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.... | 578 |
Project_CodeNet | 2,019 | //054A
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b=0;
cin >> a >> b;
if (a==1){
a = 14;
}
if (b==1){
b = 14;
}
if (a>b){
cout << "Alice";
}else if(a==b){
cout << "Draw";
}else{
cout << "Bob";
}
} | 103 |
Project_CodeNet | 2,017 | //I_F_A
#include "bits/stdc++.h"
using namespace std;
int main(){
long long a,b;
cin >> a >> b;
if(a == 1)
a = INT_MAX;
if(b == 1)
b = INT_MAX;
if(a > b)
cout << "Alice\n";
if(b > a)
cout << "Bob\n";
if(a == b)
cout << "Draw\n";
} | 91 |
Project_CodeNet | 2,020 | #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 << "Alice" << endl;
} else if (b > a) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
} | 116 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A > B && B != 1 || (A != B && A == 1))cout << "Alice" << endl;
else if (B > A && A != 1|| (A != B && B == 1))cout << "Bob" << endl;
else cout << "Draw" << endl;
}
| 105 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
using namespace std;
using ll = long long;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else if(a != 1 && b != 1){
if(a > b) cou... | 127 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main() {
// your code goes here
int a,b;
cin>>a>>b;
if(a==1){
a=14;
}
if(b==1){
b=14;
}
if(a<b){
cout<<"Bob"<<endl;
}else if(b<a){
cout<<"Alice"<<endl;
}else{
cout<<"Draw"<<endl;
}
return 0;
} | 94 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b;
cin>>a>>b;
if(a==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{
... | 124 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1 && b != 1){
cout << "Alice" << endl;}
else if(a != 1 && b == 1){
cout << "Bob" << endl;}
else if(a < b && a != 1){
cout << "Bob" << endl;}
else if(a > b && b != 1){
cout << "Alice" << endl;}
else{
cou... | 127 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | 270 |
Project_CodeNet | 2,017 | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb... | 325 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define ALL(a) begin((a)), end((a))
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RFOR(i, a, b) for (int(i) = (a); (i) > (b); (i)--)
#define debug(x) cerr << #x << " : " << x << '\n'
const int INF = 1e9;
const int MOD = 1e9 + 7;
... | 269 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
#define REPI(i, n) for(int i = 0; i < n; i++)
#define REPJ(j, n) for(int j = 0; j < n; j++)
using ll = long long;
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int a, b; cin >> a >> b;
if(a == 1)a+=13; if(b == 1)b+=13;
cout << (a == b ? "Draw" ... | 129 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if(a>b){
if(b==1){
cout<<"Bob"<<endl;
}
else{
cout<<"Alice"<<endl;
}
}
else if(a==b){
cout<<"Draw"<<endl;
}
else{
if(a==1){
cout<<"Alice"<<endl;
}
else{
cout<<"Bob"<<endl;
}
}
return 0;
}
| 112 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
const int inf = 1LL << 55;
con... | 225 |
Project_CodeNet | 2,019 | #include<stdio.h>
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("Alice");
} else {
printf("Bob");
}
return 0;
}
| 100 |
Project_CodeNet | 2,019 | #include "bits/stdc++.h"
using namespace std;
int main(void){
string ans;
int n[2];
cin >> n[0] >>n[1];
for (int i=0;i<2;i++){
if (n[i] == 1)
n[i] = 50;
}
if (n[0]>n[1])
ans = "Alice";
else if (n[0]<n[1])
ans = "Bob";
else
ans = "Draw";
cout << ans << endl;
} | 121 |
Project_CodeNet | 2,017 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#define ll long long
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";
} else if (a < b){
... | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//定数
const long long MOD1=1000000007;
const long long MOD2=998244353;
const long long INF=1152921504606846976;
const long double PI=3.1415926535897932;
//型名省略
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<long long,long long>
... | 1,255 |
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) cout << "Alice" << endl;
else if (A != 1 && B == 1)cout << "Bob" << endl;
else if (A > B) cout << "Alice" << endl;
else if (... | 129 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define rREP(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))
#define all(x) (x).begin(),(x).end()
#define out(y,x,h,w) (y)<0||(x)<0||(y)>=(h)||(x)>=(w)
constexpr int INF = 100... | 349 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#define ll long long
using namespace std;
int main() {
int a, b;
string ans;
cin >> a >> b;
if (a == b) {
ans = "Draw";
} else if (a == 1 && b != 1) {
ans = "Alice";
} else if (b == 1) {
ans = "Bob";
} else if (a ... | 138 |
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;
}
if(A < B){
cout << "Bob" << endl;
}
e... | 120 |
Project_CodeNet | 2,020 | /*
* wafuIroha.cpp
*
* Created on: 2020/02/23
* Author: black
*/
#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 << "Draw" << endl;
}
else if (a < b){
cout << "Bob" << endl;
}
else{
cout << "Ali... | 134 |
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";
return 0;
}
cout << "Alice";
return 0;
}
if (b == 1)
{
cout << "Bob";
return 0;
... | 141 |
Project_CodeNet | 2,019 | #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;
}
else if(A > B){
cout << "Alice" << endl;
}
else{
cout << "Bob" << endl;
}
}
| 111 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <map>
using namespace std;
string judge( int a, int b ){
if( a == b )
return "Draw";
if( a != 1 && b != 1 && a > b )
return "Alice";
if( a != 1 && b != 1 && b > a )
return "Bob";
if( a == 1 && b != 1)
return "Alice";
if( b == 1 && a != 1)
return "Bob";
... | 146 |
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 << "Alice" << endl;
else if (a == b)cout << "Draw" << endl;
else cout << "Bob" << endl;
} | 92 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main() {
int power[] = {12, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
int A, B;
cin >> A >> B;
if (power[A - 1] > power[B - 1]) cout << "Alice";
else if (power[A - 1] < power[B - 1]) cout << "Bob";
else cout << "Draw";
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とか... | 223 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
using ch = char;
using st = string;
int main(void){
st a,b;
cin >> a >> b;
// cout << "a, b: " << a << b << endl;
if(a == "1" && b == "1"){
cout << "Draw" << endl;
return 0;
}else if(b == "1"){
cout << "Bob" << endl;
retu... | 182 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a > b) {
cout << "Alice" << endl;
} else if (a < b) {
cout << "Bob" << endl;
} else if (a == b) {
cout << "Draw" << endl;
}
} | 120 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef complex<double> com;
#define endl '\n'
#define eb emplace_back
#d... | 334 |
Project_CodeNet | 2,018 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 555 |
Project_CodeNet | 2,017 | #include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a == b)
cout << "Draw";
else
if (a == 1)
cout << "Alice";
else
if (b == 1)
cout << "Bob";
else
if (a > b)
cout << "Alice";
else
cout << "Bob";
cin >> a;
return 0;
} | 101 |
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" << endl;
else if (a > b) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 100 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0; i<(ll)(n); i++)
#define FOR(i,n,m) for (ll i=n; i<(ll)(m); i++)
#define pb push_back
#define INF 1000000007LL
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int,int> p;
int dy[4]={-1,1,0,0};
int dx[4]={0,0,1,-1};
int... | 227 |
Project_CodeNet | 2,019 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <climits>
#include <math.h>
#include <utility>
#include <ctime>
#include <cstdlib>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<long lon... | 234 |
Project_CodeNet | 2,019 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#includ... | 1,769 |
Project_CodeNet | 2,019 | #include<iostream>
using namespace std;
string judge(int a, int b) {
if (a > b) {
return "Alice";
} else if (a < b){
return "Bob";
}
return "Draw";
}
int main(){
int a, b; cin >> a >> b;
if (a == 1) {a+=13;}
if (b == 1) {b+=13;}
cout << judge(a,b) << endl;
return 0;... | 108 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int d... | 435 |
Project_CodeNet | 2,018 | #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a=(a+12)%14;
b=(b+12)%14;
// cout<<a<<"#"<<b<<endl;
if(a<b){
cout<<"Bob";
}else if(b<a){
cout<<"Alice";
}else{
cout<<"Draw";
}
return 0;
} | 82 |
Project_CodeNet | 2,019 | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >>A>>B;
string ans;
if(A==1) A=14;
if(B==1) B=14;
if(A==B) ans = "Draw";
else if(A>B) ans = "Alice";
else if(A<B) ans = "Bob";
cout <<ans<<endl;
}
| 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" << 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;
}
} | 119 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b==1)
cout<<"Draw";
else if (a == 1 )
{
cout<<"Alice";
}
else if(b==1){
cout<<"Bob";
}
else if(a>b)
{
cout<<"Alice";
}
... | 122 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#include <stdio.h>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#d... | 471 |
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 and B!=1) {
if (A>B) cout << "Alice\n";
else cout << "Bob\n";
}
else if (A==1) cout << "Alice\n";
else cout << "Bob\n";
} | 99 |
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<<"Bob"<<endl;
} | 85 |
Project_CodeNet | 2,017 | #include <cstdlib>
#include <cmath>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <list>
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
using namespace std;
typedef pair<in... | 149 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b;
string ans;
cin >> a >> b;
if(a==b){
ans = "Draw";
}else if(a<b && a!=1 || b==1){
ans = "Bob";
}else{
ans = "Alice";
}
cout << ans << endl;
} | 88 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
#define ll long long
#define REP(i, n) for (ll (i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (ll (i) = (a); (i) < (b); (i)++)
#define int long long
using namespace std;
using P = pair<int, int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
signed main() {
... | 208 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a == b)
cout <<... | 136 |
Project_CodeNet | 2,017 | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a > b)
cout << "Alice";
else if (a < b)
cout << "Bob";
else
cout << "Draw";
cout << endl;
}
| 88 |
Project_CodeNet | 2,017 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int a, b,c;
cin >> a >> b;
if (a == 1 || b == 1){
if (a < b){ c = 1; }
if (a == b){ c = 0; }
if (a > b){ c = 2; }
}
else{
if (a > b){ c = 1; }
if (a == b){ c = 0; }
if (a < b){ c = 2; }
}
if ... | 180 |
Project_CodeNet | 2,017 | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <iomanip>
using namespace std;
#define ll long long
#def... | 295 |
Project_CodeNet | 2,018 | #include<iostream>
#include<cstring>
using namespace std;
int main(void)
{
int numA, numB;
cin >> numA >> numB;
if (numA == numB) {
cout << "Draw" << endl;
}
else if (numA == 1) {
cout << "Alice" << endl;
}
else if (numB == 1) {
cout << "Bob" << endl;
}
else if (numA > numB) {
cout << "Alice" << endl... | 128 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i, a, b) for(ll (i) = (a); (i) < (b);++i)
ll gcd(ll x, ll y)
{
if (x % y == 0)
{
return y;
... | 313 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
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;
}
| 101 |
Project_CodeNet | 2,018 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (--a) a -= 13;
if (--b) b -= 13;
if (a > b) cout << "Alice" << endl;
else if (a < b) cout << "Bob" << endl;
else cout << "Draw" << endl;
return 0;
}
| 92 |
Project_CodeNet | 2,018 | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
//#include<unordered_set>
#include<bitset>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout<< #X ... | 203 |
Project_CodeNet | 2,018 | //abc054_a.cpp
//Fri Oct 19 23:08:11 2018
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
... | 188 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define dcout cout << fixed << setprecision(15)
#define arep(i, a) for(auto i : a)
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
#define MOD 1000000007
#define INF 10000000000
#de... | 199 |
Project_CodeNet | 2,018 | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if(a == 1) cout << "Alice" << endl;
else if(b == 1) cout << "Bob" << endl;
else if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
return 0;
}
| 107 |
Project_CodeNet | 2,019 | #include<math.h>
#include<map>
#include<iostream>
#include <algorithm>
#include <string>
#include<vector>
#include<array>
#include<tuple>
#include<queue>
#include<stack>
#include<iomanip>
#include<bitset>
#include <list>
#include<numeric>
//AtCoderC++.cpp
using namespace std;
inline int ceileing(int a, int b) {retur... | 204 |
Project_CodeNet | 2,019 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
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;
} | 105 |
Project_CodeNet | 2,019 | #include <iostream>
using namespace std;
int main(void){
int A, B;
cin >> A >> B;
// 判定：最強が 1 により 1 を 14 に変えることで数字で見ても最強に変える
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 <... | 141 |
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 << "Bob" << endl;
}
}
... | 113 |
Project_CodeNet | 2,017 | #include<bits/stdc++.h>
using namespace std;
int main(){
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 <<"Alice\n";
}
else if(B > A){
cout << "Bob\n";
}
else if(A == B){
cout << "Draw... | 116 |
Project_CodeNet | 2,017 | #include<iostream>
#include<cstdio>
using namespace std;
int a,b;
int main()
{
scanf("%d%d",&a,&b);
a+=(a==1)?13:0;b+=(b==1)?13:0;
printf((a>b)?"Alice":((a<b)?"Bob":"Draw"));
return 0;
} | 70 |
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(b==1)
cout<<"Bob"<<endl;
if(a==1)
cout<<"Alice"<<endl;
if(a!=1&&b!=1){
if(a>b)
cout<<"Alice"<<endl;
if(b>a)
cout<<"Bob"<<endl;
}
}... | 108 |
Project_CodeNet | 2,017 | #include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <functional>
#pragma warning(disable : 4996)
using namespace std;
int A, B;
int main() {
cin >> A >> B;
if (A == 1) A = 14;
if (B == 1) B = 14;
if (A > B) puts("Alice");
if (A < B) puts("Bob");... | 115 |
Project_CodeNet | 2,019 | #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<b){
if(a!=1){
cout << "Bob" << endl;
return 0;
}else{
cout << "Alice" << e... | 155 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a != 1 && b != 1){
if(a < b){
cout << "Bob" << endl;
}
else if(a == b){
cout << "Draw" << endl;
}
else{
cout << "Alice" << endl;
}
}
else if(a == 1 || b == 1){
i... | 173 |
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 << "Draw\n";
} else if (a > b) {
cout << "Alice\n";
} else {
cout << "Bob\n";
}
} | 105 |
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 (B>A) {
cout << "Bob" << endl;
}
else {
cout << "Draw" << endl;
}
} | 102 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<limits>
#include<numeric>
#include<type_traits>
#include<math.h>
#include<fstream>
#include<set>
#include<queue>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
#define rep(i, n)... | 292 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
#include<stack>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
int a,... | 189 |
Project_CodeNet | 2,019 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for(int i = m; i < n; i++)
#define INF INT_MAX
#define MOD 100000000... | 412 |
Project_CodeNet | 2,018 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include "bits/stdc++.h"
typedef long long ll;
using namespace std;
#define FOR(i,n) for(ll i=0;i<n;i++)
#define RFOR(i,... | 189 |
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 if (a < b)
cout << "Bob" << endl;
... | 118 |
Project_CodeNet | 2,018 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> V;
int main() {
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) dump("Alice");
else if (a < b) dump("Bob");
else dump("Draw");... | 120 |
Project_CodeNet | 2,017 | #include <bits/stdc++.h>
using namespace std;
#define mp(x, y) make_pair((x), (y))
typedef long long ll;
int a, b;
int main()
{
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 {
pr... | 123 |
Project_CodeNet | 2,018 | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#define REP(n) for(int i = 0;i < n;i++)
#define LLREP(n) for(long long int i = 0;i < n;i++)
typedef long long int ll;
using namespace std;
#define MAX_A 1000000007
int main(){
int a,b;
cin >> a >> b;... | 186 |
Project_CodeNet | 2,018 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include "bits/stdc++.h"
using nam... | 232 |
Project_CodeNet | 2,019 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
vector<int> vec = {13,1,2,3,4,5,6,7,8,9,10,11,12};
if (vec.at(A-1) == vec.at(B-1)) cout << "Draw" << endl;
else if (vec.at(A-1) > vec.at(B-1)) cout << "Alice" << endl;
else cout << "Bob" << endl;
return 0;
} | 128 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n;i++)
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 <<... | 123 |
Project_CodeNet | 2,019 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, ... | 339 |
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(b<a){
cout<<"Alice"<<endl;
}else{
cout<<"Draw"<<endl;
}
return 0;
} | 93 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.