Submission #7026875
Source Code Expand
#nが総数 n = int(input ()) print(n) d = [int(input()) for i in range(n)] #print(d) d2 = sorted(d) #print(d2) count=1 for i in range(n-1): if( d2[i] < d2[i+1] ): count += 1 print(count)
Submission Info
Submission Time | |
---|---|
Task | B - Kagami Mochi |
User | macho |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 228 Byte |
Status | WA |
Exec Time | 19 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 17 ms | 2936 KB |
a02 | WA | 17 ms | 2940 KB |
a03 | WA | 19 ms | 3060 KB |
b04 | WA | 17 ms | 3060 KB |
b05 | WA | 17 ms | 2940 KB |
b06 | WA | 17 ms | 2940 KB |
b07 | WA | 17 ms | 3060 KB |
b08 | WA | 17 ms | 2940 KB |
b09 | WA | 17 ms | 2940 KB |
b10 | WA | 17 ms | 3060 KB |
b11 | WA | 17 ms | 3060 KB |
b12 | WA | 17 ms | 3060 KB |
b13 | WA | 18 ms | 3060 KB |