Submission #18,528

2025-10-25 20:20:54

python3

Accepted 80/80

74ms

15188 KiB

N = int(input())
T = list(map(int,input().split()))
D = {}
i = 0
while i < N:
    if T[i] not in D:
        D[T[i]] = 1
    else:
        D[T[i]] += 1
    i += T[i]
print(sum([x for x in D.values()]))
maxD = max([x for x in D.values()])
for kulcs,ertek in D.items():
    if ertek == maxD:
        print(kulcs)
        break

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	16ms	3124 KiB
		2	Accepted	0/0	16ms	3124 KiB
		3	Accepted	4/4	16ms	3124 KiB
		4	Accepted	4/4	16ms	3120 KiB
		5	Accepted	4/4	16ms	3324 KiB
		6	Accepted	4/4	16ms	3128 KiB
		7	Accepted	4/4	16ms	3032 KiB
		8	Accepted	4/4	16ms	3140 KiB
		9	Accepted	4/4	17ms	3076 KiB
		10	Accepted	4/4	17ms	3120 KiB
		11	Accepted	4/4	17ms	3132 KiB
		12	Accepted	4/4	17ms	3120 KiB
		13	Accepted	4/4	18ms	3636 KiB
		14	Accepted	4/4	18ms	3892 KiB
		15	Accepted	4/4	19ms	4492 KiB
		16	Accepted	4/4	20ms	3808 KiB
		17	Accepted	4/4	30ms	6704 KiB
		18	Accepted	4/4	74ms	5220 KiB
		19	Accepted	4/4	45ms	13112 KiB
		20	Accepted	4/4	41ms	14344 KiB
		21	Accepted	4/4	48ms	15188 KiB
		22	Accepted	4/4	41ms	9008 KiB