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

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)

print(*an)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#import sys

#input = sys.stdin.readline

import heapq

def main():
#    h,w,a,b = map(int, input().split())
    n=int(input())
    a = list(map(int,input().split()))
    b=[]
    for i in range(n):
        b.append([a[i],i+1])
#    print(b)
    heapq.heapify(b)
#    print(heapq.heappop(b))
#    print(b)
    #b=sorted(b,key=lambda x: x[1])
    c=""
 #   print(b)
    for i in range(n):
        d=heapq.heappop(b)
        d=d[1]
        c=c + str(d) + " "
    c.rstrip()
    print(c)

#    for i in range(h):
#            print(aaa)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(i) for i in 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())
entry = list(map(int, input().split()))

result = []
for i in range(1, len(entry)+1):
    print(entry.index(i)+1, " ", end="")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:

from sys import stdin
import heapq

N = int(input())
As = [int(x) for x in stdin.readline().rstrip().split()]
ans = ""

for i in range(N):
    small = heapq.nsmallest(i + 1, As)
    index = As.index(small[i])
    ans += str(index + 1) + " "

print(ans)

Submission status: Time Limit Exceeded

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

for i in range(n):
    index_number = a.index(i+1)
    index_number += 1
    print(index_number, 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())
h = list(map(int, input().split()))
for i in range(1, n+1):
  for j in range(n):
    if i == h[j]:
      print(j+1, end = " ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N=int(input())
A=list(map(int,input().split()))
L=[]

for j in range(1,N+1):
	item = j
	for index in range(0,N):
		if item==A[index]:
			L.append(index+1)
		

print(*L)

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)
  if i!=N-1:
    ans+=" "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

a = list(map(lambda x:int(x), input().split()))

junban = []

for i in range(n):
    jun = a.index(i+1)
    #junban.append(jun+1)
    if i != n:
        print(jun+1," ",end="")
    else:
        print(jun+1)

Submission status: Time Limit Exceeded

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

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

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):
        key = str(i+1)
        ans[key] = a[i]
    ans = sorted(ans.items(), key=lambda x: x[1])
    ans_str =""
    for i in ans:
        if ans_str =="":
            ans_str = str(i[0])
        else:
            ans_str = ans_str+" "+str(i[0])
    print(ans_str)

Submission status: Time Limit Exceeded

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

N = int(input())

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

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

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

ln = np.array(l)

lna = ln[np.argsort(ln[:, col_num])]

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()] 
C = [0] * (N)
S = ""
for i in range(N):
	C[A[i]-1]=i+1

for i in range(N):
	if i == 0:
		S = str(C[i])
	else:
		S = S+" "+str(C[i])
print(S)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

student_list = input().rstrip().split(' ')

answer = ""

for n in range(N):
  i = student_list.index(str(n+1))
  answer += str(i+1) + " "
  
print(answer[0:-1])

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.append(str(data.index(str(el)) + 1))
print(' '.join(res))

Submission status: Time Limit Exceeded

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

c = {}
for i in range(N):
    c.update({str(A[i]): i + 1})

res = ''

for i in range(1, N + 1):
    res = res + str(c[str(i)]) + ' '

print(res.strip())

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:
'''
Created on 2019/09/28

@author: oiwaiman
'''

N = int(input())

A = list(map(int, input().split()))
b = []
for i in range(1,N+1):
    for j in range(0, N) :
        if A[j]==i:
            print(str(j+1)+" ", end="")
            break

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(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())
a=list(map(int, input().split()))
b=[0]*n

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

Submission status: Time Limit Exceeded

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

for i in b:
    c.append(a.index(i)+1)

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

Submission status: Time Limit Exceeded

Solution code:
n, *a = map(int, open(0).read().split())

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

Submission status: Time Limit Exceeded

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

import numpy as np

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    ans = str(a_list.index(1)+1)
    for i in range(2, n+1):
        ans += " " + str(a_list.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()))

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(N):
    print(str(A.index(i+1)+1), end=' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split(" ")))
M=max(a)+1

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[]
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()))
R = str()

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

print(R)

Submission status: Time Limit Exceeded

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

B = [[A[i],(i+1)] for i in range(N)]
B.sort()
ans=''
for i in range(N-1):
  ans = ans + str(B[i][1])+' '
ans = ans + str(B[N-1][1])
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

sa = []

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

for st in sa:
  print(st, end=" ")

print()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def myinput(rownum):
    res = []
    for i in range(rownum):
        temp = input().split(" ")
        res += temp
    return res

def main():
    r = myinput(2)
    n = r[0]
    a = list(map(lambda x:int(x),r[1:]))
    res = ""
    res = [str(a.index(i+1) + 1) for i in range(len(a))]
    print(" ".join(res))

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

P = []

for i in range(N):
    temp = A.index(i+1) + 1
    temp = str(temp)
    P.append(temp)

print(' '.join(P))

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.append(1+a.index(i+1))
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import heapq
n = int(input())
a = list(map(int,input().split()))
p = []
for b in a:
  heapq.heappush(p,b)
for i in range(n):
  x = heapq.heappop(p)
  y = a.index(x)
  print(y+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
out = [0] * n
count = 0
out_str = ""
for j in range(n):
    for i in range(n):
        if j + 1 == a[i]:
            out[j] = i + 1
            break

for i in range(n):
    out_str = out_str + str(out[i]) + " "

print(out_str[:-1])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
ans=[i for i in range(n)]
for i in range(n):
    ans[i]=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()]

a_sorted = sorted(a)
#print(a)
#print(a_sorted)

a_idx = [str(1+a.index(x)) for x in a_sorted]
#print(a_idx)

print(' '.join(a_idx))

Submission status: Time Limit Exceeded

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

for i in sorted(A):
    res = A.index(i)
    ans.append(res+1)
print(' '.join(map(str, ans)))

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())

student_list = input().rstrip().split(' ')

ans_list = []

for n in range(N):
  i = student_list.index(str(n+1))
  ans_list.append(str(i+1))
  
print(' '.join(ans_list))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())

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

B=[]
count=0
while count<N:
  B.append(A.index(min(A)))
  count+=1
  A[A.index(min(A))]=N+2
  
for b in B:
  print(b+1, end=' ')

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(res)

Submission status: Time Limit Exceeded

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

order = [0] * n

for ii in range(n):
    order[ii] = a.index(a_new[ii])+1
    print(order[ii])

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
a = list(map(int, input().split()))
k = [0]*n
s=0
for i in a:
    k[i-1] = s
    s+=1

mozi=""
for i in k:
    mozi = mozi+" "+str(i+1)
print(mozi)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

from  heapq import heappush, heappop

hq=[]
for i in range(N):
    heappush(hq, (A[i],i))

ans=""
for i in range(N):
    ans=ans+str(heappop(hq)[1]+1)+" "
print(ans[:-1])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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(' '.join(map(str,b)))

Submission status: Time Limit Exceeded

Solution code:
import copy
N = int(input())
A = list(map(int,input().split()))
B = copy.deepcopy(A)
B.sort()
ans = []
for i in B:
    ans.append(A.index(i) + 1)
for i in ans:
    print(i,end=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
p=list(map(int,input().split()))
f=[]
q=[]
q.extend(p)
l=0
tmp=0
for i in range(n):
    tmp=min(p)
    l=p.index(tmp)
    f.append(q.index(tmp)+1)
    p.pop(l)
for i in f:
    print(i,"",end="")
print()

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()))

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

print(*result)

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(i + 1) + 1)

print(" ".join(str(e) for e in o))

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)
  if i!=N-1:
    ans+=" "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = list(map(int, input().split()))
q=[]
ans=""
for i in range(N):
    tmp = L.index(i+1)
    tmp+=1
    ans+=str(tmp)+" "

print(ans)

Submission status: Time Limit Exceeded

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

ans = [0 for _ in range(N)]

for i in range(N):
  ind = stu.index(min(stu))
  ans[i]=ind+1
  stu[ind] = N+1
  
print(*ans)

Submission status: Time Limit Exceeded

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

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

print(" ".join(b))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

#print(A.index(1))

a = []

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

a=' '.join(a)
print(a)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import heapq
import copy
n= int(input())
a = input()
list1 = list(map(int,a.split()))
list1_1 = copy.deepcopy(list1)
heapq.heapify(list1)
list2 = []
for i in range(n):
    list2.append(list1_1.index(heapq.heappop(list1))+1)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

k = [1+lis.index(l) for l in range(1,n+1)]

print(*k)

Submission status: Time Limit Exceeded

Solution code:
import sys
N = int(input())
A = list(map(int, sys.stdin.readline().strip().split()))

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

Submission status: Time Limit Exceeded

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

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

    print()


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
od = []
for i in range(n):
    od.append(a.index(i+1)+1)
for i in range(n):
    if i != n-1:
        print(od[i], end=' ')
    else:
        print(od[i])

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(" ".join(map(str,ans)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
num = int(input())
input_line=input().rstrip().split(" ")
num_line=[]

for i in range(num):
    moji=str(i+1)
    a=input_line.index(moji)
    num_line.append(a+1)

for i in range(num):    
    print(num_line[i],end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
a = [0]*(N+1)
ans = [0]*(N)

for i in range(1,N+1):
    a[i] = i

for i in range(N):
    pairs = zip(A, a)
    sortedpairs = sorted(pairs, key=lambda x: x[0])

for i in range(N):
    ans[i] = sortedpairs[i][1]+1

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

Submission status: Time Limit Exceeded

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

B = [[A[i],(i+1)] for i in range(N)]
B.sort(key= lambda x:x[0])
ans=''
for i in range(N-1):
  ans = ans + str(B[i][1])+' '
ans = ans + str(B[N-1][1])
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

#print(A.index(1))

a_int = []

for i in range(1,N+1):
    a_int.append(A.index(i)+1)
    
a=[str(b) for b in a_int]
a=' '.join(a)
print(a)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def myinput(rownum):
    res = []
    for i in range(rownum):
        temp = input().split(" ")
        res += temp
    return res

def main():
    r = myinput(2)
    n = r[0]
    a = r[1:]
    ilist = [str(i+1) for i in range(len(a))]
    res = ""
    for i in ilist:
        res += str(a.index(i) + 1) + " "
    print(res[:-1])

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N=int(input())
A=list(map(int,input().split()))
L=[]

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

print(*L)

Submission status: Time Limit Exceeded

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

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

print(*lst)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
#from collections import deque

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 = input().split()
A = [int(i) for i in A]

sort = []
count = 1
for i in range(len(A)):
    for i,a in enumerate(A):
        if a == count:
            sort.append(i+1)
            count += 1
            break
sort = [str(s) for s in sort]
print(" ".join(sort))

Submission status: Time Limit Exceeded

Solution code:
tmp = int(input())
timing = [int(i) for i in input().split()]
ans = []
for i in range(0,tmp):
    #ans.append(timing.index(i+1)+1)
    print(timing.index(i+1)+1,end="")
    if i <tmp-1:
        print(" ",end="")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#import sys

#input = sys.stdin.readline

#import heapq

def main():
#    h,w,a,b = map(int, input().split())
    n=int(input())
    a = list(map(int,input().split()))
    b=[]
    for i in range(n):
        b.append([i+1,a[i]])
    b=sorted(b,key=lambda x: x[1])
    c=""
 #   print(b)
    for i in range(n):
        c=c + str(b[i][0]) + " "
    c.rstrip()
    print(c)

#    for i in range(h):
#            print(aaa)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for s in res:
    print(s, 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(str(a.index(i)+1))
ans=' '.join(ans)
print(ans)

Submission status: Time Limit Exceeded

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

for i in range(len(A)):
    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()))
#print(N,A)
for i in range(N):
  print(A.index(i+1)+1,end="")
  if i!=N-1:
  	print(" ",end="")
print("")

Submission status: Time Limit Exceeded

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

stu = [0] * n

for i in range(n):
    come = a.index(i + 1) + 1
    stu[i] = come
print(*stu)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
temp = list(map(int, input().split()))
for i in range(N):
  print(temp.index(i+1)+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()))
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(lambda x:int(x), input().split()))

junban = []

for i in range(n):
    jun = a.index(i+1)
    junban.append(str(jun+1))

print(" ".join(junban))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[a.index(a[i])+1] = a[i]
dic_sorted = sorted(dic.items(), key=lambda x:x[1])
for i in range(N):
    print(dic_sorted[i][0],'',end="")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

a.insert(0,0)
result = []

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

print(*result)

Submission status: Time Limit Exceeded

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

result = []
for i in range(1, len(entry)+1):
    result.append(entry.index(i)+1)
for j in range(len(result)):
    print(result[j], " ", end="")

Submission status: Time Limit Exceeded

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

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