Submission #4049851
Source Code Expand
unittest { assert( [ "8 6" ].parse.expand.solve == "Alice" ); assert( [ "1 1" ].parse.expand.solve == "Draw" ); assert( [ "13 1" ].parse.expand.solve == "Bob" ); } import std.conv; import std.range; import std.stdio; import std.typecons; void main() { stdin.byLineCopy.parse.expand.solve.writeln; } auto parse( Range )( Range input ) if( isInputRange!Range && is( ElementType!Range == string ) ) { auto ab = input.front.split.to!( long[] ); return tuple( ab[ 0 ], ab[ 1 ] ); } auto solve( long a, long b ) { if( a == b ) return "Draw"; if( a == 1 ) a = 100; if( b == 1 ) b = 100; return ( b < a ) ? "Alice" : "Bob"; }
Submission Info
Submission Time | |
---|---|
Task | A - One Card Poker |
User | KouMikage |
Language | D (DMD64 v2.070.1) |
Score | 100 |
Code Size | 667 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 |