Submission #8,849

2024-02-01 20:20:46

python3

Accepted 45/45

19ms

14128 KiB

N = int(input())
G = []
maximum = 0
nyertes = 0
tarolo = []

for _ in range(N):
    G.append(input())

for i in range(len(G)):
    if int(G[i]) > int(maximum):
        maximum = G[i]
print(maximum)

for i in range(len(G)):
    if (G[i]) == maximum:
        nyertes += 1
        tarolo.append(i+1)

print(nyertes)
for i in range(len(tarolo)):
    print(tarolo[i])

	Sum	Test	Verdict		Time	Memory
base	45/45
		1	Accepted	0/0	17ms	11164 KiB
		2	Accepted	0/0	19ms	11744 KiB
		3	Accepted	3/3	17ms	11872 KiB
		4	Accepted	3/3	17ms	12068 KiB
		5	Accepted	3/3	17ms	12100 KiB
		6	Accepted	3/3	17ms	12360 KiB
		7	Accepted	3/3	17ms	12212 KiB
		8	Accepted	3/3	17ms	12424 KiB
		9	Accepted	3/3	17ms	12836 KiB
		10	Accepted	3/3	19ms	13024 KiB
		11	Accepted	3/3	18ms	13000 KiB
		12	Accepted	3/3	17ms	12744 KiB
		13	Accepted	3/3	18ms	13388 KiB
		14	Accepted	3/3	18ms	13456 KiB
		15	Accepted	3/3	19ms	13872 KiB
		16	Accepted	3/3	19ms	13884 KiB
		17	Accepted	3/3	19ms	14128 KiB