Submission #9,830

2024-03-09 19:57:20

python3

Wrong answer 0/100

157ms

40464 KiB

n = int(input())
mezok = input().strip().split()
mezok = list(map(int, mezok))
o = []
for i in range(1,7):
    current_field = 0
    moves = 0
    while current_field<n:
        current_field += i
        if current_field < n:
            current_field += mezok[current_field]
        moves += 1
    
    o.append(moves)
    print(moves)
print(o)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Wrong answer	17ms	11136 KiB
		2	Wrong answer	18ms	11244 KiB
subtask2	0/25
		3	Wrong answer	17ms	11524 KiB
		4	Wrong answer	18ms	11740 KiB
		5	Wrong answer	18ms	12260 KiB
		6	Wrong answer	30ms	12752 KiB
		7	Wrong answer	157ms	16432 KiB
subtask3	0/40
		8	Wrong answer	18ms	12544 KiB
		9	Wrong answer	18ms	13648 KiB
		10	Wrong answer	20ms	14668 KiB
		11	Wrong answer	23ms	16260 KiB
		12	Wrong answer	28ms	19916 KiB
		13	Wrong answer	37ms	24008 KiB
		14	Wrong answer	41ms	28136 KiB
		15	Wrong answer	43ms	29912 KiB
subtask4	0/35
		16	Wrong answer	39ms	15408 KiB
		17	Wrong answer	24ms	17928 KiB
		18	Wrong answer	26ms	21928 KiB
		19	Wrong answer	28ms	24072 KiB
		20	Wrong answer	32ms	22792 KiB
		21	Wrong answer	35ms	29192 KiB
		22	Wrong answer	39ms	32652 KiB
		23	Wrong answer	43ms	36032 KiB
		24	Wrong answer	43ms	30968 KiB
		25	Wrong answer	48ms	40464 KiB