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: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
A = [int(_) for _ in input().split(" ")]

tmp = np.argsort(A)
tmp2= tmp + np.ones(N)
tmp3 = [int(_) for _ in tmp2.tolist()]
ans = [str(_) for _ in tmp3]

print(" ".join(ans))

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
A = [int(_) for _ in input().split(" ")]

ans = np.argsort(A)

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

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int,input().split()))
l = []
for i, a in enumerate(A,1):
  l.append([i,a])
l = sorted(l, key=lambda x:x[1])
for i in range(len(l)):
  print(l[i][0], end=" ")

Submission status: Accepted

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

Submission status: Accepted

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

cnt=1
lst=[]
for i in A:
  lst.append([i,cnt])
  cnt+=1
  
lst=sorted(lst)
  
print( *[x[1] for x in lst])

Submission status: Accepted

Solution code:
def main():

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
a2 = np.argsort(a) + 1
a3 = map(str, a2) 
mojiretsu = ' '.join(a3)

print(mojiretsu)

Submission status: Accepted

Solution code:
n = int(input())
an = [int(i) for i in input().split()]
ansl = [0]*n

for index,item in enumerate(an):
  ansl[item-1] = index+1
print(" ".join(map(str, ansl)))

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 a in ans:
    print(a, end = " ")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(*[ans[i][1] for i in range(n)])

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    lst = [(i, a) for i, a in enumerate(A)]
    lst.sort(key=lambda x: x[1])
    ans = [x[0] + 1 for x in lst]
    print(*ans)


if __name__ == "__main__":
    main()

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from operator import itemgetter
n = int(input())
list_a = list(map(int, input().split()))

list_a2 = []
for i in range(n):
    list_a2.append([list_a[i], i+1])

list_a2 = sorted(list_a2, key = itemgetter(0))

print(" ".join(map(str, [x[1] for x in list_a2])))

Submission status: Accepted

Solution code:
import numpy as np

N, *A, = map(int, open(0).read().split())
B = np.empty(N, dtype=int)

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

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip('\n')

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

IA = [(i,A[i]) for i in range(N)]
IA.sort(key=lambda a: a[1])
I = [str(ia[0]+1) for ia in IA]
print(' '.join(I))

Submission status: Accepted

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

print(*X)

Submission status: Accepted

Solution code:
a=int(input())
ans=[]
la=input().split()
lis=[[int(la[i]),i] for i in range(a)]
lis=sorted(lis)
for i in range(a):
  if i!=a-1:
  	print(lis[i][1]+1,end=" ")
  else:
    print(lis[i][1]+1)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
from collections import defaultdict
d = defaultdict(int)
for i in range(N):
  d[A[i]] = i+1
print(' '.join([str(d[i]) for i in range(1,N+1)]))

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
dict= {}
for i in range(1,N+1):
  dict[A[i-1]] = i
ret = [dict[v] for v in range(1,N+1)]
print(' '.join(map(str,ret)))

Submission status: Accepted

Solution code:
def solve(n, a):
    v = [(i, a[i]) for i in range(n)]
    u = [p+1 for p, q in sorted(v, key=lambda _:_[1])]
    return " ".join(map(str, u))

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
l = list(range(n))
a_ = []
ans = []
for _a, _l in zip(a, l):
    a_.append([_a, _l+1])
a_.sort()

for i in range(n):
    ans.append(a_[i][1])
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int,input().split()))
ans = [0 for _ in range(n)]

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

[print(x, end=" ") for x in ans]

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n = inp()
a = inpl()
aa = []
for i in range(n):
    aa.append([i+1,a[i]])
aa.sort(key=lambda x:x[1])
for i in range(n):
    print(aa[i][0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
r = [int(x) for x in input().split()]
l = []
for i in range(N):
  l.append((r[i], i+1))
l.sort()
for i in range(N-1):
  print(l[i][1], end = " ")
print(l[N-1][1])

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():

    n = ii()
    a = li()

    ans = list(sorted(range(n),key=lambda x: a[x]))
    ans = list(map(lambda x: x+1,ans))
    print(*ans)






main()

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
X = sorted([(i, a) for i, a in enumerate(A)], key=lambda x:x[1])
ans = ""
for x in X:
  ans += "%d "%(x[0]+1)
print(ans)

Submission status: Accepted

Solution code:
t=int(input().strip())
li=[0]*500000
num=map(int,input().strip().split())
for idx,val in enumerate(num):
    li[val-1]=idx+1
for i in range(t):
    print(li[i],end=' ')
print()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=list(range(1,n+1))
dic=dict(zip(a,b))
dic=sorted(dic.items())
c=[]
for i in dic:
    c.append(i[1])
print(*c)

Submission status: Accepted

Solution code:
N = int(input().split()[0])
aa = input().split()
bb = [0]*N

for i in range(0, N):
    bb[int(aa[i]) - 1] = i + 1

print(*bb)

Submission status: Accepted

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

s = [""] * n
for i, x in enumerate(a):
    s[x-1] = str(i+1)

print(' '.join(s))

Submission status: Accepted

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

order = sorted(range(len(A)), key=lambda k: A[k])
order = [str(x + 1) for x in order]

print(" ".join(order))

Submission status: Accepted

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

d = [0]*N

for i, a in enumerate(A):
    d[a-1] = str(i+1)

print(' '.join(d))

Submission status: Accepted

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

Submission status: Accepted

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

result = sorted([{'i':i, 'a': a} for i, a in enumerate(A)], key=lambda x:x['a'])
print(' '.join([str(x['i'] + 1) for x in result]))

Submission status: Accepted

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

result = []
for i, a in enumerate(A):
    result.append({'i':i, 'a': a})

result.sort(key=lambda x: x['a'])
print(' '.join([str(x['i'] + 1) for x in result]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
nums = list(enumerate(A, start=1))
nums.sort(key=lambda x: (x[1], x[0]))
print(' '.join(map(str, (x[0] for x in nums))))

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
student_list = [0] * (N + 1)
turn_list = [int(x) for x in input().split()]

for i, s in enumerate(turn_list):
    student_list[s] = i + 1
student_list.pop(0)
for s in student_list:
    print(str(s), end=' ')
print()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    N = int( input())
    A = list( map( int, input().split()))
    B = [ (A[i], i+1) for i in range(N)]
    B.sort()
    print( " ".join( map( str, map( lambda x:x[1], B))))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    N = int(input())
    A = list(map(int,input().split()))
    num = [-1 for _ in range(N)]
    for i in range(N):
        num[A[i]-1] = i+1

    print(*num)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int, input().split()))
d = []
for i in range(n):
  d.append((l[i],i+1))
d.sort(key = lambda x:x[0])
for i in range(n):
  print(d[i][1],end=' ')

Submission status: Accepted

Solution code:
t = int(input().strip())
li = [0] * 500000
num = map(int,input().strip().split())
for idx,val in enumerate(num):
    li[val - 1] = idx+1
for i in range(t):
    print(li[i],end=' ')
print()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
d = {}
for i in range(n):
    d[a[i] - 1] = i + 1
for i in range(n):
    print(d[i], end=' ')
print('')

Submission status: Accepted

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


def solve(N: int, A: "List[int]"):
    A = zip(range(1, N+1), A)
    A = sorted(A, key=lambda x: x[1])
    A = [str(a[0]) for a in A]
    S = ' '.join(A)
    print(S)
    return


# Generated by 1.1.5 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 = list(map(int,input().split()))
b=sorted(range(len(a)), key=lambda k: a[k])
for i in range(len(a)):
  print(b[i]+1)

Submission status: Accepted

Solution code:
# coding: utf-8


def solve():
    N, *al = map(int, open(0).read().split())
    a_dic = {}
    
    for i in range(N):
        a_dic[i+1] = al[i]
    
    a_dic_soted = sorted(a_dic.items(), key=lambda x:x[1])
    
    for i in a_dic_soted:
        print(i[0], end=' ')


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

for r in res:
    print(r, end = ' ')

Submission status: Accepted

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

b=list(enumerate(a))

c=sorted(b, key=lambda x: x[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
_,a=zip(*sorted(zip(a,range(n))))
print(*[x+1 for x in a])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

alist = list(map(int, input().split()))
blist = [[i, alist[i]] for i in range(n)]
blist.sort(key=lambda x: x[1])
for studentID, howmany in blist:
    print(studentID+1)

Submission status: Accepted

Solution code:
#abc142c
n=int(raw_input())
a=map(int,raw_input().split())
s=[]
for i in range(n):
 s.append([i+1,a[i]])
s=sorted(s,key=lambda x:x[1])
for i in range(n):
 print s[i][0],
print

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:
import numpy as np
n = int(input())
L = [int(i) for i in input().split()]
T = [-1 for i in range(n)]

for i in range(n):
  T[L[i]-1] = i+1

for i in range(n-1):
  print("{0} ".format(T[i]), end="")
print(T[-1])

Submission status: Accepted

Solution code:
N = int(input())
As = list(map(int,input().split(" ")))
for i in range(1,N+1):
    As[i-1]=(As[i-1],i)
As.sort(key = lambda x:x[0])
ans =list(map(lambda x:x[1],As))
print(*ans)

Submission status: Accepted

Solution code:
import sys

#+++++
		
def main():
	n = int(input())
	al = list(map(int, input().split()))
	
	aal=[(i,v) for i,v in enumerate(al)]
	aal.sort(key=lambda x: x[1])
	#pa(aal)
	ans_s=[str(i+1) for i,v in aal]
	print(' '.join(ans_s))
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
N = int(input())

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

B = sorted(range(1, len(A) + 1), key=lambda k: A[k - 1])

for b in B:
    print(b)

Submission status: Accepted

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

Adict = {}
for i in range(1,n+1):
    Adict[A[i-1]] = i

Alist = sorted(Adict.items())
ans = [Alist[i][1] for i in range(len(Alist))]
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a = [int(i) for i in input().split()]
b=[]
for i in range(len(a)):
    b.append([a[i],i+1])
b.sort()
for i in b:
    print(i[1],end=' ')

Submission status: Accepted

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

for i in range(N):
    dic.setdefault(i+1,A[i])

new_dic = sorted(dic.items(), key=lambda x:x[1])


for item in new_dic:
    print(item[0],end=" ")
print()

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
L = [int(i) for i in input().split()]
T = [-1 for i in range(n)]

for i in range(n):
  T[L[i]-1] = i+1

for i in range(n-1):
  print("{0} ".format(T[i]), end="")
print(T[-1])

Submission status: Accepted

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

b = []
for i,e in enumerate(a):
  b.append((e,i+1))
  
b.sort()

for i,t in enumerate(b):
  if i == n-1:
    print(t[1])
  else:
    print(t[1],end=' ')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from operator import itemgetter
n = int(input())
aaa = list(map(int, input().split()))
bbb = sorted(list(enumerate(aaa, start=1)), key=itemgetter(1))
print(*map(itemgetter(0), bbb))

Submission status: Accepted

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

for i , a  in enumerate(A): #リストAのインデックスiと値a
    O[a-1] = i+1

print(*O)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n=int(input())
A=[(e,i) for i,e in enumerate(list(map(int,input().split())))]
A.sort(key=lambda tup: tup[0])
for e,i in A:
    print(i+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
As = list(map(int, input().split()))
B = [[i+1,j] for i,j in enumerate(As)]
B.sort(key=lambda x: x[1])
ans = ""
for i in B:
  ans += str(i[0]) + " "
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]=str(i+1)
ans=' '.join(ans)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
P = [ (a, i+1) for (i, a) in enumerate(A) ]
P.sort()
print(" ".join([ str(p[1]) for p in P ]))

Submission status: Accepted

Solution code:
N = int(input())
A, ans = list(map(int, input().split())), [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())
A = list(map(int,input().split()))
ans = [0]

for i in range(N-1):
    ans.append(0)

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

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

Submission status: Accepted

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

def main():
    N = int(input())
    A = list(map(int,input().split()))
    B = [(Ai, i+1) for i, Ai in enumerate(A)]
    B.sort()
    print(" ".join([str(Bi[1]) for Bi in B]))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

b=sorted(enumerate(a),key= lambda x :x[1])

for i in range(len(a)):
    print(b[i][0]+1)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n = int(input())
    studentNumbers = [(str(i + 1), int(x)) for i, x in enumerate(input().split())]
    studentNumbers.sort(key=lambda tup: tup[1])
    print(' '.join([x[0] for x in studentNumbers]))

Submission status: Accepted

Solution code:
from collections import OrderedDict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


def main():
    n = int(input())
    od = OrderedDict()
    a = list(map(int, input().split()))
    for i in range(len(a)):
        od[a[i]] = i+1

    p = OrderedDict(
        sorted(od.items(), key=lambda x: x[0])
    )

    print(*[v for k, v in p.items()])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n = int(input())
    """studentNumbers = [(x, str(i)) for x, i in
        zip(input().split(), range(1, 1000000))]
    studentNumbers.sort(key=lambda tup: tup[0])
    print(' '.join([x[1] for x in studentNumbers]))"""
    studentNumbers = [int(x) for x in input().split()]
    times = [0 for i in range(n)]
    for i in range(n):
        times[studentNumbers[i] - 1] = str(i+1)
    print(' '.join(times))

Submission status: Accepted

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

arr1 = {}
for i,x in enumerate(A):
	arr1[i+1] = x

arr2 = sorted(arr1.items(), key=lambda x:x[1])

ans = ''
for k,v in arr2:
		print(k)

Submission status: Accepted

Solution code:
n = int(raw_input())
a = map(int,raw_input().split())
t = []
for i in xrange(n):
	t.append((a[i],i+1))
t = sorted(t)
print " ".join(str(x[1]) for x in t)

Submission status: Accepted

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

for i in range(n):
  ch.append([a[i], i+1])
ch.sort()
for i in range(n):
  if i==n-1:
    print(ch[i][1])
  else:
    print(ch[i][1], end=" ")

Submission status: Accepted

Solution code:
N = int(input())
A = input().split(' ')
 
t = []
for i in range(N):
    t.append(0)
 
for i in range(N):
    t[int(A[i]) - 1] = str(i + 1)
 
res = ' '.join(t)
 
print(res.strip())

Submission status: Accepted

Solution code:
_n = int(input())
_records = list(map(int, input().split()))
_order = [0] * _n
_rank = 1
for _i in range(_n):
  _order[_records[_i] - 1] = _i + 1
      
print(" ".join(map(str, _order)))

Submission status: Accepted

Solution code:
from operator import itemgetter
N = int(input())
A = [(ind+1,int(x)) for ind,x in enumerate(input().split())]
A.sort(key=itemgetter(1))
ans = []
for a in A:
  ans.append(a[0])
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
b=[int(x) for x in range(1,n+1)]

d={ea:eb for (ea,eb) in zip(a,b)}

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
t = list(range(1, n+1))

d = dict(zip(a,t))
for k,v in sorted(d.items(), key=lambda x: x[0]):
    print(v, end=" ")

Submission status: Accepted

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

#output
B = [(i+1, j) for i, j in enumerate(A)]

C = sorted(B, key = lambda x:x[1])

for i in range(N):
    print(C[i][0], end = " ")

Submission status: Accepted

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

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

Submission status: Accepted

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

B = [0]*N
i = 1
for num in A:
    B[num-1] = i
    i += 1

print(*B)

Submission status: Accepted

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

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:
import numpy as np
N = int(input())
l = np.array(list(map(int, input().split())))
order = np.argsort(l) + 1 
print(*order)

Submission status: Accepted

Solution code:
N = int(input())
array = list(map(int, input().split()))
numbers = [100 for i in range(N)]
num = 1


for i in array:
  numbers[i-1] = num
  num += 1

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

Submission status: Accepted

Solution code:
N=int(input())
keys=list(map(int,input().split()))
A={ value:index  for index,value in enumerate(keys,1) }

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

Submission status: Accepted

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


def main():
    n = int(input())
    a = list(map(int, input().split()))
    d = dict()
    ans = list()

    for i, ai in enumerate(a, 1):
        d[i] = ai

    for j, di in sorted(d.items(), key=lambda x: x[1]):
        ans.append(j)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import deque

input = sys.stdin.readline

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


aq =deque(A)
b= [0]*N

for i in range(N):
    b[aq.popleft()-1] = i+1

print(*b,sep=' ')

Submission status: Accepted

Solution code:
#C
N = input()
A_str = input().split(" ")
A_int = [int(str) for str in A_str]

res = list(A_int)

for i in range(len(A_int)):
    res[A_int[i]-1] = i+1

res_str = [str(n) for n in res]
res_out = ' '.join(res_str)
print(res_out)

Submission status: Accepted

Solution code:
import sys


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
dic ={}
p=1
for i in a:
   dic[i]=p
   p=p+1
s=sorted(dic)
for t in s:
    print(dic[t],end=" ")

Submission status: Accepted

Solution code:
def main():
  N = int(input())
  A = list(map(int, input().split()))
  rank = [[] for _ in range(N)]

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


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
n=int(input())
a=[[int(x),i+1] for i,x in enumerate(input().split())]
a.sort()
print(' '.join(str(i) for x,i in a))

Submission status: Accepted

Solution code:
def main():
    N, *A = map(int, open(0).read().split())
    ans = [0] * N
    for k, v in enumerate(A, 1):
        ans[v - 1] = k
    print(" ".join(map(str, ans)))
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    N, *A = map(int, open(0).read().split())
    ans = [0] * (N + 1)
    for k, v in enumerate(A, 1):
        ans[v] = k
    print(" ".join(map(str, ans[1:])))
    return


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N, *A = map(int, open(0).read().split())
    ans = [0] * N
    for k, v in enumerate(A, 1):
        ans[v - 1] = k
    print(" ".join(map(str, ans)))
    return


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    N, *A = map(int, open(0).read().split())
    ans = [0] * N
    for k, v in enumerate(A, 1):
        ans[v - 1] = k
    print(" ".join([str(a) for a in ans]))
    return


main()

Submission status: Accepted

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

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

print(*ans)

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
A = sorted([(i+1, int(a)) for i, a in enumerate(stdin.readline().rstrip().split())], key=lambda t: t[1])
for t in A:
    print(t[0], end=" ")

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
a = np.array(list(map(int,input().split())))
a_sort = np.argsort(a)
ans = a_sort + 1
for i in (ans):
    print(i, end=" ")

Submission status: Accepted

Solution code:
n = int(input())
a_list = list(map(int, input().split()))
come_list = [0] * n
come_num = 0
for a in a_list:
  come_list[a-1] = come_num+1
  come_num += 1

print(*come_list)

Submission status: Accepted

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

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

print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
order = [0 for _ in range(n)]
ai_list = list(map(int,input().split()))
i = 1
for ai in ai_list:
    order[ai-1] = i
    i += 1
for x in order:
    print(x,end = ' ')

Submission status: Accepted

Solution code:
from operator import itemgetter


def main():
    A = {k + 1: v for k, v in enumerate(map(int, open(0).read().split()[1:]))}
    # value `昇順
    print(" ".join([str(i[0]) for i in sorted(A.items(), key=itemgetter(1))]))
    return


main()

Submission status: Accepted

Solution code:
import numpy as np

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

for i in np.argsort(A) + 1:
    print(i, end=' ')

Submission status: Accepted

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

for i in A:
    i = [i,count]
    count += 1
    S.append(i)

S.sort()
for i,j in S:
    print(j+1,end = "")
    count -= 1
    if(count != 0):
        print(" ",end="")