Problem:


Score : 300 points

Problem Statement

Takahashi is a teacher responsible for a class of N students.

The students are given distinct student numbers from 1 to N.

Today, all the students entered the classroom at different times.

According to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).

From these records, reconstruct the order in which the students entered the classroom.

Constraints

 1 \le N \le 10^5 

 1 \le A_i \le N 

 A_i \neq A_j  (i \neq j)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \ldots A_N

Output

Print the student numbers of the students in the order the students entered the classroom.

Sample Input 1

3
2 3 1

Sample Output 1

3 1 2

First, student number 3 entered the classroom.

Then, student number 1 entered the classroom.

Finally, student number 2 entered the classroom.

Sample Input 2

5
1 2 3 4 5

Sample Output 2

1 2 3 4 5

Sample Input 3

8
8 2 7 3 4 5 6 1

Sample Output 3

8 2 4 5 6 7 3 1



Sample input:
3
2 3 1


Sample output:
3 1 2

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
Ali = list(map(int,input().split()))
L = sorted(Ali)
li = []
[li.append(Ali.index(L[i])+1) for i in range(N)]

print(' '.join(map(str, li)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
array = list(map(int,input().split()))

for i in range(1,N+1):
  for num in array:
    if i == num:
      print(array.index(num)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
caps = list(map(int, input().split()))
out = [caps.index(i+1)+1 for i in range(N)]
print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
Alist = input().split()
Alist = list(map(int,Alist))
Result = []
for i in range(1,n+1):
    Result.append(Alist.index(i)+1)
for i in range(0,n):
    print(Result[i])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a_list = list(map(int,input().split()))
ans_list = []
for i in range(1,n + 1):
  ans_list.append(a_list.index(i) + 1)
for i in ans_list:
    print(i, end = ' ')

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))


L=[str(a.index(i)+1) for i in range(1,n+1)]
L=" ".join(L)
print(L)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = sorted(A)
for i in range (0,N):
  print(A.index(B[i]) + 1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))

for i in range(N):
    print(A.index(i+1) +1, end =' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()]

l = []
A2 = sorted(A)
for i in range(N):
    a = A2[i]
    idx = A.index(a)
    l.append(idx + 1)
print(*l)

Submission status: Time Limit Exceeded

Solution code:
N = input()
N = int(N)

A = input().split()
for i in range(1, N+1):
    print(A.index(str(i))+1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
import sys


def main():
    n = int(input())
    a = [int(i) for i in sys.stdin.readline().split()]
    ans = []
    ans_append = ans.append
    for i in range(n):
        ans_append(a.index(i + 1) + 1)
    print(*ans)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = list(map(int, input().split()))

for i in range(1,N+1):
    #ans = a.index(i) + 1
    print(a.index(i) + 1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = list()
for i in range(n+1):
    if i==0:
        continue
    else:
        c = a.index(i)
        c = c+1
        b.append(c)
for j in b:       
    print(j,end=' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []

for x in range(1,N+1):
    m = A.index(x) + 1
    B.append(str(m))
print(" ".join(B))

Submission status: Time Limit Exceeded

Solution code:
n = input()
a = list(map(int, input().split()))

dict = {}
ni=1
for ai in list(a):
    dict[ai] = ni
    ni = ni +1

ans = ''
for x in dict.values():
    ans = ans + str(x)+ ' '

print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
h = list(map(int, input().split()))
for i in range(1, n+1):
  print(h.index(i)+1, end =  " ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))

aa = [str(A.index(x)+1) for x in range(1,N+1)]
print(" ".join(aa))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
Alist = input().split()
Alist = list(map(int,Alist))
Result = []
for i in range(1,n+1):
    Result.append(Alist.index(i)+1)
for i in range(0,n):
    print(Result[i],end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))

result = []

for i in range(N):
    ind = A.index(min(A))
    result.append(str(ind+1))
    A[ind] = N + 1

print(" ".join(result))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
caps = list(map(int, input().split()))
out = [caps.index(i+1)+1 for i in range(N)]
print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

Solution code:
import sys
#n = int(input())
n = int(sys.stdin.readline())
#A = list(map(int,input().split()))
A = list(map(int,sys.stdin.readline().split()))
for i in range(n):
  print(A.index(i+1) + 1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = 0

for i in range(N):
    print(A.index(i+1)+1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = input()
    a = input().split(" ")
    r = ""
    for i in range(len(a)):
        r += str(a.index(str(i+1)) + 1) + " "
    print(r[:-1])
if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = [int(i) for i in input().split()]
b = sorted(a)

l = [a.index(i)+1 for i in b]

  
print(*l)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
students = [int(x) for x in input().split()]
for i in range(1, N + 1):
    trun = students.index(i) + 1
    print(str(trun) + ' ', end ='')
print()

Submission status: Time Limit Exceeded

Solution code:
def stud(n,a):
    j=1
    p=[]
    while j!=n+1:
        p.append(a.index(j)+1)
        j+=1
    return p

n=int(input())
a=list(map(int, input().split()))
q=stud(n,a)
print(*q)

Submission status: Time Limit Exceeded

Solution code:

def main():

    n = int(input())
    a = list(map(int, input().split()))

    ans = []

    i = 1
    while (i <= n):
        ans.append(a.index(i)+1)
        i += 1

    for j in range(len(ans)):
        print(ans[j], end=" ")


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))

T = []
for i in range(N):
    for j in range(N):
        if A[j] == i+1:
            T.append(j+1)
       
print(*T)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = {(i+1):int(j) for i, j in enumerate(input().split())}
A_sorted = sum(map(list, sorted(A.items(), key=lambda x:x[1])), [])
t = A_sorted[0::2]
print(*t, sep=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
    b.append((a.index(i+1))+1)
print(*b)

Submission status: Time Limit Exceeded

Solution code:
if __name__ == '__main__':
    n = int(input())
    a = [int(i) for i in input().split()]
    ans = {}
    for i in range(n):
        ans[a[i]-1] = i+1
    ans_str =""
    for i in range(n):
        if ans_str =="":
            ans_str = str(ans[i])
        else:
            ans_str = ans_str+" "+str(ans[i])
    print(ans_str)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
lis = list(map(int, input().split()))
print(*[1+lis.index(i) for i in range(1, n+1)])

Submission status: Time Limit Exceeded

Solution code:
import heapq
x = int(input())
y = [int(x) for x in input().split()]
z=y.copy()
heapq.heapify(y)
for i in range(x):
  print(z.index(heapq.heappop(y))+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
N = input()
N = int(N)

A = input().split()
for i in range(len(A)):
    print(A.index(str(i+1))+1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = 0
answer =[]

for i in range(N):
    B = A.index(i+1) + 1
    answer.append(B)
    print(answer[i], end=" ")

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-

def GoToSchool(N, a):
    attend_list = []
    for i in range(1,N+1):
        attend_list.append(a.index(i)+1)
    return " ".join(map(str,attend_list))

if __name__ == "__main__":
    N = int(input())
    a = list(map(int,input().split()))
    print(GoToSchool(N,a))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
c = [0]*N

for i in range(N):
    c[i] = A.index(i+1)+1
print(' '.join(map(str, c)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = []

for i in range(N):
  List.append(str(A.index(i+1)+1))



print(' '.join(List))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()]

l = []
AA = A.copy()

for k in range(N):
    Amin = min(AA)
    #print(Amin)
    a = A.index(Amin)
    l.append(a + 1)
    AA.remove(Amin)
print(*l)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = list(range(1, N+1))

for i in range(0, N):
    for j in range(N-1, i, -1):
        if A[j] < A[j-1]:
            A[j], A[j-1] = A[j-1], A[j]
            ans[j], ans[j-1] = ans[j-1], ans[j]

print(*ans, sep=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A = list([int(x) for x in input().split()])
for i in range(len(A)):
  if(i!=0):
    print(" ",end="")
  print(A.index(i+1)+1,end="")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

a = list(map(int,list(input().split(" "))))

i=0
list = []

for a_s in a:
    length = len(a)
    x = a.index((length) - i) + 1
    list.insert(0, x)
    i += 1

print(*list)

Submission status: Time Limit Exceeded

Solution code:
N, A = int(input()), list(map(int, input().split()))
X = []
for i in range(N):
	P = -1
	for j in range(N):
		if (P == -1 or A[j] > A[P]): P = j
	X.append(P + 1)
	A[P] = 0
X.reverse()
print(' '.join([str(x) for x in X]))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().rstrip().split()
i = 0
j = 0
ans = []

for i in range(int(n)):
    for j in range(int(n)):
        if int(i) + 1 == int(a[j]):
            ans.append(int(j) + 1)
            
for k in range(int(n)):
    print(ans[k] , end = " ")

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=list(map(int,input().split()))
o=[]
for i in range(N):
    o.append(a.index(max(a))+1)
    a[a.index(max(a))]=0
o.reverse()
print(*o)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
caps = list(map(int, input().split()))
out = []
for i in range(0,N):
    out.append((caps.index(i+1)+1))

print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = 0
answer =[]

for i in range(N):
    B = A.index(i+1) + 1
    answer.append(B)
for j in range(N):
    print(answer[j], end=" ")

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = [int(i) for i in input().split()]


l = [a.index(i)+1 for i in range(1,n+1)]

  
print(*l)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = []

for i in range(N):
  List.append(str(A.index(i+1)+1))


L = ' '.join(List)
print(L)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
attends = [int(x) for x in input().split()]
arr = []
for x in range(1, n + 1):
    arr.append(attends.index(x) + 1)
print(*arr)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N = int(input())
A = list(map(int, input().split()))
B = A.copy()
B.sort()
t = ""
for i in range(len(A)):
    t += str(A.index(B[i])+1)+" "
print(t)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
result = []

for i in range(1,N+1):
  stu = A.index(i) + 1
  result.append(stu)

print(" ".join(map(str,result)))

Submission status: Time Limit Exceeded

Solution code:
import heapq
x = int(input())
y = [int(x) for x in input().split()]
z=y.copy()
heapq.heapify(y)
for i in range(x):
  k=heapq.heappop(y)
  print(z.index(k)+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N = int(input())

x = np.array(list(map(int,input().split())))

for i in range(N):
    print (np.argsort(x)[i]+1,"",end="")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
for i in range(n):
  print(a.index(i+1)+1)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))

num = [i+1 for i in range(N)]

for n in range(N):
  for m in range(N):

    if A[n] < A[m]:
      TMP=A[n]
      A[n]=A[m]
      A[m]=TMP
    
      TMP2=num[n]
      num[n]=num[m]
      num[m]=TMP2

for s in num:
  print(s, end =" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
Ali = list(map(int,input().split()))
L = Ali[:]

L.sort()
li = []
for i in range(N):
    li.append(Ali.index(L[i])+1)

print(' '.join(map(str, li)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input().rstrip())
A = list(map(int, input().split()))
find=-1

for i in range(1,N+1):
  for j in range(N):
    if A[j] == i:
      find=j
      break
  print(find+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

N = int(input())
A = input().split()
out = ""
for i in range(1,N+1):
  out += str(A.index(str(i))+1) + " "
print(out)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A = list([int(x) for x in input().split()])
a=[]
i=0
for i in range(len(A)):
  a.append(A.index(i+1)+1)
for i in range(len(a)):
  print(a[i], end="")
  if(i<len(a)):
    print(" ",end="")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
c=""
for i in range(n):
    c += " " + str(a.index(i+1)+1)
print(c[1:])

Submission status: Time Limit Exceeded

Solution code:
import heapq
import copy

n = int(input())
a_list = list(map(int,input().split()))
b_list = copy.deepcopy(a_list)
ans_list = []
heapq.heapify(a_list) #リストのヒープ化
for i in range(n):
    hoge = heapq.heappop(a_list)
    ans_list.append(b_list.index(hoge) + 1)
for i in ans_list:
    print(i, end = ' ')

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
from __future__ import print_function

n = int(raw_input())
li = map(int, raw_input().split())


for i in xrange(1,n+1):
    print(str(li.index(i) + 1) + " ", end="")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
h = list(map(int, input().split()))
cnt = [0]*n
for i in range(n):
  for j in range(n):
    if i+1 == h[j]:
      cnt[i] += j+1
      
print(*cnt)

Submission status: Time Limit Exceeded

Solution code:
import heapq
from heapq import heappush, heappop
list=[]
x = int(input())
y = [int(x) for x in input().split()]
z=y.copy()
heapq.heapify(y)
for i in range(x):
  k=heapq.heappop(y)
  print(z.index(k)+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
ans_lis = np.ones(len(a))
ans_lis = np.array(ans_lis, dtype=int)
for i in range(len(a)):
    ans_lis[i] += a.index(i + 1)
print(*ans_lis)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

listh = []
j = 1
for x in input().split(' ') :
	listh.append([int(x), j])
	j += 1

listh.sort()

s = ''
for k in range(n) :
	s = s + str(listh[k][1]) + ' '

print(s)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split())) 
B = [0 for _ in range(N)]
for i in range(N):
  B[i] =A.index(i+1) + 1
L=[str(a) for a in B]
L=" ".join(L)
print(L)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(x) for x in input().split()]

def retInd(A, k):
    for i in range(len(A)):
        if A[i]-1== k:
            return i

for i in range(N):
    print(retInd(A,i)+1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(input().split())


shusseki_jun = [str(A.index(str(i))+1) for i in range(1,N+1)]
print(' '.join(shusseki_jun))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = []

for i in range(N):
  List.append(A.index(i+1)+1)
  L = [str(i) for i in List]

L = ' '.join(L)
print(L)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a_i = input().split()
ans = ""
for i in range(len(a_i)):
  ans += str(a_i.index(str(i+1)) + 1)
  if i != (len(a_i) - 1):
    ans += " "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, A: "List[int]"):
    for i in range(1, N + 1):

        if i == N:
            print(A.index(i) + 1)
        else:
            print(A.index(i) + 1, end=" ")
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = {(i+1):int(j) for i, j in enumerate(input().split())}
A_sorted = sum(map(list, sorted(A.items(), key=lambda x:x[1])), [])
t = ""
for i in range(0, len(A_sorted), 2):
    t += str(A_sorted[i]) + " "
print(t)

Submission status: Time Limit Exceeded

Solution code:
N = input()
N = int(N)

A = input().split()

ans = []
for i in range(len(A)):
    ans.append(0)

for a in A:
    ans[int(a)-1] = A.index(a)+1

for i in ans:
    print(i, end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [ int(i) for i in input().split()]
b = []
for i in range(n):
    b.append((a.index(i+1))+1)
print(*b)

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = input()
    a = input().split(" ")
    r = [str(a.index(str(i+1)) + 1) for i in range(len(a))]
    print(" ".join(r))
if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys
N = int(input())
l = list(map(int, input().split()))
a = []
for i in range(N):
    a.append(l.index(i+1)+1)

print(' '.join(map(str, a)))

Submission status: Time Limit Exceeded

Solution code:
n = input()
a = input().split(' ')
text = ""
for i in range(1, int(n)+1):
	text += str(a.index(str(i))+1) + " "
print(text.rstrip())

Submission status: Time Limit Exceeded

Solution code:
sin = input()
n = int(sin)
sin = input()
arr = list(map(int, sin.split()))

tt = list()
for i in range(n):
    tt.append(i+1)

def bubble_sort(arr, tar):
    change = True
    while change:
        change = False
        for i in range(len(arr) - 1):
            if arr[i] > arr[i + 1]:
                arr[i], arr[i + 1] = arr[i + 1], arr[i]
                tar[i], tar[i + 1] = tar[i + 1], tar[i]
                change = True
    return arr, tar

a, b = bubble_sort(arr, tt)
print(' '.join(map(str, b)))

Submission status: Time Limit Exceeded

Solution code:
n= int(input())
a=list(map(int, input().split()))
b=[]
for i in range(n):
    print(a.index(i+1)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import copy
N = int(input())
Ali = list(map(int,input().split()))
L = copy.deepcopy(Ali)

L.sort()
li = []
for i in range(N):
    li.append(Ali.index(L[i])+1)

print(' '.join(map(str, li)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int,input().split()))
S = ''

for i in range(N):
    n = A.index(i+1)
    S += str(n+1) + ' '

print(S.lstrip(' '))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = input().split()
 
a_list = [int(i) for i in a]

a_list_index = [a_list.index(i+1) + 1 for i in range(N)]

print(' '.join(map(str, a_list_index)))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = [int(i) for i in input().split()]
l = []

for i in range(1,n+1):
  z = a.index(i)
  l.append(z+1)
  
print(*l)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = []

for i in range(N):
  List.append(A.index(i+1)+1)

L = [str(a) for a in List]
L = ' '.join(L)
print(L)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []

for x in range(1,N+1):
    m = A.index(x) + 1
    B.append(m)
print(*B)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
order_list = list()
for i in range(N):
    order_list.append(A.index(i+1)+1)

for i in range(N):
    print(str(order_list[i]) + ' ', end='')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N = int(input())

x = np.array(list(map(int,input().split())))

for i in range(len(x)):
    print (np.argsort(x)[i]+1,"",end="")

Submission status: Time Limit Exceeded

Solution code:
import heapq
from heapq import heappush, heappop
list=[]
x = int(input())
y = [int(x) for x in input().split()]
z=y.copy()
heapq.heapify(y)
for i in range(x):
  k=heapq.heappop(y)
  list.append(k)
for j in range(x):
  print(z.index(list[j])+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    a = [int(i) for i in input().split()]
    ans = []
    ans_append = ans.append
    for i in range(n):
        ans_append(a.index(i + 1) + 1)
    print(*ans)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=list(map(int,input().split()))
o=[]
for i in range(N):
    o.append(a.index(min(a))+1)
    a[a.index(min(a))]=10000000
print(*o)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(i) for i in input().split(" ")]

b = []
for i in range(n):
  b.append(str(a.index(i+1)+1))

print(" ".join(b))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
ans_lis = np.ones(len(a))
ans_lis = np.array(ans_lis, dtype=int)
for i in range(len(a)):
    ans_lis[i] += int(a.index(i + 1))
print(*ans_lis)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
    b.append(i+1)
ans = [a.index(x)+1 for x in b]
print(' '.join(map(str,ans)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
R = str()

for i in range(1,len(A)+1):
  R += str(A.index(i)+1) + ' '

print(R)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
li = list(map(int, input().split()))

r = []
result = ""

for i in range(1, N + 1):
    a = li.index(i)
    result = result + str(a + 1) + " "

print(result)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
students = list(map(int, input().split()))
x = 1
s = []
for i in range(N):
    index = students.index(x) + 1
    s.append(index)
    x += 1
print(' '.join(map(str, s)))

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    num_list = [int(i) for i in input().split()]
    order_list = []

    for order in range(1,N+1):
        num = num_list.index(order)+1
        order_list.append(num)
    
    print(" ".join(map(str,order_list)))

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = input().split()
out = ""
for i in range(1,N+1):
  out += str(A.index(str(i))+1) + " "
print(out)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

A = list(map(int, input().split()))
Ad = {}
for i in range(N):
    Ad[i] = A[i]

def get_keys_from_value(d, val):
    return [k for k, v in d.items() if v == val][0]

ans = ''
for j in range(len(Ad)):
    ans += ' ' + str(get_keys_from_value(Ad, j + 1) + 1)

print(ans.strip())

Submission status: Time Limit Exceeded

Solution code:
import copy
import sys
N = int(input())
Ali = list(map(int,input().split()))
L = copy.deepcopy(Ali)

L.sort()
li = []
for i in range(N):
    li.append(Ali.index(L[i])+1)

for i in range(N):
    sys.stdout.write(str(li[i])+' ')

Submission status: Time Limit Exceeded

Solution code:
# N, K = map(int, input().split())
import sys

# N = int(input())
# H = [int(i) for i in input().split()]

N,*H = map(int,open(0).read().split())

ans_list = []

for j in range(N):
    # print(H.index(j+1) + 1)
    sys.stdout.write(str(H.index(j+1) + 1) + " ")




#     ans_list.append(H.index(j+1) + 1)
#
# print(" ".join(map(str,ans_list)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = list(map(int,input().split()))
for i in range(n):
  print(A.index(i+1) + 1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
for i in range(1,N+1):
  x=1
  for j in range(N):
    if A[j]==i:
      print(x)
    else:
      x=x+1

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = input().split()
out = ""
for i in range(1,N+1):
  out += str(A.index(str(i))+1) + " "
print(out)

Submission status: Time Limit Exceeded

Solution code:
a = int(input())
b = list(map(int,input().split()))
c = []
for val in range(a):
    c.append(5)
for val in range(a):
    c[b[val]-1] = val+1
d = str()
for val in c:
    d = d + str(val) + " "
d = d.rstrip()
print(d)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = sorted(A)
for i in range(N):
    print(A.index(i+1) +1, end =' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
h = tuple(map(int,input().split()))

for i in range(1,N+1):
  print(h.index(i)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
 
N = int(input())
li = list(map(int,input().split()))
 
r = []
result = ""
 
for i in range(1,N+1):
    a = li.index(i)
    result = result + str(a+1) + " "
    
print(result)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = list(map(int, input().split()))

for i in range(1,N+1):
    ans = a.index(i) + 1
    print(ans, end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
caps = list(map(int, input().split()))
for i in range(0,N):
    print(caps.index(i+1)+1, sep=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = tuple(map(int,input().split()))

for ii in range(n):
    print(a.index(ii+1)+1)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
L = list(map(int, input().split()))
ret = []
for i in range(1,n+1):
  for k, x in enumerate(L):
    if x == i:
      ret.append(k+1)
      break
print(*ret)

Submission status: Time Limit Exceeded

Solution code:
# N, K = map(int, input().split())
import sys

N = int(input())
H = [int(i) for i in input().split()]
ans_list = []

for j in range(N):
    # print(H.index(j+1) + 1)
    sys.stdout.write(str(H.index(j+1) + 1) + " ")
    



#     ans_list.append(H.index(j+1) + 1)
#
# print(" ".join(map(str,ans_list)))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[]
for i in range(len(a)):
    ans+=[a.index(i+1)+1]
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
ans =[]
mm=1
for i in range(n):
  ans.append(a.index(mm)+1)
  mm+=1
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
ans_lis = np.zeros(len(a))
ans_lis = np.array(ans_lis, dtype=int)
for i in range(1, len(a) + 1):
    ans_lis[i - 1] = int(a.index(i) + 1)
print(*ans_lis)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()]

l = []
AA = A.copy()
for k in range(N):
    Amin = min(AA)
    for i in range(len(A)):
        a = A[i]
        if Amin == a:
            l.append(i + 1)
    AA.remove(Amin)
print(*l)

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

def main():
    n = int(input())
    a_list = list(map(int, input().split()))
    res = [None] * n

    for i in range(1, n+1):
        res[i-1] = a_list.index(i)+1

    print(*res)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[a.index(i+1)+1 for i in range(n)]
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby

# 入力 =stdin.readline().rstrip()
# 分割 = stdin.readline().rstrip().split()

'''
条件に合うものを絞り込む
data = [1, 2, 3]
s = [x for x in data if x % 3 == 0]
'''

'''
文字配列を数値に
l_si = ['-10', '0', '100']

l_si_i = [int(s) for s in l_si]
'''

'''
a = [2, 4, 6, 8]
b = [3, 6, 9]

print(list(set(a) | set(b)))  # 和集合
print(list(set(a) & set(b)))  # 積集合
'''

'''
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
while len([x for x in A if x % 2 == 0]) == N:
    A = list(map(lambda y: y / 2, A))
    count += 1
print(count)
'''

'''
.append(要素)
.insert(場所,要素)
-1で末尾で末尾から一つ前
'''


num = int(stdin.readline().rstrip())
data = stdin.readline().rstrip().split()
res = ''
for el in range(1, num + 1):
    res += str(data.index(str(el)) + 1)
    if (el != num):
        res += ' '
print(res)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
caps = list(map(int, input().split()))
for i in range(0,N):
    if i < N - 1 :
        print(caps.index(i+1)+1, sep=" ")
    else:
        print(caps.index(i+1)+1, sep="")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))

order = [0] * N
flag = 0
for i in range(0, N):
    flag = A.index(min(A))
    order[i] = flag + 1
    A[flag] = N + 1

print(" ".join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
r = []
for i,c in zip(range(1, N + 1), range(N)):
    r.append(A.index(i)  + 1)
print(" ".join(map(str, r)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(int(x) for x in input().split())
ans = []
for i in range(N):
    b = A.index(i + 1)
    ans.append(b)
for i in range(N):
    c = ans[i] + 1
    print(c)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))

l = []
for i in range(1, n + 1):
    l.append([a[i - 1], i])

l.sort()

res = str(l[0][1])
for i in range(1, n):
    res = res + " " + str(l[i][1])
print(res)