Submission #1240280
Source Code Expand
a = int(input()) b = int(input()) c = int(input()) m = [a,b,c] n = [a,b,c] n.sort(reverse=True) for i in range(0, len(n)): for j in range(0, len(n)): if m[i] == n[j]: print(j + 1)
Submission Info
Submission Time | |
---|---|
Task | A - 豆まき |
User | mute1997 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 216 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt |
All | subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | AC | 18 ms | 3064 KB |
subtask0-sample02.txt | AC | 17 ms | 2940 KB |
subtask1-01.txt | AC | 18 ms | 3060 KB |
subtask1-02.txt | AC | 18 ms | 3060 KB |
subtask1-03.txt | AC | 17 ms | 2940 KB |
subtask1-04.txt | AC | 18 ms | 2940 KB |
subtask1-05.txt | AC | 17 ms | 3060 KB |
subtask1-06.txt | AC | 17 ms | 3060 KB |
subtask1-07.txt | AC | 18 ms | 3060 KB |
subtask1-08.txt | AC | 17 ms | 3060 KB |
subtask1-09.txt | AC | 18 ms | 3060 KB |
subtask1-10.txt | AC | 17 ms | 3064 KB |
subtask1-11.txt | AC | 17 ms | 3064 KB |
subtask1-12.txt | AC | 17 ms | 3060 KB |
subtask1-13.txt | AC | 17 ms | 3060 KB |
subtask1-14.txt | AC | 17 ms | 2940 KB |
subtask1-15.txt | AC | 17 ms | 3060 KB |