Submission #1102879
Source Code Expand
//This is getting accepted! // I HATE BUG // God Of The Bugs // 12/11/2016 #include<bits/stdc++.h> using namespace std; #define ms(s, n) memset(s, n, sizeof(s)) #define FI first #define SE second #define pb push_back #define mp make_pair #define ll long long #define sz(a) ((int)(a).size()) #define __builtin_popcount __builtin_popcounll #define ld long double typedef pair<int, int> pii; typedef pair<double, double> pdd; typedef pair<int, pii> ppi; const double PI = acos(0) * 2; const double EPS = 1e-8; const ll MOD = 1e9 + 7; const int MAXN = 1e5 + 5; const int oo = 1e9; const double foo = 1e30; template<class T> int getbit(T s, int i) { return (s >> i) & 1; } template<class T> T onbit(T s, int i) { return s | (T(1) << i); } template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template<class T> int cntbit(T s) { return __builtin_popcounll(s);} template<class T> T sqr(T x) { return x * x; } inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;} inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;} inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;} int main() { //#ifndef ONLINE_JUDGE // freopen("inp.txt", "r", stdin); //// freopen("out.txt", "w", stdout); //#endif int a, b; cin >> a >> b; if (a == 1) a = 14; if (b == 1) b = 14; if (a > b) { cout << "Alice"; } else if (a < b) { cout << "Bob"; } else { cout << "Draw"; } }
Submission Info
Submission Time | |
---|---|
Task | A - One Card Poker |
User | transcompany |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1526 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |