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 math
n = int(input())

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

ans = []

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

for i in ans:
    print(i[1],end = " ")

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def SS(): return map(str,sys.stdin.readline().rstrip().split())
def II(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
A = LI()
A = [(l,i) for i,l in zip(range(1,N+1),A)]

A.sort()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
l = [0 for n in range(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 = [int(hoge) for hoge in input().split()]
ans = [0]*N
for n,a in enumerate(A):
    ans[a-1] = n+1
print(*ans)

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def solve(A):
    n = len(A)
    ans = [0] * n
    for i in range(n):
        ans[A[i]-1] = i + 1
    return ans

def main():
    n = int(input())
    A = list(map(int, input().split()))
    ans = solve(A)
    print(' '.join(list(str(a) for a in ans)))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
def py():
    print("Yes")
def pn():
    print("No")
def iin():
    x = int(input())
    return x

neko = 0
nya = 0
nuko = 0

n = iin()
a = [int(x) for x in 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())
lia = [int(s) for s in input().split()]
lib = [0]*n
for i in range(n):
    lib[lia[i] - 1] += i + 1
lic = [str(s) for s in lib]
print(" ".join(lic))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#print#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code

#なお、任意の整数 M に対して M の −2 進数表現が一意に定まることが証明できます。
#2桁ごとに見るとよかった（もう実験したよ）
def resolve():
    N,=pin()
    A=list(pin())
    B=[(i+1,A[i]) for i in range(N)]
    B.sort(key=lambda x:x[1])
    ans=[]
    for b in B:
        ans.append(b[0])
    print(*ans)
resolve()

Submission status: Accepted

Solution code:
n = int(input())
a = map(int, input().split())
students = {}
for i, j in enumerate(a, start=1):
    students[j] = i

students = sorted(students.items())

for i in range(n):
    a, b = students[i]
    print(b, end=' ')

Submission status: Accepted

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

ans = [0] * n
for i in range(n):
    ans[an[i] - 1] = i + 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

def main():
    N = int(readline())
    A = list(map(int, readline().split()))
    tmp = []
    for i, a in enumerate(A):
        tmp.append((i, a))
    tmp.sort(key=lambda a: a[1])
    ans = []
    for i in tmp:
        ans.append(i[0]+1)
    print(*ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit
getarr = lambda _f: list(map(_f, input().split()))

n = int(input())
a = getarr(int)

t = [(ai, i + 1) for i, ai in enumerate(a)]
t.sort()

print(*[ti[1] for ti in t], sep=" ")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

a = [0]*N

num = 1

for i in A:
  a[i-1] = num
  num += 1

ans=[str(_) for _ in a]
ans=" ".join(ans)

print(ans)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    n = int(input())
    o = list(map(int, input().split()))
    l = [0]*n
    for i in range(n):
        l[o[i]-1] = i+1
    print(" ".join(map(str,l)))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    ans = 0
    n = int(input())
    o = list(map(int, input().split()))
    l = [0]*n
    for i in range(n):
        l[o[i]-1] = i+1
    print(" ".join(map(str,l)))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    ans = 0
    n = int(input())
    o = list(map(int, input().split()))
    l = [0]*n
    for i in range(n):
        l[o[i]-1] = i+1
    for i in range(len(l)):
        if  i != len(l)-1:
            print("{} ".format(l[i]), end='')
        else:
            print(l[i])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c

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

# ans = str(A_list.index(1) + 1)
# for i in range(2, N + 1):
#     tmp = str(A_list.index(i) + 1)
#     ans = ' '.join([ans, tmp])



ans_list = [0] * N

for i in range(N):
    ans_list[A_list[i] - 1] = i + 1

# リストを空白区切りで出力
print(*ans_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
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def o(a):
    for i in range(len(a)):
        a[i]=[a[i],i+1]
    return a             

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

a=o(a)

q=[0]*n

for i in range(len(a)):
    q[a[i][0]-1]=a[i][1]

for i in q:
    print(i," ",end='')

Submission status: Accepted

Solution code:

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

d={}
for i in range(1,n+1):
    d[i]=a[i-1]
# print(d)
A_sorted = sorted(d.items(), key=lambda x:x[1])

print(*list(A_sorted[i][0] for i in range(n)))

Submission status: Accepted

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

main()

Submission status: Accepted

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

for i, j in enumerate(num):
  dp[j - 1] = str(i + 1)

print(' '.join(dp))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))

turn = [" " for _ in range(n)]
for i in range(n):
  turn[a[i]-1] = i+1

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

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
li = [0]*(n+1)# 来た順番を格納するリスト

for i,j in enumerate(a,1):
    li[j] = i

print(*li[1:])

Submission status: Accepted

Solution code:
N=int(input())
A=list(map(int,input().split()))
L=[None]*N
for id,x in enumerate(A):
  L[x-1] = id+1
str_L=map(str,L)
print(' '.join(str_L))

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


n = I()
A = LI()
B = [0]*n

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

print(" ".join([str(x) for x in B]))

Submission status: Accepted

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

a = [(j,i) for (i,j) in enumerate(a)]
a = sorted(a)
a = [i+1 for (_,i) in a]
print(*a)

Submission status: Accepted

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

S ={A[i]:i+1 for i in range(N)}

for i in range(N):
  print(S[i+1],end="")
  if i==N-1:
    print("")
  else:
    print(" ",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(*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
for i in range(n):
    print(b[i],end=" ")

Submission status: Accepted

Solution code:
N=int(input())
L=list(map(int,input().split()))
l=[0 for i in range(N)]
for i in range(N):
  l[L[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, 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()))

B = [0 for i in range(N)]

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))

turn=[" " for _ in range(n)]
for i in range(n):
  turn[a[i]-1]=i+1

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# C - Go to School

N = int(input())
A = [int(a) for a in input().split()]
D = {}
for i in range(N):
    D[i] = A[i]
sort = sorted(D.items(), key=lambda x: x[1])
ans = [i[0] + 1 for i in sort]
print(*ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
alist = [(i, x) for i, x in enumerate(a, start=1)]
alist.sort(key=lambda x: x[1])
slist = [str(x) for i, (x, y) in enumerate(alist)]
print(' '.join(slist))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int , input().strip().split()))
students = {}
ans = []

for i in range(len(a)):
  students[i] = a[i]
students= sorted(students.items(), key=lambda x:x[1])

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

print(' '.join(ans))

Submission status: Accepted

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

d={}
for i in range(N):
  d[i]=A[i]
  
#print(A)  
#print(d)
#print(sorted(d.items(), key=lambda x:x[0]))
#print(sorted(d.items(), key=lambda x:x[1]))
ans=sorted(d.items(), key=lambda x:x[1])
for i in range(N):
  print(ans[i][0]+1,end=' ')

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

cin = dict(zip(a, num))
ans =[]

for i in range(n):
    ans.append(cin[i+1])

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
tmp = [0]
tmp += list(map(int, input().split(' ')))
A = {}
for i in range(1, N + 1):
  A[tmp[i]] = i
for i in range(1, N):
  print("{} ".format(A[i]), end="")
print(A[N])

Submission status: Accepted

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

ans = [0] * n
for i, x in enumerate(a):
    ans[x-1] = 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 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()))
B = []
for i in range(N):
  B += [[A[i], i+1]]
B.sort(key=lambda x:x[0])
for a, b in B:
  print(b, 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()))

res = [0] * (N + 1)

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

print(*res[:-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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


d={}

for i in range(N):
    d[i+1]=Students[i]

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

ans=[]
for k in d_2:
    ans.append(k[0])

print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = list(map(int, input().split(' ')))
    ordered_students = ['' for _ in range(N)]
    for i, a in enumerate(A):
        ordered_students[a - 1] = str(i + 1)
    print(' '.join(ordered_students))


if __name__ == '__main__':
    main()

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=[str(a) for a in ans]
ans=' '.join(ans)
print(ans)

Submission status: Accepted

Solution code:
import math

a=int(input())
li = list(map(int,input().split()))	
x = a*[0]
for i in range(len(li)):
    x[li[i]-1]=i+1
for i in range(len(li)):
    print(x[i], end=" ")

Submission status: Accepted

Solution code:

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

rev=[0]*n
for i in range(n):
    rev[a[i]-1]=i+1
for i in range(n):
    print(rev[i],end=" ")
print()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    _ = input()
    A = list(map(int, input().split()))
    d = dict()
    for i in range(len(A)):
        d[i+1] = A[i]
    d = sorted(d.items(), key=lambda x: x[1])
    print(*[l[0] for l in d])


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())
A = list(map(int,input().split()))
print(*(np.argsort(A)+1))

Submission status: Accepted

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

ll = [(l[i],i) for i in range(N)]

ll.sort()

lll = [str(ll[i][1]+1) for i in range(N)]

print(" ".join(lll))

Submission status: Accepted

Solution code:
N=int(input())
A=[int(i) for i in input().split(" ")]
cl=[(i,A[i]) for i in range(N)]
cl.sort(key=lambda a:a[1])
print(
    str([cl[i][0]+1 for i in range(N)]).strip("[]").replace(",","")
)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
import collections
import itertools
import bisect
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
num_dict = {}
for i, a in enumerate(A):
    num_dict[i] = a
dic2 = sorted(num_dict.items(), key=lambda x: x[1])
for id_, num_people in dic2:
    id_ += 1
    print(id_, end=' ')

Submission status: Accepted

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

print(*result)

Submission status: Accepted

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

for c in ans:
    print("{} ".format(c), end="")

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

Submission status: Accepted

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

Submission status: Accepted

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

A_number = [int(x) for x in range(1,N+1)]

dic_A = dict(zip(A_list,A_number))
dic_A_sort = sorted(dic_A.items())

for i in range(N):
    print(dic_A_sort[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
print(*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] = str(i+1)

print(" ".join(ans))

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(k) for k in input().split()]
#template
N = int(input())
A = inputlist()
dic = {}
li = [int(i) for i in range(1,N+1)]
for i in range(N):
    dic[A[i]] = i+1
lia = []
for i in range(1,N+1):
    lia.append(dic[i])
print(*lia)

Submission status: Accepted

Solution code:
n = int(input())
nums = list(map(int, input().split()))
pairlist = []
for i in range(len(nums)):
    pairlist.append([i, nums[i]])

sortedPairList = sorted(pairlist, key=lambda item: item[1])

result = []
for i in sortedPairList:
    result.append(str(i[0]+1))
print(" ".join(result))

Submission status: Accepted

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

Submission status: Accepted

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

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()))
ls = [-1] * n
c = 0
for i in a:
    ls[i - 1] = c + 1
    c+=1
ls = [str(i) for i in ls]
l = " ".join(ls)
print(l)

Submission status: Accepted

Solution code:
n=int(input())
a = [int(_) for _ 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:
import numpy as np
N = int(input())
A = list(map(int,input().split()))

result = np.argsort(A) + 1
print(' '.join(map(str, result)))

Submission status: Accepted

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

ans = [0] * N

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

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

Submission status: Accepted

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

dic={}
for i,a in enumerate(A):
  dic[a]=str(i+1)

for k,v in sorted(dic.items()) :
  print(v)

Submission status: Accepted

Solution code:
n = int(input())
a_l = list(map(int,input().split()))
b_l = []
for i, num in enumerate(a_l):
    b_l.append((num,i+1))
b_l.sort()
ans = ''
for num, i in b_l:
    ans += str(i)+' '
print(ans[:-1])

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
L = [[] for i 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()))
ans = [0]*n
for i, Ai in enumerate(a):
  ans[Ai-1] = i + 1
print(*ans)

Submission status: Accepted

Solution code:
n,*a=map(int,open(0).read().split())
a=sorted([(a_i,i) for i,a_i in enumerate(a)])
a=[a[i][1]+1 for i in range(n)]
print(*a)

Submission status: Accepted

Solution code:
n = int(input())
ls = list(map(int,input().split()))
ls2 = [0 for i in range(n)]
for j in range(n):
    a = ls[j]
#aは出席番号j+1番目の順位
    ls2[a - 1] = j + 1
for k in range(n):
    print(ls2[k], end = " ")

Submission status: Accepted

Solution code:
N = int(input())
arr = list(map(int, input().split()))
renban = list(range(1,N+1))

dp = [[0] * 2 for _ in range(N)]

for i in range(N):
    dp[i][0] = i+1
    dp[i][1] = arr[i]

dp.sort(key=lambda x:x[1])
arr2 = []
for i in range(N):
    arr2.append(dp[i][0])

print(*arr2)

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

dic = {keys[i]: i + 1 for i in range(N)} 
l = sorted(dic.items())

for val in l:
    print(val[1], end=" ")

Submission status: Accepted

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

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

print(*ans)

Submission status: Accepted

Solution code:
N = int(input())
lis = list(map(int,input().split()))
dic = {}
for i,popu in zip(range(1,N+1),lis):
    dic[popu] = i
for j in range(1,N+1):
    print(dic[j],end = " ")

Submission status: Accepted

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

for i in range(n):
    ANS.append([A[i],i+1])
    
ANS = sorted(ANS)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
#i+1からL[i]で出席番号から着いた順の写像(i=0,1,2...)
L=list(map(int, input().split()))
#j+1からA[j]で着いた順から出席番号への写像をリスト化(j=0,1,2...)
A=[0]*n
for i in range(n):
	A[L[i]-1]=i+1

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

Submission status: Accepted

Solution code:
#入力 人数N 入った順番A[i]
N = int(input())
A = list(map(int, input().split()))
#[入った順番 出席番号]のリストを作製
B = [[] for i in range(N)]
for i in range(N):
    B[i] = [A[i], i+1]
#入った順番(=最初の要素)早い順に並べる
B.sort()
#出席番号だけのリストを作製
ans = [0 for i in range(N)]
for i in range(N):
    ans[i] = B[i][1]
#リストの要素をスベース付きで全て表示
print(*ans)

Submission status: Accepted

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

values = [None] * N
for i in range(N):
    values[i] = i + 1

dic = {key : val for key, val in zip(keys, values)} 
for i in dic.values():
    print(i, end=" ")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
as_=list(map(int,input().split()))
l=as_.copy()
for i,a in enumerate(as_):
    l[a-1]=i+1
for v in l:
    print(v, end=' ')
print('')

Submission status: Accepted

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

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

Submission status: Accepted

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

d = [ x for x in enumerate(l)]
d.sort(key=lambda d: d[1])

print(*[i+1 for i,j in d])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
L = {}
for i in range(len(a)):
    L[i] = a[i]
sort_L = sorted(L.items(), key=lambda x: x[1])
[print(j[0]+1, end=' ')for j in sort_L]

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
ai = [(a_, i) for i, a_ in enumerate(a)]
ai.sort()

ans = ' '.join([str(i+1) for a, i in ai])
print(ans)

Submission status: Accepted

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

answer = [None] * N
for i, num in  enumerate(L):
    answer[num-1] = i+1
print(*answer)

Submission status: Accepted

Solution code:
def resolve():
    n=int(input())
    l1=list(map(int, input().split()))
    l2=[]
    for i in range(1,n+1):
        l2.append([l1[i-1],i])
    l2.sort()
    for i in l2:
        print(i[1],end=' ')
resolve()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
num = {}
for i in range(N):
  num[i+1] = A[i]
num_sorted = sorted(num.items(), key = lambda x : x[1])
for i in range(N):
  print(num_sorted[i][0], end = " ")

Submission status: Accepted

Solution code:
from collections import deque

N = int(input())
A = list(map(int, input().split()))
A = list(enumerate(A))
A.sort(key = lambda x: x[1])

ans = deque()

for a in A:
    ans.append(a[0] + 1)

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

Submission status: Accepted

Solution code:
n = int(input())
student = list(map(int,input().split()))
a = [0]*n
 
for i in range(n):
  s = student[i] #生徒が出席した番号をメモ
  a[s-1] = i+1
  
print(*a)

Submission status: Accepted

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

ans = [i + 1for i, v
       in sorted(enumerate(A), key=lambda x: x[1])]
print(*ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
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 = [0]*N
for i in range(N):
  B[A[i]-1] = i + 1
print(*B)

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

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

N=II()
A=LI()
L=[_ for _ in range(N)]
i = 1
for a in A:
    L[a-1] = i
    i += 1
p2S(L)

Submission status: Accepted

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

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