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:
def main():
    n = int(input())
    a = [int(_) for _ in input().split()]

    order = []

    for i in range(n):
        order.append(a.index(i+1) + 1)

    print(*order)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

for j in range(n):
  for i in range(n):
    
    if a[i] == j+1:
      print(i+1, end=' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

lists = [0]*N

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

Submission status: Time Limit Exceeded

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

ans = map(str,ans)
print(" ".join(ans))

Submission status: Time Limit Exceeded

Solution code:
L = [input(), input()]
A = L[1].split()
print(' '.join([str(A.index(str(i))+1) for i in range(1, int(L[0])+1)]))

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[i], i])
B.sort()
ANS = ""
for i in range(N):
  ANS += str(B[i][1]+1)
  if i != N-1:
    ANS += " "
print(ANS)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

lists = []
for i in range(1,len(A)+1):
    lists.append(A.index(i)+1)
         
for i in lists:
         print(i, end = ' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

a=sorted(a)
for ia in a:
  print(c.index(ia)+1, end=' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

copy = num_list.copy()
copy.sort()

ans_list = [0]*n
for i in range(len(copy)):
    ans_list[i] = str(num_list.index(copy[i]) + 1)

ans = ' '.join(ans_list)
print(ans)

Submission status: Time Limit Exceeded

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

ans_list = []
for r in range(1, n+1, 1):
    index = num_list.index(r)+1
    ans_list.append(str(index))

ans = ' '.join(ans_list)
print(ans)

Submission status: Time Limit Exceeded

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

ans=[]

for i in range(n):
  for j in range(n):
    if i+1==a[j]:
      ans.append(j+1)

ans2=[str(i) for i in ans]

print(' '.join(ans2))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

b = 1

while True:
    if n < b:
        break;
    else:
        print(a.index(b)+1, end=" ")
        b+=1

Submission status: Time Limit Exceeded

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

order = []

for i in range(1,n+1):
    order.append(a.index(i)+1)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
l = inpl()
dic = {}
for i in range(0, len(l)):
    dic.setdefault(i, l[i])
ans = ''
sl = sorted(dic.items(), key=lambda x:x[1])
for d in sl:
    ans = ' '.join([ans, str(d[0] + 1)])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
l = inpl()
dic = {}
for i in range(0, len(l)):
    dic.setdefault(i, l[i])
ans = ''
sl = sorted(dic.items(), key=lambda x:x[1])
for d in sl:
    ans = ''.join([ans,' ', str(d[0] + 1)])
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

ans = []

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

print(*ans, sep=' ')

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:
n = int(input())
a = list(map(int, input().split()))
ans = []
for i in range(n):
    ans.append(a.index(i+1)+1)

print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

[print(s, end=" ") for s in c]

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import math
import numpy as np

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

a = np.array(a)
ans = []
while a.min() != 9999999:
    min_index = a.argmin()
    ans.append(min_index+1)
    a[min_index] = 9999999

print(' '.join([str(_) for _ in ans]))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
from operator import itemgetter
N = int(input())
A = list(map(int, input().split()))
# a= []
# for i in range(N):
#     a.append((i+1, A[i]))
#     a.sort(key=itemgetter(1))
# print(' '.join([str(i[0]) for i in a]))
a = []
for i in range(N):
    for j in range(N):
        if i+1 == A[j]:
            a.append(str(j+1))
print(' '.join(a))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(each) for each in input().split()]
result = []
for i in range(n):
	result.append(str(a.index(i+1)+1))
print(' '.join(result))

Submission status: Time Limit Exceeded

Solution code:
from operator import itemgetter
N = int(input())
A = list(map(int, input().split()))
a= []
for i in range(N):
    a.append((i+1, A[i]))
    a.sort(key=itemgetter(1))
print(' '.join([str(i[0]) for i in a]))

Submission status: Time Limit Exceeded

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

print(*ans)

Submission status: Time Limit Exceeded

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

A = [A.index(i)+1 for i in range(1,N+1)]
print(*A)

Submission status: Time Limit Exceeded

Solution code:
#C - Go to School
N = int(input())
A = list(map(int, input().split()))

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

a_2 = sorted(a)
for i in range(n):
    print(a.index(a_2[i])+1,end=" ")

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
	print(a.index(i)+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):
  print(a.index(i)+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):
  print(a.index(i)+1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for x in range(1,n+1):
    for y in range(n):
        if x == a[y]:
            print(y+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):
  print(A.index(i)+1, end=" ")

Submission status: Time Limit Exceeded

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

for i in range(1,N+1):
  AA.append(A.index(i)+1)
L=[str(a) for a in AA]
L=" ".join(L)
print(L)

Submission status: Time Limit Exceeded

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

ans = []

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

ans = list(map(str, ans))
print(" ".join(ans))

Submission status: Time Limit Exceeded

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

A_ = A[:]

ans = []

for _ in range(N):
    m = min(A)
    ans.append(A_.index(m) + 1)
    A.remove(m)

ans = list(map(str, ans))

print(" ".join(ans))

Submission status: Time Limit Exceeded

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
A = LI()
#AB = [LI() for _ in range(N)]
#A,B = zip(*AB)
#Ap = np.array(A)
#C = np.zeros(N + 1)
# index 順 要素のindex

ans = []
for i in range(N):
    ans.append(A.index(i+1)+1)
print(*ans)

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
  if ans != '':
    ans = ans + ' '
  ans = ans + str(a.index(i)+1)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
an = [int(num) for num in input().split()]

answer = []
for index in range(1,len(an)+1):
  answer.append(str(an.index(index)+1))

print(" ".join(answer))

Submission status: Time Limit Exceeded

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

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

print(ans.strip())

Submission status: Time Limit Exceeded

Solution code:
import sys, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Time Limit Exceeded

Solution code:
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n = int(input())
A = list(map(int, input().split()))
D = sorted(A)
ans_str = ""
for i in range(n):
    if i == n-1:
        ans_str += str(A.index(D[i])+1)
        print(ans_str)
        exit()
    ans_str += str(A.index(D[i])+1) + " "

Submission status: Time Limit Exceeded

Solution code:
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n = int(input())
A = list(map(int, input().split()))
ans_str = ""
for i in range(1, n+1):
    if i == n:
        ans_str += str(A.index(i)+1)
        print(ans_str)
        exit()
    ans_str += str(A.index(i)+1) + " "

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=[1]*N
for x in range(N):
  B[x]+=A.index(x+1)
for y in B:
  print(y,end="")
  if y!=B[N-1]:
    print(" ",end="")
print("\n")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

    print(t[i],end=' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n,*a=map(int,open(0).read().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):
    print(a.index(i)+1)

Submission status: Time Limit Exceeded

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

ans = ''
for i in range(n):
  ans += str(a.index(i + 1) + 1) + ' '
  
print(ans)

Submission status: Time Limit Exceeded

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

ans = []
for i in range(n):
  ans.append(str(a.index(i + 1) + 1))
  
print(' '.join(ans))

Submission status: Time Limit Exceeded

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

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

print(" ".join(attend))

Submission status: Time Limit Exceeded

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

ans = ""
for i in sort_a:
    attend = str(a.index(i) + 1) + " "
    ans += attend
    

print(ans)

Submission status: Time Limit Exceeded

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

attend = [str(a.index(i)+1) for i in sort_a]

ans = " ".join(attend)
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for _ in range(n) :
    print(rank[_]+1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#C
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for people in range(n):
    for j in range(n):
        if a[j] == people+1:
            ans[people] = j + 1
print(*ans)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

ans = [0] * len(A)

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

print(*ans)

Submission status: Time Limit Exceeded

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

ans = []
for i in range(1, len(A) + 1):
    temp = A.index(i)
    ans.append(temp + 1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
#14
N =int(input())
a = list(map(int,input().split()))
b = ""

for i in range(N):
    b += str(a.index(i+1)+1) + " "
    
    
print(b)

Submission status: Time Limit Exceeded

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

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

print(a.index(n) + 1)

Submission status: Time Limit Exceeded

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

dic={}

for i in range(1,N+1):
    a=Ai.index(i)+1
    dic[i]=a

ans=''
for i in range(1,N+1):
    ans+=str(dic[i])+' '
print(ans)

Submission status: Time Limit Exceeded

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

ans=''

for i in range(1,N+1):
    a=Ai.index(i)+1
    ans+=(str(a)+' ')

print(ans)

Submission status: Time Limit Exceeded

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

ans=[]

for i in range(1,N+1):
    a=Ai.index(i)+1
    ans.append(str(a))

print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    inlis = list(map(int, input().split()))
    anstup = tuple()
    for i in range(n):
        junban = inlis.index(i+1) + 1
        tup = junban,
        anstup += tup
    print(*anstup)
    
if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    inlis = list(map(int, input().split()))
    anslis = []
    for i in range(n):
        junban = inlis.index(i+1) + 1
        anslis.append(junban)
    print(*anslis)
    
if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

for i in range(1, n+1):
    alist.append(str(a.index(i)+1))

print(" ".join(alist))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#16
N = int(input())
A = input().split(' ')
#A = [int(A[i]) for i in range(N)]
NN = []
for i in range(1, N+1, 1):
  NN.append(str(A.index(str(i)) + 1))
A = ' '.join(NN)
print(A)

Submission status: Time Limit Exceeded

Solution code:
#16
N = int(input())
A = input().split(' ')
A = [int(A[i]) for i in range(N)]
NN = []
for i in range(1, N+1, 1):
  NN.append(str(A.index(i) + 1))
A = ' '.join(NN)
print(A)

Submission status: Time Limit Exceeded

Solution code:
#16
N = int(input())
A = input().split(' ')
A = [int(A[i]) for i in range(N)]
NN = []
for i in range(1, N+1, 1):
  NN.append(A.index(i))
NN = [str(NN[i] + 1) for i in range(N)]
A = ' '.join(NN)
print(A)

Submission status: Time Limit Exceeded

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

ans = []
for i in range(n):
    ans.append(A.index(i + 1) + 1)

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=list(map(int,input().split()))
la=[]
for i in range(1,n+1):
  la.append(l.index(i)+1)
ans=[str(j) for j in la]
ans=" ".join(ans)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(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(N):
    print(A.index(i+1)+1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [0] + list(map(int, input().split()))

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
x=[0]*n
for i in range(n):
  for j in range(n):
    if(j+1==a[i]):
      x[j]=i+1
  
print(" ".join(map(str,x)))

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    n = int(input())
    a = list(map(int, input().split()))
    l = []
    flg = 1
    while True:
        l.append(a.index(flg)+1)
        flg += 1
        if len(l) == n:
          break
    print(*l)
resolve()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    n = int(input())
    a = list(map(int, input().split()))
    l = []
    while len(l) != len(a):
        mn = min(a)
        l.append(a.index(mn)+1)
        a[a.index(mn)] = n+1
    print(*l)
resolve()

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
ans = 1
X = []
while(ans<N+1):
    for i in range(N):
        if A[i] == ans:
            ans += 1
            X.append(str(i+1))
L=' '.join(X)
print(L)

Submission status: Time Limit Exceeded

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

ans=[]
for i in range(1,N+1):
    ans.append(A.index(i) +1)
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

s = [a.index(i)+1 for i in range(1, N+1)]

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

A = [int(x) for x in input().split()]

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

A = [int(x) for x in input().split()]

ans = []
for i in range(1,N+1):
    ans.append(A.index(i)+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

N = int(input())
list_A = list(map(int, input().split()))

ans = ""
for i in range(N):
    ans += str(list_A.index(i+1) + 1)
    ans += " "
ans = ans.strip()
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = [0]*n
for i in range(1,n+1):
  for j in range(n):
    if a[j] == i:
      b[i-1] = j+1
for k in range(n):
  print(b[k],end = " ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

A_dict={}

for n in range(N):
    a = A.pop(0)
    A_dict[a]=n+1
    
for n in range(N):
    ans.append(A_dict[n+1])

print(*ans, sep=' ')

Submission status: Time Limit Exceeded

Solution code:
import sys
from heapq import heapify, heappush, heappop
input = sys.stdin.readline

def main():
    n = int(input())
    a = [int(x) for x in input().split()]
    h = a.copy()
    heapify(h)
    for _ in range(n):
        h_a = heappop(h)
        print(a.index(h_a)+1, end=' ')

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
from heapq import heapify, heappush, heappop

def main():
    n = int(input())
    a = [int(x) for x in input().split()]
    h = a.copy()
    heapify(h)
    for _ in range(n):
        h_a = heappop(h)
        print(a.index(h_a)+1, end=' ')

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    a = [int(x) for x in input().split()]
    a_s = sorted(a)
    #ans = []
    for i in a_s:
        #ans.append(a.index(i)+1)
        print(a.index(i)+1, end=' ')
    #print(*ans)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = []
for i in range(1,n+1):
  for j in range(n):
    if i == a[j]:
      ans.append(j+1)
      break
print(*ans,sep=' ')

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
s = sorted(a)
ret = []

for i in s:
    ret += [a.index(i)+1]
print(' '.join(list(map(str,ret))))

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()))
b=[]
for i in range(n):
  for j in range(n):
    if a[j]==i+1:
      b.append(j+1)
print(*b)