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: Wrong Answer

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

print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = [0] * N
for k,v in enumerate(A):
    ans[v-1] = k+1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from operator import itemgetter

N = int(input())
A = list(map(int,input().split()))
B =[]
for i,c in enumerate(A):
    B.append([i+1,c])

B = sorted(B, key=itemgetter(1))
print(B)
ans =[]
for i in range(N):
    ans.append(B[i][0])

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    N=int(input())
    A=list(map(int,input().split()))
    S = {i+1: A[i] for i in range(N)}
    S2 = dict(sorted(S.items(), key=lambda x: x[1]))

    for k in S2:
        print(k,end=' ')




resolve()

Submission status: Wrong Answer

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    N=int(input())
    A=list(map(int,input().split()))
    S = {i+1: A[i] for i in range(N)}
    S2= dict(sorted(S.items(), key=lambda x:x[1]))

    for k in S2:
        print(k,end=' ')





resolve()

Submission status: Wrong Answer

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

p = [0]*n
t = 1
for i in a:
  p[i-1] = t
  t += 1
print(p)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
cnt=1
ans=[]
while cnt<=n:
	for i in a:
		if cnt==i:
			ans.append(a.index(i)+1)
			cnt+=1
print(ans)

Submission status: Wrong Answer

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

info.sort()
for s, o in info:
    print(o)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = {i + 1: a for i, a in enumerate(input().split())}
sort_A = sorted(A.items(), key=lambda x: x[1])

for i, a in sort_A:
    print(i, end=" ")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
out = []
count = 1
while count <= N:
    for x in range(len(A)):
        print("count:", count)
        print("A[x]:", A[x])
        if count == A[x]:
            print("match")
            count += 1
            out.append(str(x + 1))

print(" ".join(out))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input().split()
index = 1
dic = {}
list1 = []
for i in a:
  dic[i] = index
  index += 1
S = sorted(a)
for i in S:
  list1.append(dic[i])
print(*list1)

Submission status: Wrong Answer

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

print(str(a.argsort() + 1)[1:-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=list("")
for i in range(n):
    ans+='1'

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

ans=str(ans)
print(ans)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(input().split())
student=[]
ans=[]
for i in range(n):
    tmp=[]
    tmp.append(a[i])
    tmp.append(i+1)
    student.append(tmp)
student.sort(key=lambda x:x[0])
for i in range(n):
    ans.append(str(student[i][1]))
print(' '.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a_lst = list(map(int,input().split()))
a_str = ''
for i in range(n):
    a_str += str(a_lst[i])
seq_lst = [0]*n

for i, seq in enumerate(a_str):
    seq_lst[int(seq)-1] = i+1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=[None]*N
for i in range(N):
    ans[i]=A.index(i+1)+1
print(ans)

Submission status: Wrong Answer

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

for i in range(n):
	A2[i][0] = A[i]
print(A2)
A2 = sorted(A2,key = lambda x:x[0])

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

Submission status: Wrong Answer

Solution code:
def main():
  import sys
  a=int(input())
  b=tuple(range(1,a+1))
  c=tuple(sys.stdin.readline().split())
  d=[[i,j] for i,j in zip(b,c)]
  e=sorted(d,key=lambda x:x[1])
  f=" ".join([str(i[0]) for i in e])
  print(f)
if __name__=="__main__":
  main()

Submission status: Wrong Answer

Solution code:
def main():
  import sys
  numberOfStudent=int(input())
  orderOfArrive=tuple(map(int,sys.stdin.readline().split()))
  studentArrive=[None]*numberOfStudent
  count=1
  for arrive in orderOfArrive:
    studentArrive[arrive-1]=count
    count+=1
  print(" ".join(map(str,orderOfArrive)))
if __name__=="__main__":
  main()

Submission status: Wrong Answer

Solution code:
def main():
  import sys
  
  n=int(input())
  a=tuple(map(int,sys.stdin.readline().split()))
  b=[None]*n
  
  for index,number in enumerate(a,1):
    b[index-1]=number
  
  print(" ".join(map(str,b)))
  
if __name__=="__main__":
  main()

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = II()
	A = LI()
	order = [0]*N
	for i,a in enumerate(A):
		order[a-1] = i+1
	order = list(map(str,order))
	print("".join(order))

main()

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = II()
	A = LI()
	order = [0]*N
	for i,a in enumerate(A):
		order[a-1] = i+1
	A = list(map(str,A))
	print("".join(A))

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
import heapq
student = list(map(int,input().split()))
a = []
heapq.heapify(a)
for i in range(N):
    heapq.heappush(a,student.index(i+1) + 1)
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(a):
  b[c[i]-1]+=i+1
print(b)

Submission status: Wrong Answer

Solution code:
n=int(input())
A=list(map(int,input().split()))
tmp=[]
ans=[]
for r,s in enumerate(A):
    tmp.append([s,r])
tmp=sorted(tmp)
for t in tmp:
    ans.append(t[1]+1)
print(ans)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
def main():
    n = int(input())
    num_list = list(map(int, input().split()))
    
    ls = [0] * n

    for i in range(n):
        ls[num_list[i]-1] = i + 1

    print(ls)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans = [0] * n

for i in range(n):
    ans[i] = A.index(i+1) + 1
    A.remove(i+1)
print(' '.join(map(str, ans)))

Submission status: Wrong Answer

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

ans = [0] * n

for i in range(n):
    ans[i] = A.index(i+1) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(input().split())
#print(l)

x = []
for i in range(len(l)):
    j = str(l[i]) + str(i+1)
    x.append(j)
#print(x)
x.sort()
#print(x)
for k in x:
    print(k[1], end = ' ')

Submission status: Wrong Answer

Solution code:
n = int(input())
order = input().split()
a = sorted(order)
for i in a:
    print(order.index(i)+1, end=" ")

Submission status: Wrong Answer

Solution code:
n = int(input())
order = input().split()
a = sorted(order)
print(a)
for i in a:
    print(order.index(i)+1, end=" ")

Submission status: Wrong Answer

Solution code:
n = int(input())
order = input().split()
a = dict.fromkeys(range(1, n+1, 1))
for i in a:
    a[i] = order[i-1]
print(a)
for key, value in sorted(a.items(), key=lambda item: item[1]):
    print(key, end = '')
    if(value != str(n)):
        print(end = ' ')

Submission status: Wrong Answer

Solution code:
n = int(input())
order = input().split()
a = dict.fromkeys(range(1, n+1, 1))
for i in a:
    a[i] = order[i-1]
print(a)
for key, value in sorted(a.items(), key=lambda item: item[1]):
    print(key, end = ' ')

Submission status: Wrong Answer

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

'''
p,m=map(int,input().split())
s=bin(p)
s=s[2:]
n=len(s)


ans=pow(2,n) -1
if(m>=2):
    print(ans)
else:
    print(p)


m,n=map(int,input().split())
a=[False]*(n+1)
a[0]=True
for i in range(m):
    temp=list(map(int,input().split()))
    for kk in temp[1:]:
        a[kk]=True
ans=True
for nn in a:
    ans = nn and ans
if(ans):
    print("YES")
else:
    print("NO")



y,b,r = map(int,input().split())

if(r>b):
    if(b>y):
        print(int((3*y)+3))
    else:
        print(int(3*b))
else:
    if(b<y):
        print(int((3*y)-3))
    else:
        print()


  '''

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))


anser = []

for i in range(1,inputA[0]+1):
    for j in range(0,inputA[0]):
        if inputB[j] == i:
            anser.append(j+1)
         


print(anser)

Submission status: Wrong Answer

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

print(' '.join([str(idx) for idx, _ in sorted(nums, key=lambda x: x[1])]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = []
for i in range(len(lst)):
    num = lst.index(i+1)
    ans.append(num+1)
print(ans)

Submission status: Wrong Answer

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

ans = []
for i in range(len(lst)):
    num = lst.index(i+1)
    ans.append(num)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i=int(input())
s=input().split()
a=""
ls=[]
for k in range(i):
  ls.append([s[k],k+1])
ls.sort()
for k in range(i-1):
  a=a+str(ls[k][1])+" "
a=a+str(ls[i-1][1])
print(a)

Submission status: Wrong Answer

Solution code:
i=int(input())
s=input().split()
a=""
for k in range(i-1):
  a+=str(s.index(str(k+1))+1)+" "
a+=str(s.index(str(i)))
print(a)

Submission status: Wrong Answer

Solution code:
i=int(input())
s=input().split()
a=""
for k in range(i-1):
  a+=str(s.index(str(k+1)))+" "
a+=str(s.index(str(i)))
print(a)

Submission status: Wrong Answer

Solution code:
result = []
N = int(input())
A = list(map(int, input().split()))
for n in range(N):
    m = A.index(sorted(A)[n])
    result.append(m+1)
print(result)

Submission status: Wrong Answer

Solution code:
import sys

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: Wrong Answer

Solution code:
N = int(input())
li = list(map(int, input().split()))
ans = dict()
for i in range(len(li)):
    ans[li[i]] = i + 1
ali = []
for j in sorted(ans.keys()):
    ali.append(ans[j])
print(ali)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

output = list(range(0,N))

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

print(output)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for value in r.values():
	print(value)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

j=1
result=[]
while j<=N:
    for i in range(len(A)):
        if int(A[i])==j:
            result.append(i+1)
            j+=1

y=''
for x in result:
    y += str(x)

print(y)

Submission status: Wrong Answer

Solution code:
#C - Go to School
import numpy as np

N = int(input())
L = list(map(int, input().split()))
X = []
for i in range(len(L)):
    X.append(L.index(i+1)+1)
print(X)

Submission status: Wrong Answer

Solution code:
from operator import itemgetter
N=int(input())
A=list(map(int,input().split()))
ans=[[i+1,j] for i,j in (enumerate(A))]

print(*ans)

Submission status: Wrong Answer

Solution code:
#ABC142_C
N=int(input())
A=list(map(int,input().split()))
ans=[i+1 for i,_ in sorted(enumerate(A))]
print(*ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

j=1
result=[]
while j<=N:
    for i in range(len(A)):
        if int(A[i])==j:
            result.append(i+1)
            j+=1

print(result)

Submission status: Wrong Answer

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


No=[]
for i in range(N):
  a=A.index(i+1)+1
  No.extend(str(a))
print(' '.join(No))

Submission status: Wrong Answer

Solution code:
_ = input()
s = map(int,input().split())
ans = ""
di = {}
for ind,num in enumerate(s):
    di[num] = ind+1
for key,value in sorted(di.items(),key=lambda x:x[0]):
    ans += str(value)
print(ans)

Submission status: Wrong Answer

Solution code:
from numpy import*;_,a=open(0);print(*argsort(int8(a.split()))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
a1={}
for i in range(n):
  a1[i+1]=a[i]
a2=sorted(a1.items(),key=lambda x:x[1])
a2.sort()
a3=[i[1] for i in a2]
print(*a3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
ans=[]
for i in range(n):
  for k in range(n):
    if a[k]==i+1 :
      ans.append(a[k])
      break
  
print(*ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
ans=[]
for i in range(n):
  for k in range(n):
    if a[k]==i+1 :
      ans.append(a[k])
      break
  
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i) for i in input().split()]
a1=[]
for i in range(n):
  for k in range(n):
    if a[k]==i+1:
      a1.append(a[k])
print(a1)

Submission status: Wrong Answer

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


print(A)

Submission status: Wrong Answer

Solution code:
#coding: utf-8
import math
import heapq
import bisect

MOD = 10**9+7

N = int(input())

# 複数個の数値を、intの配列として取得
A = list(map(int, input().split()))

# (A[i],i)のタプルリストを作って、昇順ソート
L = []
for i in range(N):
    a = tuple([A[i],i+1])
    L.append(a)
L = sorted(L, key=lambda x:x[0])

ans = []
for i in range(N):
    ans.append(L[i][1])

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

stud_list = []

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
##C
n = int(input())
a = list(map(int,input().split()))
b = list()
for i in range(n):
    for j in range(n):
        if a[j] == i+1:
            b.append(j+1)
print(b)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(e) for e in input().split()]
for i in range(0,n):
    for j in range(0,n):
        if a[j] == i + 1:
            print(j + 1, end = " ")
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(e) for e in input().split()]
for i in range(0,n):
    for j in range(0,n):
        if a[j] == i:
            print(j, end = " ")

Submission status: Wrong Answer

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

ans = [ 0 for _ in range(n)]
for i, aa in enumerate(a):
    aa -= 1
    ans[aa] = i+1

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

print(np.argsort(A)+1)

Submission status: Wrong Answer

Solution code:
import numpy as np
N =int(input())
A = list(map(int,input().split()))
A_array =np.array(A)
A_sort =np.argsort(A_array)
print(*A_sort)

Submission status: Wrong Answer

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

for i in range(1, N+1):
    for s in range(N):
        if A[s] == i:
            B.append(s+1)
            break

print(B)

Submission status: Wrong Answer

Solution code:
N=int(input())
S=list(map(int, input().split()))
T=[]
for i, num in enumerate(S, 1):
  p = (num, i)
  T.append(p)
for i in range(N):
  print(T[i][0], end=' ')

Submission status: Wrong Answer

Solution code:
def calculate(n, arr):
    result = [0] * len(arr)

    for index, value in enumerate(arr):
        result[value - 1] = index + 1

    return result


N = int(input())
S = input().split(' ')
arr = list(map(int, list(S)))

result = calculate(N, arr)
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
temp = sorted(range(len(a)), key=lambda k: a[k])
for i in range(len(temp)):
  temp[i] = temp[i]+1

print(temp)

Submission status: Wrong Answer

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: Wrong Answer

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

ans = sorted(range(len(A)), key=A.__getitem__)
ans = [a+1 for a in ans]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = [int(i) for i in input().split()]
k = 1
y = []
max1 = max(x)
while(k!=max1):
	for i in range(len(x)):
		if(x[i] == k):
			y.append(i+1)
			k += 1
print(*y)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
let=input().split()

list=list(range(N))
for i in range(N):
    list[int(let[i])-1]=i+1
print(list)

Submission status: Wrong Answer

Solution code:
N = int(input())
let=input().split()

list=list(range(N))
for i in range(N):
    list[int(let[i])-1]=i+1
print(i for i in list)

Submission status: Wrong Answer

Solution code:
N = int(input())
let=input().split()

list=list(range(N))
for i in range(N):
    list[N-(N-int(let[i]))-1]=i+1
print(i for i in list)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [i for i in map(int, input().split())]
stu = [{'no' : i, 'arv':a[i]} for i in range(n)]
print(n, a, stu)

stu.sort(key=lambda x: x['arv'])
print(stu)

res = []
for i in stu:
    res.append(i['no'] + 1)

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
arr=list(map(int,input().split()))
arr.sort()
print(arr)

Submission status: Wrong Answer

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

for i in range(1, N + 1):
	position = students.index(i) + 1
	alst.append(position)
print(tuple(alst))

Submission status: Wrong Answer

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

for i in range(1, N + 1):
	position = students.index(i) + 1
	alst.append(position)
print(alst)

Submission status: Wrong Answer

Solution code:
def main():
    n  =int(input())
    students = list(map(int,input().split()))
    number = [i for i in range(n)]
    students_number = []
    for i in range(n):
        students_number.append([students[i]] + [number[i]])
    sorted_students_number = sorted(students_number,key = lambda x:x[0])
    ans = [i[1] for i in sorted_students_number]
    print(sorted_students_number)
    print(*ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    n  =int(input())
    students = list(map(int,input().split()))
    number = [i for i in range(n)]
    students_number = []
    for i in range(n):
        students_number.append([students[i]] + [number[i]])
    sorted_students_number = sorted(students_number,key = lambda x:x[1])
    ans = [i[0] for i in sorted_students_number]
    print(*ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
size = int(input())
personList = [int(x) for x in input().split()]
result = list(range(size))
for i, order in enumerate(personList):
  result[order - 1] = i
print(' '.join(map(str, result)))

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

m=[]
i=1

while i<=n:
  for j in range(n):
    if i==s[j]:
      m.append(j+1)
      i+=1

print(m)

Submission status: Wrong Answer

Solution code:
raw_input()
v = sorted((int(e), k) for k, e in enumerate(raw_input().split()))
_, w = zip(*v)
print ' '.join(map(str, w))

Submission status: Wrong Answer

Solution code:
v = sorted((int(e), k) for k, e in enumerate(raw_input().split()))
_, w = zip(*v)
print ' '.join(map(str, w))

Submission status: Wrong Answer

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

print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
import numpy as np
A = [int(a) for a in A]
s = ""
toukou = list(np.argsort(np.array(A)))
print(A)
print(toukou)
for i in range(N):
    num = toukou[i]+1
    s += " "+str(num)
print(s[1:])

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
import numpy as np
s = ""
for i in list(np.argsort(np.array(A))):
    s += " "+str(i+1)
print(s[1:])

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
import numpy as np
Toukou = [i+1 for i in list(np.argsort(np.array(A)))]
print(Toukou)

Submission status: Wrong Answer

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

dic = dict(zip(a , b))

print(dic)

for i in range(1,N+1):
    c.append(dic[i])

print(*c)

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())

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

ans = np.argsort(A_list) + np.ones(N)
print(ans.astype(np.int64))

Submission status: Wrong Answer

Solution code:
import numpy as np
N=int(input())
A=np.array(list(map(int, input().split())))
l=[]
for _ in range(N):
  l.append(A.argmin()+1)
  A[A.argmin()]=N+1
print(l)

Submission status: Wrong Answer

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

value_and_index = []
for i in list:
    value_and_index.append([i,list.index(i)+1])
value_and_index.sort()
print(value_and_index)
for i in value_and_index:
    print(i[1], end = " ")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
A = [int(s) for s in A]
students = []
A_sort = sorted(A)
for a_sort in A_sort:
    for i, a in enumerate(A):
        if a_sort == a:
            students.append(i+1)
            break
print(students)

Submission status: Wrong Answer

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

b = [0]*n

for i in range(n):
  b[a[i] - 1 ] = i
  
print(*b)