Submission #1587593
Source Code Expand
#include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long ll;
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define SIZE(array) (sizeof(array) / sizeof(array[0]))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define MAX_V 100000
#define MOD 1000000007L
#define INF 100000000000
signed main() {
int a, b;
cin >> a >> b;
vector<int> k = { 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1 };
string res = "Draw";
if (a != b) {
res = find(k.begin(), k.end(), a) > find(k.begin(), k.end(), b) ? "Alice" : "Bob";
}
cout << res << endl;
}
Submission Info
Submission Time |
|
Task |
A - One Card Poker |
User |
elzup |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
691 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 |