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()))
ans = []
for i in range(1, n+1):
    for j in range(0, n):
        if a[j] == i:
            ans.append(j+1)
print(' '.join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
#import numpy as np

    
##################################################################

if __name__ == "__main__":
    Input1 = [input() for i in range(2)]
    N = int(Input1[0])
    A = list(map(int,Input1[1].split()))

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

a_list = list(map(int,input().split()))
a_n_list = []
for i in range(N):
    a_n_list.append([a_list[i],i+1])
a_n_list.sort()
ans = ""
for i in range(N):
    ans = ans + str(a_n_list[i][1]) + " "
print(ans[0:-1])

Submission status: Time Limit Exceeded

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

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

ans = ' '.join(s)
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(i+1)
flag = 1
while flag:
    flag = 0
    for i in range(n-1,0,-1):
        if a[i] < a[i-1]:
            a[i],a[i-1] = a[i-1],a[i]
            b[i],b[i-1] = b[i-1],b[i]
            flag = 1
print(' '.join(map(str,b)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

C = []

for i in range(N):
    for j in range(N):
        if i+1 == A[j]:
            C.append(j+1)
            break

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

B = [0] * N
ans = ''
for i, num in enumerate(A):
    B[num-1] = i + 1
for j in B:
    ans = ans + ' ' + str(j)
print(ans[1:])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
li = list(map(int,input().split()))
li = [ i-1 for i in li ]

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

Submission status: Time Limit Exceeded

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

output=""

for i in range(n):
    output+=str(1+a_lis.index(i+1))+" "

print(output)

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.append(str(a.index(i) + 1))
    print(" ".join(res))

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)

Submission status: Time Limit Exceeded

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

s = []

for i in range(1,n+1):
  s.append(t.index(i)+1)

print(*s)

Submission status: Time Limit Exceeded

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    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()))
B=[]
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()))
print(*[a.index(i+1)+1 for i in range(n)])

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

    print(*ans)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

dict_A = {A[i]:(i+1) for i in range(N)}
ans=''
for i in range(1,N):
  ans = ans + str(dict_A[i])+' '
ans = ans + str(dict_A[N])
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def main():
  n = ni()
  a = list(na())
  res = []
  for i in range(1,n+1):
    res.append(a.index(i)+1)
  print(*res)

main()

Submission status: Time Limit Exceeded

Solution code:
#N,K=map(int,input().split(" "))
N=int(input())
a=list(map(int,input().split(" ")))
b=[]
for _ in range(N):
    buf = a.index(min(a))
    b.append(buf+1)
    a[buf]=N+1
print(" ".join(repr(e) for e in b))

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
li2 = []
for i in range(1,len(li)+1):
    s = li.index(i)
    li2.append(s+1)

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
temp = list(map(int, input().split()))
ans = []
for i in range(N):
  for j in range(N):
    if(temp[j]==i+1):
      print(j+1, end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

s = ""
for i in range(1,N+1):
    for j in range(N):
        if As[j] == i:
            s += str(j+1)+" "
print(s)

Submission status: Time Limit Exceeded

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def main():
  n = ni()
  a = list(na())
  sorta = sorted(a)
  res = []
  for aa in sorta:
    res.append(a.index(aa)+1)
  print(*res)

main()

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)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

C = []

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

if __name__ == '__main__':
    main()

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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(str(A.index(i)+1))

print(' '.join(L))

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:
# coding: utf-8
n = int(input())
a = list(map(int,input().split()))

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
As = [int(x) for x in input().split()]
rs = list(range(1,N+1))
print(" ".join(map(str,[As.index(r)+1 for r in rs])))

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:
N = int(input())
A = list(map(int,input().split()))
ls = []
k = 0
for i in range(N):
    k = A.index(i+1)+1
    ls.append(k)
print(*ls)

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()))
co = a.copy()
co = sorted(co)
for i in co:
    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='')
    if i!=n+1:
        print(" ",end="")
print()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(*output)

Submission status: Time Limit Exceeded

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

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

print()

Submission status: Time Limit Exceeded

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    N = II()
    A = LMIIS()
    for i in range(N):
        A[i] = [A[i],i]
    A.sort()

    ans = ''
    for i in range(N):
        ans += str(A[i][1]+1) + ' '
    print(ans.rstrip())
        

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
h = [int(x) for x in 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()))

ans=[]
for i in range(1,n+1):
  for j in range(n):
    if A[j]==i:
      ans.append(j+1)
print(*ans)

Submission status: Time Limit Exceeded

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

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(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())
As = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
N = int(input())
A_ls = list(map(int, input().split(' ')))
rst = [ [] for i in range(N) ]
for idx, val in enumerate(A_ls):
    rst[val - 1] = idx + 1
[ print(i, end=" ") for i in rst ]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
dct = dict(enumerate(A))
ad = sorted(dct.items(), key=lambda x:x[1])
ans = []
for i in ad:
    j = i[0] + 1
    ans.append(j)
a = map(str, ans)
b = ' '.join(a)
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

lst = []
for i in range(N):
  lst.append([i+1, A[i]])
lst.sort(key=lambda x: x[1])
for j in lst:
  print(j[0], end=" ")

Submission status: Accepted

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

for n in range(N):
  B[A[n]-1] = n+1
  
print(*B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

rev = [i for i in range(N)]
for i in range(N):
    rev[A[i]-1] = i+1
print(*rev)

Submission status: Accepted

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

for i in range(N):
	ans[A[i]-1]=str(i+1)

print(" ".join(ans))

Submission status: Accepted

Solution code:
N = int(input())
rst = [ [] for i in range(N) ]
A_ls = list(map(int, input().split(' ')))
for i, j in enumerate(A_ls):
    rst[j - 1] = i + 1
[ print(i, end=" ") for i in rst ]

Submission status: Accepted

Solution code:
N = int(input())
A = tuple(map(int, input().split()))
assert len(A) == N

# 出席番号iの生徒が到着した時点でAi人が到着済み(i含む)
print(' '.join(list(map(str, sorted(range(1,N+1), key=lambda v:A[v-1])))))

Submission status: Accepted

Solution code:
import numpy as np
n = input()
print(*np.argsort(list(map(int,input().split())))+1)

Submission status: Accepted

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

ans=['-']*n
for i in range(n):
    ans[a[i]-1]=str(i+1)

print(' '.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    N = int(input())
    R = [-1] * (N+1)
    A = list(map(int,input().split()))
    for idx, a in enumerate(A):
        R[a] = idx+1

    for idx in range(1, len(R)):
        print(R[idx], end=" ")
    print("\n")
    

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    a = tuple(map(int,input().split()))
    attend = [0]*n
    for i,j in enumerate(a):
        attend[j-1] = i+1
    print(*attend)
resolve()

Submission status: Accepted

Solution code:
N=int(input())
Alist=list(map(int,input().split()))
index=[i+1 for i in range(N)]
Adict=dict(zip(Alist,index))
for i in range(1,N+1):
    print(Adict[i],end=' ')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
lst = [0 for _ in range(n)]
i = 1
for ai in a:
  lst[ai-1] = i
  i += 1
print(' '.join([str(i) for i in lst]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

a_tmp=list(map(int,input().split()))
a=[]
for i in range(n):
    a.append([a_tmp[i],i+1])
a.sort(key=lambda x:x[0])

for i in range(n):
    print(a[i][1],end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
tl = [0 for i in range(n)]
for i in range(n):
    tl[a[i] -1] = str(i+1)
print(' '.join(tl))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

P = [0]*n

for i in range(n):
    P[A[i]-1] = i+1

print(*P,sep=' ')

Submission status: Accepted

Solution code:
n = int(input())
alst = list(map(int, input().split()))
ans = [-1 for _ in range(n)]
for i, a in enumerate(alst, start = 1):
  ans[a - 1] = i
print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
A = [int(a) for a in input().split()]
ans = [0] * N
for i in range(N):
  ans[A[i] - 1] = i + 1
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

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


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

    ans = []
    ms = sorted(m.items(), key=lambda x :x[0])
    for i in range(N):
        ans.append(ms[i][1])

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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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: Accepted

Solution code:
N = int(input())
A = [int(n) for n in input().split()]
ans = [0] * N
for i, v in enumerate(A):
    ans[v-1] = i+1

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

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))
B = [(i+1, A[i]) for i in range(n)]
B.sort(key=lambda x: x[1])
print (" ".join(list(map(str, [B[i][0] for i in range(n)]))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

L = [0]*n
for i in range(n):
    L[A[i]-1] = i+1
print(*L)

Submission status: Accepted

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

ans = [-1] * N
for i,a in enumerate(A):
    ans[a-1] = i+1
print(*ans)

Submission status: Accepted

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

ans_h = {}
ans = []

for (i, ele) in enumerate(a):
    ans_h[ele] = i + 1

for i in range(1, n + 1):
    ans.append(str(ans_h[i]))

print(" ".join(ans))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
arriv = {}
l = []

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

arriv_2 = sorted(arriv.items(), key = lambda x:x[1])

for i in range(n):
    l.append(str(arriv_2[i][0]))

print(' '.join(l))

Submission status: Accepted

Solution code:
def abc142c_go_to_school():
    n = int(input())
    a = list(zip(range(1, n+1),list(map(int, input().split()))))
    a.sort(key=lambda x: x[1])
    for item in a:
        print(item[0], end=' ')

abc142c_go_to_school()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = [None] *n
for idx,person in enumerate(a):
    b[person-1] = idx+1
for j in b:
    print(j,end=' ')

Submission status: Accepted

Solution code:
# coding: utf-8

def main():
    N = int(input())
    A = list(map(int, input().split()))
    B = [[a, i + 1] for i, a in enumerate(A)]
    B.sort()
    for i, j in B:
        if i == N:
            print(j)
        else:
            print(j, "", end='')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
lst = list(map(int,input().split()))
lst2 = [0 for i in range(n)]
for i in range(n):
    x = lst[i]
    lst2[x - 1] = i + 1

for i in range(n):
    if (i != n - 1):
        print(lst2[i], end = ' ')
    else:
        print(lst2[i])

Submission status: Accepted

Solution code:
import numpy as np

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

ans = np.argsort(a)
print(*ans + 1)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
N = int(input())
a = list(map(int,input().split()))

L = {}

for i in range(N):
    L[i] = a[i]

sort_L = sorted(L.items(), key=lambda x:x[1])

for j in sort_L:
    print(j[0]+1, end =" ")

Submission status: Accepted

Solution code:
N = int(input())
alist = list(map(int, input().split()))
blist = []
for i in range(N):
    blist.append([alist[i],i+1])
blist.sort()
for i in range(N):
    print(blist[i][1],end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
L = [[] for x in range(N)]

for i in range(N):
    L[i] = [A[i], i+1]
L.sort()

ANS = [0 for i in range(N)]
for i in range(N):
    ANS[i] = L[i][1]
print(*ANS)

Submission status: Accepted

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

order = [0] * n

for i in range(n):
    order[a[i] - 1] = i + 1

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

Submission status: Accepted

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
ans = [0] * n
for i in range(n):
  ans[a[i]-1] = i+1
ans = [str(x) for x in ans]
print(" ".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n=int(input())
l=list(map(int,input().split()))
A=[]
for i in range(n):
    A.append([l[i],i+1])
A.sort()
for i in range(n):
    print(A[i][1],end=" ")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(N: int, A: "List[int]"):
    return " ".join(str(v+1) for v, _ in sorted(enumerate(A), key=lambda a: a[1]))


def main():

    sys.setrecursionlimit(10 ** 6)

    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]"
    print(f'{solve(N, A)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
an = list(map(int,input().split()))
zyunban = [0]*n
t = 1

for x in an:
  zyunban[x-1] = t
  t += 1
  


zyunban = list(map(str,zyunban))

print(" ".join(zyunban))

Submission status: Accepted

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

L = [0]*N

for i in range(N):
    L[A[i]-1] = i+1

print(*L)

Submission status: Accepted

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

Submission status: Accepted

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

l = [0]*N
for i in range(N):
    l[A[i]-1] = i+1

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

Submission status: Accepted

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

# 答えを出力する。print(end=...)は便利！
for i in range(N):
  print(ans[i], end=' ')

Submission status: Accepted

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

for i in range(N):
  print(ans[i], end=' ')

Submission status: Accepted

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

# 辞書型を使い、valueでソートする
dic = {}
for i in range(N):
  dic[i] = A[i]

dic = sorted(dic.items(), key=lambda x:x[1])
for d in dic:
  print(d[0]+1, end=" ")

Submission status: Accepted

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

ans = ''
for i in range(N):
  ans += (l[i] + ' ')
  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int,input().split()))
num = [0]*N
for i in range(N):
  num[a[i]-1]=i
for i in num:
  print(i+1,end=' ')

Submission status: Accepted

Solution code:
# C
N = int(input())
# A = list(map(int, input().split()))
order_number = {}


for num, order in enumerate(map(int, input().split())):
    order_number[num+1] = order

for order, number in sorted(order_number.items(), key=lambda x: x[1]):
    print(order, end=" ")
print()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep  9 02:37:37 2020

@author: liang
"""
"""
key = lambda x:x[1]
"""
N = int(input())
A = [int(i) for i in input().split()]
B = [(i+1,A[i]) for i in range(N)]
B.sort(key=lambda x: x[1])
#print(B)
res = [str(b[0]) for b in B]
#print(res)
print(' '.join(res))