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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:


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

print(ans)

Submission status: Wrong Answer

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

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

M = map(str, L)
print(' '.join(M))

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

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

for x in an:
  zyunban.insert(x-1,t)
  t += 1
  

zyunban = list(map(str,zyunban))

print(" ".join(zyunban))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(len(a)):
    ans[a[i]]=i

print(*ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = [0]*N
for i,a in enumerate(A):
  l[i]=a
  
for x in l:
  print(x, end=' ')

Submission status: Wrong Answer

Solution code:
import random

n=int(input())
a=input().split()
print(random.sample(a,len(a)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = [int(0) for i in range(n)]

for j in range(n): ##01234
  ans[toko[j]-1] = j + 1
  
print(ans)

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+1
print(B)

Submission status: Wrong Answer

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

a=sorted(a)
for ia in a:
  print(c.index(ia)+1, end='')

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import numba
from numba import jit

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

@jit
def main(n, a):
  ans = [None]*n
  for i, j in enumerate(a):
    ans[j-1] = i+1
  for i in a:
    print(i, end=' ')
  
  
  
n, *a = map(int,read().split())
main(n, a)

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import numba
from numba import jit

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

@jit
def main(n, a):
  ans = [None]*n
  for i, j in enumerate(a):
    ans[j-1] = i+1
  for i in a:
    print(i, end=' ')
  
  
  
n, *a = map(int,read().split())
print(main(n, a))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import numba
from numba import jit

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

@jit
def main(n, a):
  ans = [None]*n
  for i, j in enumerate(a):
    ans[j-1] = i+1
  return ans
  
  
  
n, *a = map(int,read().split())
print(main(n, a))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import numba
from numba import jit

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

@jit
def main(n, a):
  for i in a:
    print(a[i-1], end=' ')
  
  
  
n, *a = map(int,read().split())
main(n, a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
A = list(map(int, input().split()))
B=A
B.sort()
C=[]
for i in range(0,N):
    for j in range(0,N):
        if A[j]==B[i]:
            C.append(i+1)

print(C)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(i)for i in input().split()]
res=[str(a[i]) for i in range(n)]
print(" ".join(res))

Submission status: Wrong Answer

Solution code:
n = int(input()) 
a_list = list(map(int, input().split()))
res = sorted(range(n), key=lambda k: a_list[k])
print(list(map(lambda x: x+1, res)))

Submission status: Wrong Answer

Solution code:
n = int(input()) 
a_list = list(map(int, input().split()))
print(sorted(range(len(a_list)), key=lambda k: a_list[k]))

Submission status: Wrong Answer

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

dictA = {}

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

dictAns = {v:k for k,v in dictA.items()}
ans = []
for i in range(N):
    ans += str(dictAns[i]+1)

print(' '.join(ans))

Submission status: Wrong Answer

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

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

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

print(*ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n=int(input())
A=[(e,i) for i,e in enumerate(list(map(int,input().split())))]
#print(A)
A.sort(key=lambda tup: tup[0])
#print(A)
for e,i in A:
    print(e, i+1)

Submission status: Wrong Answer

Solution code:
import sys, math, itertools, collections, bisect 
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8') 
inf = float('inf') ;mod = 10**9+7 
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n=int(input())
A=[(e,i) for i,e in enumerate(list(map(int,input().split())))]
print(A)
A.sort(key=lambda tup: tup[0])
print(A)
for e,i in A:
    print(e, i+1)

Submission status: Wrong Answer

Solution code:
N=int(input())
C=list(map(int,input().split()))
ans=[0]*(N-1)
for i in range(1,N+1):
  ans.insert(C[i-1],str(i))
for _ in range(N-1):
  ans.remove(0)
ans=' '.join([str(n) for n in ans])
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
C=list(map(int,input().split()))
ans=[0]*N
for i in range(1,N+1):
  ans.insert(C[i-1],str(i))
for _ in range(N):
  ans.remove(0)
ans=' '.join([str(n) for n in ans])
print(ans)

Submission status: Wrong Answer

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

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+1
print(B)

Submission status: Wrong Answer

Solution code:

def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    print(dp) 


if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
    solve()

Submission status: Wrong Answer

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

ans = [0] * len(A)

for i in A:
    ans[i - 1] = A.index(i) + 1

print(ans)

Submission status: Wrong Answer

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

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

result = ''
for i in result_list:
    result += str(i)
    
print(' '.join(result))

Submission status: Wrong Answer

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

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

print(alist)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
N=int(input())
A=list(map(int,input().split()))
ans = 1
X = []
for i in range(N):
  for j in range(i):
    if A[i] == ans:
      ans += 1
      X.append(i+1)
print(''.join(map(str,X)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=[0]*(N+1)
for i in range(1,N+1):
    ans[A[i]] = i
print(*ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
s=list(range(n))
s.sort(key=lambda i: l[i])
newl=""
for i in range(n):
    newl+=str(s[i]+1) + ""
print(*newl)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
s=list(range(n))
s.sort(key=lambda i: l[i])
newl=""
for i in range(n):
    newl+=str(s[i]+1)+""
print(*newl)

Submission status: Wrong Answer

Solution code:
import sys
n= int(input())
an = list(map(int, sys.stdin.readline().split()))
ans = [0]*n
for i in range(n):
    ans[an[i]-1] = 'i+1'

print(' '.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque

A = deque(range(1,10**5))
N = len(A)

ans=[]

A_dict={}

for n in range(N):
    a = A.popleft()
    A_dict[a]=n+1
    
for n in range(N):
    ans.append(A_dict[n+1])

print(*ans, sep=' ')

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(x) for x in input().split()]
ans=[None]*N
for i,a in enumerate(A):
    ans[a-1]=i
print(*ans)

Submission status: Wrong Answer

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

d = {}

for i in range(n):
    d[a_lst[i]] = i+1

d_sort = sorted(d.items(), key=lambda x : x[0])

ans_lst = []
for item in d_sort:
    ans_lst.append(item[1])

print(ans_lst)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(0,N):
	l.append(A[i]-1)
	
print(' '.join(map(str, l)))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
input()
print(np.array(input().split(), dtype=np.int32).argsort() + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    re = []

    for i in range(N):
        re.insert(A[i] - 1, i + 1)

    print(*re)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

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:
import os, sys, re, math

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

sa = ''
for s in sorted(A):
    sa += '1 '
print(sa.strip())

Submission status: Wrong Answer

Solution code:
n=int(input())
lis=list(map(int,input().split()))
num=[str(i) for i in range(1,n+1)]
ans=""
for i in range(1,n+1):
        ans=ans+num[lis.index(i)]
a=[j for j in ans]
for l in range(len(a)-1):
    print(a[l],end=" ")
print(a[-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
lis=list(map(int,input().split()))
num=[str(i) for i in range(1,n+1)]
ans=""
for i in range(1,n+1):
    for j in lis:
        if j==i:
            ans=ans+num[lis.index(i)]

a=[j for j in ans]

for l in range(len(a)-1):
    print(a[l],end=" ")
print(a[-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(raw_input())
elems = [(e,i) for i,e in enumerate(map(int, raw_input().split(' ')))]
elems.sort()
for a,b in elems:
	print b,

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Ans = []
for j in range(N):
  ans = A_re[j][1]
  Ans.append(ans)
  
print(Ans)

Submission status: Wrong Answer

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]
print(l)
l.sort()
print(l)
ans = [0 for i in range(n)]

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

print(*ans)

Submission status: Wrong Answer

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

A = np.array(A)

x = np.argsort(A) + 1

print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
d = {str(i+1):a[i] for i in range(n)}
d = dict(sorted(d.items(),key=lambda x:x[1]))
ans = list(d.keys())
print(" ".join(ans))

Submission status: Wrong Answer

Solution code:
# ABC142C

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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]
print(q)

Submission status: Wrong Answer

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]

print(q)

Submission status: Wrong Answer

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(a[i],end=" ")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

ans = []
for i in range(n):
  tmpidx = np.argmin(A)
  A[tmpidx] = 10 ** 9
  ans.append(tmpidx+1)

print(ans)

Submission status: Wrong Answer

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

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]) for i in range(N)]

print(" ".join(lll))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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()
print(a)
for k in range(n):
    print(a[k][1],end=' ')

Submission status: Wrong Answer

Solution code:
n = int(input())
ls = list(map(str,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: Wrong Answer

Solution code:
n = int(input())
ls = list(map(str,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][int(len(a[k]))-1],end=' ')

Submission status: Wrong Answer

Solution code:
n = int(input())
ls = list(map(str,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: Wrong Answer

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])
print(sortedPairList)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

a = sorted(A)

result = list()

for i in range(N):
   result.append(A.index(a[i]) + 1)
  
print(result)

Submission status: Wrong Answer

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

a = sorted(A)
print(a)
result = list()

for i in range(N):
   result.append(A.index(a[i]) + 1)
  
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

countl = [0] * n
# print(countl)
#考え方：countlのi-1番目にiという数字のindexナンバーを入れる
#一度0のリストを作っておけばいいか
for i in range(n):
    indi = a.index(i+1)
    countl[i] = indi +1
print(countl)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = []
counter = 1
while counter <= n:
    for see in a:
        if see == counter:
            a_ind = a.index(see)
            ans.append(a_ind + 1)
            a.pop(a_ind)
            counter += 1
            break
[print(x, end=' ')for x in ans]

Submission status: Wrong Answer

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

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

ansdic=sorted(B.items(), key=lambda x:x[0])
l=[]
for i in ansdic:
    l.append(i[1])

print(l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res=[0] * n

for i in range(n):
    res[b[i]-1] = i+1

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

Submission status: Wrong Answer

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

res=[0] * n

for i in range(n):
    res[b[i]-1] = i+1

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = [None for _ in range(N)]
sB = [None for _ in range(N)]
for i in range(N):
  for j in range(1,N+1):
    if A[i] == j:
      B[i] = j
    sB[i] = str(B[i])
ans = ' '.join(str(a) for a in sB)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
ans = sorted(range(1, N+1), key=lambda x: -A[x-1])


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

Submission status: Wrong Answer

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

for i in range(N):
    Answer.append(0)

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

print(Answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i, name in enumerate(a):
  a_sort[name-1] = i + 1
print(a_sort)

Submission status: Wrong Answer

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

ans = [-1] * N

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
_ = input()
hoge = np.array(list(map(int, input().split())))

res = ''
for i in np.argsort(hoge):
  res += str(i) + ' '
print(res[:-1])

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    A = sorted([[t, i + 1] for i, t in enumerate(input().split())])
    print(' '.join(map(str, [row[1] for row in A])))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = input().split(' ')
d = {}
for i in range(len(l)):
  d[i+1] = l[i]
result = []
d2 = sorted(d.items(),key=lambda x:x[1])
for item in d2:
  result.append(str(item[0]))

print(' '.join(result))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
nA = []
for i in range(N):
    nA.append([str(A[i]), str(i + 1)])
nA.sort(key=lambda x: x[0])
ans = list(map(list, zip(*nA)))[1]
print(' '.join(ans))

Submission status: Wrong Answer

Solution code:
# sys.stdin.readline()
import itertools
import numpy as np
import sys
n = int(input())
A= np.array(list(map(int,input().split())))
B = A.argsort()+1


print(B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(*ans, sep=" ")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
num = {}
ans = []
for i in range(1,len(A)+1):
    num[A[i-1]]=i
    print(num)
num = sorted(num.items())
print(num)
for k,v in num:
    ans.append(str(v))
print(' '.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
num = {}
ans = []
for i in range(1,len(A)+1):
    num[i]=A[i-1]
for k,v in sorted(num.items()):
    ans.append(str(v))
print(' '.join(ans))

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    a = list(map(int, input().split()))
    ans = dict(sorted({i:ai for i, ai in enumerate(a, 1)}.items(), key=lambda x: x[1]))
    print(*ans.keys())

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

Submission status: Wrong Answer

Solution code:
import numpy as np
N = int(input())
A = [int(x) for x in input().split()]
B = [0 for _ in range(N)]
for i in range(N):
    B[A[i]-1] = i+1
print(B)

Submission status: Wrong Answer

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

cnt = [0] * n
for i in range(n):
    x = a[i]
    cnt[x-1] = i+1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
out = []
for i in range(n):
    out.append(a.index(n-i))
print(reversed(out))

Submission status: Wrong Answer

Solution code:
import numpy as np
def plus(n):
    return n+1

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

A = np.array(A)
A = A.argsort()
ans = [ n+1 for n in A]
for i in ans:
    print(i,end="")

Submission status: Wrong Answer

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

dic_a = {i+1:0 for i in range(N)}
for i in range(1, N+1):
    dic_a[i] = A[i-1]

s_dic_a = sorted(dic_a.items(), key=lambda x:x[1])
ans = dict(s_dic_a)

for key in ans.keys():
    print(key, end=" ")

Submission status: Wrong Answer

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

l = list(range(1, n+1))
a = []
for i in range(1, n+1):
  for j in range(n):
    if i == h[j]:
      a.append(l[j])
      break
    
print(a)

Submission status: Wrong Answer

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

l = []
for a in A:
	l.append((a, A.index(a)+1))

l.sort()
print(l)
for t in l:
	print(t[1], end=" ")

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
li = ["" for i in range(N)]
for i in range(N):
    li[A[i]-1] = str(i)
print(" ".join(li))

Submission status: Wrong Answer

Solution code:
import numpy as np
from sys import stdin

def main():
  n = map(int,input().split())
  a = list(map(int, input().split()))
  print(a[0])
  b = np.argsort(a)+1
  str_ = ""
  for i in b:
    str_ = str_ + "{:d} ".format(i)  
  
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np
from sys import stdin

def main():
  n = map(int,input().split())
  a = list(map(int, input().split()))
  print(a[0])
  b = np.argsort(a)+1
  str_ = ""
  for i in b:
    str_ = str_ + "{:d} ".format(i)
  print(str_)
  
  
if __name__ == "__main__":
    main()

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

b = ' '.join(b)
print(b)