Submission #2249839
Source Code Expand
import std.stdio : readln, writeln; import std.conv : to; import std.string : chomp; import std.range : array, split, repeat; import std.algorithm : map, sort, uniq, count; void main() { (() => readln.split.to!(long[])).repeat(readln.chomp.to!long).map!"a()".array.sort!"a>b".uniq.count.writeln; }
Submission Info
Submission Time | |
---|---|
Task | ABC085B - Kagami Mochi |
User | arkark |
Language | D (DMD64 v2.070.1) |
Score | 200 |
Code Size | 312 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |