257962026-03-03 14:26:44Samiko4321Késéspython3Accepted 50/50206ms34616 KiB
N = int(input())
E = list(map(int,input().split()))
D = {}

for i in range(N):
    D[E[i]] = i+1

legkisebb = N

for ido in D.values():
    if ido < legkisebb:
        legkisebb = ido
print(legkisebb)

SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/016ms2868 KiB
2Accepted0/028ms5548 KiB
3Accepted5/516ms3124 KiB
4Accepted5/517ms3112 KiB
5Accepted5/5111ms24100 KiB
6Accepted5/5119ms24064 KiB
7Accepted4/4165ms25032 KiB
8Accepted4/4188ms25060 KiB
9Accepted4/4165ms24852 KiB
10Accepted4/4187ms24844 KiB
11Accepted4/4160ms25060 KiB
12Accepted2/2182ms25000 KiB
13Accepted2/2177ms34616 KiB
14Accepted1/1206ms34492 KiB
15Accepted1/1167ms25004 KiB
16Accepted1/1202ms25004 KiB
17Accepted1/1165ms25000 KiB
18Accepted1/1123ms25004 KiB
19Accepted1/1129ms25004 KiB