Submission #338542

Source Code Expand

A = int(raw_input())
B = int(raw_input())
C = int(raw_input())
sort = [A,B,C]

for i in xrange(len(sort) - 1):
	if sort[i] < sort[i + 1]:
		res = sort[i]
		sort[i] = sort[i + 1]
		sort[i + 1] = res

print sort.index(A) + 1
print sort.index(B) + 1
print sort.index(C) + 1

Submission Info

Submission Time
Task A - 豆まき
User san46
Language Python (2.7.3)
Score 0
Code Size 285 Byte
Status WA
Exec Time 67 ms
Memory 3604 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
WA × 1
AC × 13
WA × 4
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 58 ms 3604 KiB
subtask0-sample02.txt WA 57 ms 3564 KiB
subtask1-01.txt WA 59 ms 3548 KiB
subtask1-02.txt AC 67 ms 3504 KiB
subtask1-03.txt AC 60 ms 3556 KiB
subtask1-04.txt AC 59 ms 3548 KiB
subtask1-05.txt AC 58 ms 3500 KiB
subtask1-06.txt AC 57 ms 3500 KiB
subtask1-07.txt WA 59 ms 3496 KiB
subtask1-08.txt AC 60 ms 3496 KiB
subtask1-09.txt AC 61 ms 3552 KiB
subtask1-10.txt AC 61 ms 3508 KiB
subtask1-11.txt WA 61 ms 3552 KiB
subtask1-12.txt AC 62 ms 3552 KiB
subtask1-13.txt AC 60 ms 3516 KiB
subtask1-14.txt AC 60 ms 3544 KiB
subtask1-15.txt AC 59 ms 3552 KiB