Submission #1873181
Source Code Expand
#include <iostream> #include <algorithm> #include <queue> #include <vector> using namespace std; typedef long long ll; typedef struct pair<int,int> P; typedef struct pair<int,P> P2; ll d[1001]={}; int a[100001]={}; int main() { int a,b; cin>>a>>b; if(a==b){ cout<<"Draw"<<endl; }else if((a==1)&&(b==13)){ cout<<"Alice"<<endl; }else if((a==13)&&(b==1)){ cout<<"Bob"<<endl; }else if(a>b){ cout<<"Alice"<<endl; }else{ cout<<"Bob"<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - One Card Poker |
User | fgtohru |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 499 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 |