Submission #1232884
Source Code Expand
import sys def solve(): abc = [(int(input()), i) for i in range(3)] abc.sort(reverse=True) rank = [0] * 3 for i, (a, j) in enumerate(abc, start=1): rank[j] = i print(*rank, sep='\n') if __name__ == '__main__': solve()
Submission Info
Submission Time | |
---|---|
Task | A - 豆まき |
User | nanae |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 266 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 3316 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 | 20 ms | 3316 KB |
subtask0-sample02.txt | AC | 17 ms | 2940 KB |
subtask1-01.txt | AC | 17 ms | 2940 KB |
subtask1-02.txt | AC | 17 ms | 2940 KB |
subtask1-03.txt | AC | 17 ms | 2940 KB |
subtask1-04.txt | AC | 16 ms | 2940 KB |
subtask1-05.txt | AC | 16 ms | 3060 KB |
subtask1-06.txt | AC | 17 ms | 3060 KB |
subtask1-07.txt | AC | 17 ms | 3060 KB |
subtask1-08.txt | AC | 17 ms | 3060 KB |
subtask1-09.txt | AC | 16 ms | 2940 KB |
subtask1-10.txt | AC | 16 ms | 2940 KB |
subtask1-11.txt | AC | 17 ms | 3060 KB |
subtask1-12.txt | AC | 17 ms | 3060 KB |
subtask1-13.txt | AC | 17 ms | 2940 KB |
subtask1-14.txt | AC | 17 ms | 3060 KB |
subtask1-15.txt | AC | 16 ms | 3060 KB |