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:
import numpy as np
import sys
N = int(input())
A = list(map(int,input().split()))
ans = np.argsort(A)+1
for a in ans:
    sys.stdout.write(str(a))
    sys.stdout.write(" ")

Submission status: Accepted

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

list = [] * n

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

answer = []
for i in sorted(list):
    answer.append(i[1])

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []
index = list(range(1, n+1))
dic_a = dict(zip(a, index))
#print(dic_a)
sorted_dic_a = dict(sorted(dic_a.items()))
for i in sorted_dic_a.values():
    print(i,end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = sorted([(int(ai),i+1) for i,ai in enumerate(input().split(" "))], key=lambda x: x[0])
for _,i in A: print(i, end=" ")

Submission status: Accepted

Solution code:
N = int(input())
order = [int(v) for v in input().split()]
order = [(v, i + 1) for i, v in enumerate(order)]
order.sort()
res = [str(i[1]) for i in order]
res = ' '.join(res)
print(res)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []
index = list(range(1, n+1))
dic_a = dict(zip(a, index))
#print(dic_a)
sorted_dic_a = dict(sorted(dic_a.items()))
for i in sorted_dic_a.values():
    print(i,end=" ")
print()

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 = [(i+1, k) for i, k in enumerate(map(int, input().split()))]
print(' '.join([str(x[0]) for x in sorted(A, key=lambda x: x[1])]))

Submission status: Accepted

Solution code:
n = int(input())
s = list(map(int,input().split()))
d = {}
for i in range(n):
  d[s[i]] = i
s = []
for k, v in sorted(d.items()):
  s.append(str(v+1))
s = " ".join(s)  
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
school_order = {}
for i in range(N):
  school_order[A[i]] = str(i+1)

ans = []
for j in school_order.values():
  ans.append(j)
print(" ".join([str(n) for n in ans]))

Submission status: Accepted

Solution code:
N = int(input())

l = []
for idx,elem in enumerate([int(x) for x in input().split()],1):
  l.append([idx,elem])

m = sorted(l,key = lambda x: x[1])  

for i in m:
  print(i[0],end=' ')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Oct  4 10:11:27 2019

@author: Md abdul momin
"""

N = int(input())
ans=[0 for i in range(0,100005)]
Val =[int(x) for x in input().split()]
for i in range(1,N+1):
    ans[Val[i-1]]=i
for i in range(1,N+1):
    print(ans[i])

Submission status: Accepted

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

paired_a = list(zip(range(1, n+1), a))

paired_a.sort(key=lambda x:x[1])

print(" ".join([str(pair[0]) for pair in paired_a]))

Submission status: Accepted

Solution code:
N = int(input())
A_list = list(map(int, input().split()))
# my_list = []
# for i in range(len(A_list)):
#     my_list.append((A_list[i], i+1))
# my_list.sort()
# for val in my_list:
#     print(val[1], end=" ")
# print()

my_list = [0] * N
for i in range(len(A_list)):
    my_list[A_list[i] - 1] = i + 1
for val in my_list:
    print(val, end=" ")
print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

student_dic = {}

index = 1

for x in a:
    student_dic[x] = index
    index += 1

for x in range(len(student_dic)):
    print(student_dic[x + 1], end=' ')

Submission status: Accepted

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

s = sorted(range(n), key=lambda x:l[x])

for i in range(n):
  s[i]+= 1
  
print(*s)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=list()
i=0
while i < n :
    ans.append(0)
    i=i+1

i=0
j=0
while i < n:
    j=int(a[i])
    ans[j-1]=i+1
    i=i+1
i=0
while i < n:
    print(ans[i],end=" ")
    i=i+1

Submission status: Accepted

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

print(*order)

Submission status: Accepted

Solution code:
from operator import itemgetter

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	
	n = int(input())

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

	B = [0] * n

	for i,j in enumerate(A):
		B[j-1] = i + 1

	print(*B)

Submission status: Accepted

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

d={}
for i in range(n):
  d[al[i]]=i+1

l=[]
for k,v in sorted(d.items()):
  l.append(v)
  
print(*l,sep=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:



def main():


    n = int(input())
    attendList = list(map(int,input().split()))
    ansList = [0]* n

    for i,k in enumerate(attendList):
        ansList[k-1] = str(i+1)
    print(' '.join(ansList))
        



if __name__ == "__main__":
    main()

Submission status: Accepted

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

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))
for x,y in sorted(b):
  print(y, 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:
# coding: utf-8

#N = map(int, input().split())
N = int(input())
class_list = list(map(int, input().split()))

d = {}
list = []
for value,key in enumerate(class_list):
    d[key]=value+1
for i in range(N):
    list.append(d[i+1])
print(' '.join(map(str, list)))

Submission status: Accepted

Solution code:
import numpy as np

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

lis = np.argsort(A)

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

Submission status: Accepted

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

l_2 = list(zip(range(1, N+1), l))
l_2.sort(key = lambda x: x[1])

print(*[l_2[i][0] for i in range(N)])

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])
for j in range(N):
  if j == N-1:
    print(B[j][0])
  else:
    print(B[j][0] ,end=" ")

Submission status: Accepted

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

    indexed_data = list(zip(range(1, N + 1), data))

    indexed_data.sort(key=lambda x: x[1])

    for index, _ in indexed_data:
        print(index, end=' ')

    print()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
a = list(map(int,input().split(" ")))
b = [0]*n
order = ""
for i in range(n):
	b[a[i]-1]= i+1
for i in b:
  order += str(i) + " "
order.rstrip
print(order)

Submission status: Accepted

Solution code:
import copy
import heapq

def j(n):
    if n:print("Yes")
    else:print("No")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

n = ip()
a = iprow()
s = [0 for i in range(n+1)]
for i in range(n):
    ans = a[i]
    s[ans] = i+1
for i in range(1,n+1):
    print(s[i],end = "")
    if i!=n:
        print(" ",end  = "")

Submission status: Accepted

Solution code:
N = int(input())
A_l = [int(_) for _ in input().split()]
N_l = list(range(N))
tmp = sorted(zip(N_l, A_l), key = lambda x:x[1])
N_l, A_l = zip(*tmp)
N_l = [x+1 for x in N_l]
print(*N_l,sep=' ')

Submission status: Accepted

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

ans = [0] * n

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

Submission status: Accepted

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

dic = {}

for i,num in enumerate(a):
    dic[num-1] = i+1


for i in range(n):
    print(dic[i],end=' ')

Submission status: Accepted

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

b = [i for i in range(N)]

for i in range(N):
    b[list[i]-1] = i+1

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
dic = {}
for i, num in enumerate(a):
    dic[num-1] = i+1

for i in range(n-1):
    print(dic[i], end=' ')
print(dic[n-1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
arr = list(map(int,input().split()))
ans = [0]*n
for i in range(n):
    ans[arr[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(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()))
b = [i for i in range(n)]
for i in range(n):
  b[a[i]-1] = i+1
for i in b:
  print(i, end=" ")

Submission status: Accepted

Solution code:
n=int(input())
A=list(map(int,input().split()))
numbers=list(range(1,n+1))              #出席番号のリスト

D=dict(zip(A,numbers))                  #出席番号と到着順を関連付けるための辞書
for a in sorted(A):
    print(D[a],end=" ")

Submission status: Accepted

Solution code:
n=int(input())
dumA=list(map(int,input().split()))
numbers=list(range(1,n+1))              #出席番号のリスト
A=dumA[:n]                              #到着時の人数のリスト

D=dict(zip(A,numbers))                  #出席番号と到着順を関連付けるための辞書
for a in sorted(A):
    print(D[a],end=" ")

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np

n = int(stdin.readline().rstrip())
a_lst = [int(x) for x in stdin.readline().rstrip().split()]

print(" ".join([str(x) for x in np.argsort(a_lst) + 1]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N=int(input())
A=list(map(int,input().split()))
An=[]
count=1
for i in A:
    An.append((count,i))
    count=count+1
An.sort(key=lambda x:x[1])
ans=[str(m[0]) for m in An]
ans=" ".join(ans)
print(ans)

Submission status: Accepted

Solution code:
#142c
N = int(input())
A_list = list(map(int, input().split()))

#高橋くんは N人の生徒たちのいるクラスの担当教師です。
#生徒たちには 1から Nまでの出席番号が重複なく割り当てられています。
#今日は全ての生徒たちが相異なるタイミングで登校しました。
#高橋くんは、出席番号 iの生徒が登校した時点で、教室に Ai 人の生徒たちがいたことを記録しています(出席番号 iの生徒を含む)。
#記録された情報を元に、生徒たちの登校した順番を復元してください。

#出力 生徒たちの出席番号を登校した順に出力せよ。

#8
#出席番号
#1 2 3 4 5 6 7 8
#登校時の人数
#8 2 7 3 4 5 6 1

#8 2 4 5 6 7 3 1

index_list = [i for i in range(1,N+1)]
class_dict = dict(zip(A_list,index_list))

#print(' '.join(map(str, [A_list.index(i)+1 for i in range(1,N+1)])))

class_sorted = sorted(class_dict.items(),key=lambda x:x[0])
ans = [i[1] for i in class_sorted]
print(' '.join(map(str, ans)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
student_num = int(input())
already = list(int(i) for i in input().split())
order = list(0 for i in range(student_num))

for i in range(student_num):
  order[already[i]-1] = i
             
for i in order:
  print(str(i+1), end=" ")

Submission status: Accepted

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

for i in xrange(len(a)):
    a[i] = [a[i], i + 1]

a.sort()

out = []
for x, y in a:
    out.append(str(y))

print ' '.join(out)

Submission status: Accepted

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

li_wk = sorted([(idx, a) for idx, a in enumerate(li_a)], key=lambda x:x[1])

print(" ".join(str(w[0] + 1) for w in li_wk))

Submission status: Accepted

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

ans={}

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

for k, v in sorted(anｓ.items(), key=lambda x: x[1]):
    print(str(k))

Submission status: Accepted

Solution code:
N = int(input())
records = [(order, index + 1) for index, order in
           enumerate(map(int, input().split(' ')))]


def get_index(record):
    order, index = record
    return str(index)


print(' '.join(map(get_index, sorted(records))))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
a = [int(i) for i in input().split(" ")]
print(" ".join(map(str, np.argsort(a)+1)))

Submission status: Accepted

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

B = sorted(A, key=lambda x: x[1])
ans = [t[0] for t in B]
print(*ans, sep=' ')

Submission status: Accepted

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
lst = [0] * N
for i, v in enumerate(A, 1):
    lst[v-1] = i
print(*lst, sep=' ')

Submission status: Accepted

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

T = [0] * N

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

Submission status: Accepted

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

for i in range(len(h)):
  ans[h[i]-1] = i+1

print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
A=[int(i) for i in input().split(" ")]
d={}
for i,a in enumerate(A):
    d[a]=i+1

retval=[str(d[i+1]) for i in range(N)]
print(" ".join(retval))

Submission status: Accepted

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

D={}
for i in range(n):
      D.update({i+1:A[i]})

D_sorted = sorted(D.items(),key=lambda x:x[1])

D2=[]
for i in range(n):
  D2.append(str(D_sorted[i][0]))


print(' '.join(D2))

Submission status: Accepted

Solution code:
from numpy import *
input()
print(" ".join(map(str,argsort(list(map(int,input().split())))+1)))

Submission status: Accepted

Solution code:
N = int(input())
A = [[int(i),int(j)] for i,j in enumerate(input().split())]
A.sort(key=lambda x: x[1])
for n in range(N):
    print(A[n][0]+1, end=' ')

Submission status: Accepted

Solution code:
N=int(input())
n = list(map(int, input().split()))
s=sorted(range(len(n)), key=lambda k: n[k])
s=list(map(lambda k:k+1,s))
print(*s)

Submission status: Accepted

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


for i in range(len(A)):
  B[A[i]-1] = i+1

print(*B)

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
print(' '.join(list(map(str,list(map(lambda x: x+1,sorted(range(N), key=lambda x: A[x])))))))

Submission status: Accepted

Solution code:
from operator import itemgetter

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

print(*[t[0] + 1 for t in sorted(enumerate(A), key=itemgetter(1))])

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 ans:
    print(i, end=' ')

Submission status: Accepted

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

for i in range(n):
  print(ans[i])

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):
    ans[a[i]-1]=i+1
for i in range(n):
    print(ans[i])

Submission status: Accepted

Solution code:
from sys import stdin


N = int(stdin.readline())
A = list(map(int, stdin.readline().split()))


toukou_list = [i for i in range(N)]

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

print(*toukou_list)

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

Submission status: Accepted

Solution code:
n=int(input())
order={}
for i,v in enumerate(input().split()):
    order[int(v)]=i+1
order = sorted(order.items(), key=lambda x:x[0])
for k,v in order:
    print(v,end=" ")
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:
#!/usr/bin/python3
# -*- coding: utf-8 -*-



N = int(input())
An = list(map(int, input().split()))
Rn = [0 for _ in range(N)]
for i in range(N):
  Rn[An[i]-1] = i+1
print(*Rn)

Submission status: Accepted

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

ans = ''
for tp in sorted(l):
    ans += (tp[1]+' ')

print(ans[:-1])

Submission status: Accepted

Solution code:
# N人数
# 教室にいる人数

N = int(input())
A = list(map(int, input().split()))
work = [0] * N

# 連想配列に
for n in range(N):
    work[A[n] - 1] = str(n + 1)

print(" ".join(work))

Submission status: Accepted

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

for i in range(n):
    b.append(0)

for j in range(n):
    b[a[j]-1] = str(j+1)
    
print(' '.join(c[0]))

Submission status: Accepted

Solution code:
'''
>>> main(3,[2,3,1])
3 1 2

>>> main(5, [1, 2, 3, 4, 5])
1 2 3 4 5

>>> main(8,[8, 2, 7 ,3, 4, 5 ,6, 1])
8 2 4 5 6 7 3 1
'''


def main(n, a):
    l = [0 for _ in range(n)]

    count = 1
    for i in a:
        l[i - 1] = count
        count += 1

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


if __name__ == '__main__':
    n = int(input())
    a = map(int, input().split(' '))

    main(n, a)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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) 
print(" ".join(map(str,b)))

Submission status: Accepted

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

Submission status: Accepted

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

lst = []
for i , j in enumerate(A):
  lst.append( [j,i+1] )
  
lst = sorted( lst )


print( * [ i[1] for i in lst ] )

Submission status: Accepted

Solution code:
N = int(input())

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

b_list = []
for i, a in enumerate(a_list):
    b_list.append((i+1, a))

b_list = sorted(b_list, key=lambda x: int(x[1]))

c_list = []
for i, b in b_list:
    c_list.append(str(i))

print(' '.join(c_list))

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

print(" ".join(ans))

Submission status: Accepted

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

order=[0 for _ in range(N)]
for i in range(N):
    order[A[i]-1]=i+1
#print(order)
for i in range(N):
    print(order[i],end=" ")

Submission status: Accepted

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

S = sorted(enumerate(A), key=lambda x: x[1])
S = map(lambda x: x[0] + 1, S)

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

Submission status: Accepted

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
tmp = list()
for n in range(len(A)):
  tmp.append([n+1, A[n]])
tmp = sorted(tmp, key=lambda x: x[1])
res = []
for x in tmp:
  res.append(x[0])
print(*res)

Submission status: Accepted

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

A_tuple_list = []

for i in range(len(A)):
    A_tuple_list.append((i, A[i]))

A_tuple_list.sort(key= lambda x:x[1])

# print('----------output----------')
for a in A_tuple_list:
    print(a[0]+1, end=' ')

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
d={}
for i in range(1,1+n):
    d[a[i-1]]=i
sortd=sorted(d.items(),key=lambda x:x[0])
sl=[0]*n
for i in range(n):
    sl[i]=sortd[i][1]
print(*sl)

Submission status: Accepted

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

B = [[n+1, A[n]] for n in range(N)]
B.sort(key=lambda x:x[1])

ans = [B[n][0] for n in range(N)]
print(*ans)

Submission status: Accepted

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

"""
for h in range(1,N+1):
    for i in range(N):
        if A[i] == h:
            print(i + 1)
#このやり方でもOKだけど、nが馬鹿でかくなった時にTLEしちゃうよ
"""

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

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

Submission status: Accepted

Solution code:
from operator import itemgetter

N = int(input())
key = list(map(int, input().split()))
stu = list(range(1, len(key)+1))

key, stu = zip(*sorted(zip(key, stu), key=itemgetter(0)))

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

Submission status: Accepted

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

ans = [0 for i in range(n)]
for i,j in enumerate(a,1):
    ans[j-1] = str(i)
    
print(" ".join(ans))

Submission status: Accepted

Solution code:
n = int(input())
a = [int(s) for s in input().split()]
l_ia = []
for i in range(n):
    # 出席番号i+1の生徒はa[i]番目に登校した
    l_ia.append([a[i], i+1])
l_ia.sort()
# turn = [l_ia[i][1] for i in range(n)]
# print(*turn)
print(*[l_ia[i][1] for i in range(n)])

Submission status: Accepted

Solution code:
n = int(input())
a = [int(s) for s in input().split()]
l_ia = []
for i in range(n):
    # 出席番号i+1の生徒はa[i]番目に登校した
    l_ia.append([a[i], i+1])
l_ia.sort()
turn = [l_ia[i][1] for i in range(n)]
print(*turn)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
x = np.argsort(a)
for i in range(n):
    print(x[i]+1, end=' ')

Submission status: Accepted

Solution code:
n = int(input())
a = map(int, input().split())
b = [i for i in range(1, n+1)]
c = dict(zip(a, b))
c = dict(sorted(c.items()))
for i in c.values():
    print(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] = str(i+1)

print(' '.join(b))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve(string):
    n, *a = map(int, string.split())
    ans = [0] * n
    for i, _a in enumerate(a, 1):
        ans[_a - 1] = str(i)
    return " ".join(ans)


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Submission status: Accepted

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

Submission status: Accepted

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

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
for i in range(n):
    print(b[i],end=" ")

Submission status: Accepted

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

B = list(range(1,N+1))
ab = []

for i in range(N):
    ab.append([A[i], B[i]])

ab.sort()

for i in range(N):
    print(ab[i][1], end = " ")

print()

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:
from operator import itemgetter
import numpy as np
N = int(input())
A = [int(x) for x in input().split()]
ls = []
for i in enumerate(A,1):
    ls.append(i)
ls.sort(key=itemgetter(1))
ls = np.array(ls)
print(*ls[:,0])

Submission status: Accepted

Solution code:
import sys
N = int(input())
S = list(map(int,input().split()))
d = {}

for i in range(1,N+1):
  d[i] = S[i-1]


d2 = sorted(d.items(), key = lambda x:x[1])

for i in range(0,len(d2)):
  print(d2[i][0])

Submission status: Accepted

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

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

B.remove(0)
B = map(str,B)

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

Submission status: Accepted

Solution code:
import numpy as np
n = input()
a = list(map(int, input().split()))

ans = np.argsort(a) + 1
ans = map(str, ans.tolist())
print(' '.join(ans))

Submission status: Accepted

Solution code:
d = map(int, input().strip())
g = list(map(int, input().strip().split()))
#print(d)
#print(g)
h = []
for i in range(len(g)):
    h.append([g[i], i + 1])
#print(h)
h.sort()
#print(h)
for i in h:
    print(str(i[1]), end=' ')

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
people = {i:a for a,i in zip(A,[j for j in range(1,N+1)])}
#print(people)
people_sorted = sorted(people.items(),key=lambda x:x[1])
#print(people_sorted)
P = [i[0] for i in people_sorted]
for p in P:
    print(p,end =" ")

Submission status: Accepted

Solution code:
def solve(string):
    n, *a = map(int, string.split())
    a = sorted([(_a, i) for i, _a in enumerate(a, start=1)])
    return " ".join([str(i) for _, i in a])


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Submission status: Accepted

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

Submission status: Accepted

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

MOD = 10 ** 9 + 7

n = int(input())
an = list(map(int, input().split()))
an = [[an[i - 1], i] for i in range(1, n + 1)]
an.sort()

ans = ' '.join(map(lambda x: str(x[1]), an))

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

Submission status: Accepted

Solution code:
n = int(input())
a = list([int(x), int(y)+1] for x, y in zip(input().split(), range(n)))
a.sort()
for i in range(n):
    print(a[i][1], end=" ")

Submission status: Accepted

Solution code:
N = int(raw_input())
A = list(map(int,raw_input().split()))
ans = [0]*N
for (index,con) in enumerate(A):
  ans[con-1] = index+1
for i in ans:
  print i,

Submission status: Accepted

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

L=list()
for i in range(N):
    l=[A[i],i+1]
    L.append(l)
L.sort(key=lambda x:x[0])

s=str(L[0][1])
for i in range(N-1):
    s+=" "+str(L[i+1][1])
print(s)

Submission status: Accepted

Solution code:
N = int(input())
a_list = [int(h) for h in input().split()]
attendance_list = [0 for _ in range(N)]
for i, a in enumerate(a_list):
    attendance_list[a-1] = i + 1
for i, attendance in enumerate(attendance_list):
    if i == len(attendance_list) - 1:
        print(attendance)
    else:
        print(attendance, end=" ")

Submission status: Accepted

Solution code:
N = int(input())

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

per = [0] * N
i = 1
for a in A:
    per[a - 1] = i
    i += 1


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

Submission status: Accepted

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

Submission status: Accepted

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

tmp = sorted(range(1, len(A) + 1), key=lambda x:A[x - 1])
ans = [str(_) for _ in tmp]
print(" ".join(ans))