Submission #4668653
Source Code Expand
import sequtils, strutils, math, algorithm, tables var n = parseInt(readLine(stdin)) d: seq[int] ans = 1 d = @[] for i in 0..<n: d.add(parseInt(readLine(stdin))) d = d.sorted(system.cmp[int]) for ind, d_i in d[1..^1]: if d_i > d[ind]: inc(ans) echo ans
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | tattaka |
Language | Nim (0.13.0) |
Score | 200 |
Code Size | 284 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
Hint: system [Processing] Hint: Main [Processing] Hint: sequtils [Processing] Hint: strutils [Processing] Hint: parseutils [Processing] Hint: math [Processing] Hint: times [Processing] Hint: algorithm [Processing] Hint: tables [Processing] Hint: hashes [Processing] Hint: etcpriv [Processing] Hint: [Link] Hint: operation successful (16695 lines compiled; 1.999 sec total; 17.179MB; Release Build) [SuccessX]
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 |