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:
if __name__ == '__main__':
    n = int(input())
    a = [int(i) for i in input().split()]
    ans = [0]*n
    for i in range(n):
        ans[i] = a[i]
    ans_str =""
    for i in ans:
        if ans_str =="":
            ans_str = str(i)
        else:
            ans_str = ans_str+" "+str(i)
    print(ans_str)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())
# スペース区切りの整数の入力
A = [int(a) for a in input().split()]

order = sorted(range(len(A)), key=lambda k: A[k])
sorted_order = [_a + 1 for i, _a in enumerate(order)]
print('{}'.format(sorted_order))

Submission status: Wrong Answer

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

data = {}
for i, num_student in enumerate(As):
    data[i+1] = num_student
result = list(dict(sorted(data.items(), key=lambda x: x[1])).keys())
print(' '.join(map(str, result)))

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    n = int(input())
    a = [int(i) for i in input().split()]
    ans = [0]*n
    print(ans)
    for i in range(n):
        ans[i] = a[i]
    ans_str =""
    for i in ans:
        if ans_str =="":
            ans_str = str(i)
        else:
            ans_str = ans_str+" "+str(i)
    print(ans_str)

Submission status: Wrong Answer

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

AA = dict(zip(A, range(1, len(A) + 1)))
print(AA)
AAA = sorted(AA.items())
for pair in AAA:
    print(pair[1], end=" ")
print()

Submission status: Wrong Answer

Solution code:
n = input()
a = list(map(int,input().split()))
b = []
for i, j in enumerate(a):
    b.append([i + 1,j])
print(b)
b.sort(key=lambda x:x[1])
print(b)
for i in b:
    print(i[0],end=" ")

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())
A = list(map(int, input().split()))
T = [0] * N
for i in range(N, 0, -1):
    t = np.argmax(A)
    T[t] = i
    A[t] = 0
print(T)

Submission status: Wrong Answer

Solution code:
n = input()
a_list = input().split()
ret = []

for i, a in enumerate(a_list):
  ret.append((a, i))

a_sorted = sorted(ret)
b = []
for _, i in a_sorted:
  b.append(str(i+1))
print(b)
print(" ".join(b))

Submission status: Wrong Answer

Solution code:
n=int(input())
A = list([int(x) for x in input().split()])
a=[]
i=0
while(len(a)!=n):
  if(A[i] == len(a)+1):
    a.append(i+1)
  i+=1
  if(i==len(A)):
    i=0
print(a)

Submission status: Wrong Answer

Solution code:
N = int(input())
H = input().split()
h = []
cnt = 0
for i in range(N):
  h.append(int(H[i]))
  
for i in range(N):
  for j in range(N-1, i, -1):
    if h[i] > h[j] :
      h[i], h[j] = h[j], h[i]
      
str1 = map(str, h)
str1 = " ".join(str1)
print(str1)

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
ans_lis = np.zeros(len(a))
for i in range(len(a)):
    ans_lis[i] = a.index(i + 1) + 1
print(np.array(ans_lis))

Submission status: Wrong Answer

Solution code:
import numpy as np

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

print(np.argsort(A)+1)

Submission status: Wrong Answer

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

toukou =[]
for i,a in enumerate(an):
    toukou.append([str(i+1),str(a)])
toukou.sort(key=lambda x:x[1])
number = []
for s in toukou:
    number.append(s[0])
print(' '.join(number))

Submission status: Wrong Answer

Solution code:
n=int(input())
lista = [int(i) for i in input().split()]
listb=[1]*n
for i in range(n):
    listb[lista[i]-1]=i+1
print(listb)

Submission status: Wrong Answer

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

list = [0]*N

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

Submission status: Wrong Answer

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

for i in range(1,len(h)+1):
  order.append(h.index(i)+1)
  
print(order)

Submission status: Wrong Answer

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

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

for i in range (n-1):
    for j in range(n-1, i ,-1):
        if h[j] < h[j-1]:
            tmp = h[j]
            h[j] = h[j-1]
            h[j-1] = tmp
            tmp = a[j]
            a[j] = a[j-1]
            a[j-1] = tmp
# print(h)
print(a)

Submission status: Wrong Answer

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

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

print(C)

Submission status: Wrong Answer

Solution code:
a = int(input())
array = list(map(int, input().split()))
 
array2 = [0] * a
 
for i in range(len(array)):
	array2[array[i]-1] = i + 1
    
for i in range(len(array2)):
	print("{}".format(i),  end = " ")

Submission status: Wrong Answer

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

out = [[] for _ in range(N)]

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

print(out)

Submission status: Wrong Answer

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

b=[]
for i in range(1,n+1):
  b.append(a.index(i)+1)
  
print(b)

Submission status: Wrong Answer

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

nums = []
nos = []
for no in range(N):
    num = A[no]  # 1, num = 3
    nums.append(num)
    nos.append(no)

Z = [x + 1 for _, x in sorted(zip(nums, nos))]

print(Z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())                                                                                         
A = [int(x) for x in input().split()]                                                                    
B = sorted(A)                                                                                            
                                                                                                         
for i in A:                                                                                              
    print(A[i-1],end=' ')                                                                                
print()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = []
for key in d.keys():
    t.append(d[key])
ans = []
for k in t:
    ans.append(str(d[k]))
print(' '.join(ans))

Submission status: Wrong Answer

Solution code:
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        #または、quit(),os.exit()をして止める。

#print(listA[0],listA[1])
N=listA[0]
i=1
order=[]
listA[1]
import numpy as np
np_=np.array(listA[1])
x=np.argsort(np_)
x1=list(map(lambda y:y+1,x))
print(x1)

Submission status: Wrong Answer

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

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

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

list = []
for i in range(N):
    list.append(all[i][1])

print(list)

Submission status: Wrong Answer

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

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 = [ int(i) for i in input().split()]
b = [""] * n

for ai, i in enumerate(a):
    b[ai] = str(i)

print(" ".join(b))

Submission status: Wrong Answer

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

num = [i+1 for i in range(N)]

for j in range(N-1):
  if A[j] < A[j+1]:
    TMP=A[j]
    A[j]=A[j+1]
    A[j+1]=TMP
    
    TMP2=num[j]
    num[j]=num[j+1]
    num[j+1]=TMP2
num.reverse()
print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(1,n+1):
    ans.append(a_l.index(i)+1)

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())
dict={}
ans=[]
A=input().split()
for num,i in enumerate(A):
    dict[i]=num
for j in sorted(dict):
    ans.append(str(dict[j]+1))
print(' '.join(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:
'''
Created on 2019/09/28

@author: oiwaiman
'''

N = int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())
H = input().split()
h = []
cnt = 0
for i in range(N):
  h.append(int(H[i]))
  
h.sort()
str1 = map(str, h)
str1 = " ".join(str1)
print(str1)

Submission status: Wrong Answer

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

for i in a:
    b[i-1] = str(i)

print(" ".join(b))

Submission status: Wrong Answer

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

array2 = [0] * a

for i in range(len(array)):
	array2[array[i]-1] = i + 1

print(array2, sep=' ')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)

# input = sys.stdin.readline


def main():
    n = int(input())

    stu = defaultdict(int)

    count = 1
    for o in input().split():
        stu[count] = o
        count += 1

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

    ans = []
    for s in stu:
        ans.append(s[0])

    print(*ans, sep=' ')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

numlist = [n+1 for n in range(N)]
atlist = [[x,y] for x, y in zip(A, numlist)]

sortlist = sorted(atlist)
print([x[1] for x in sortlist])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(list,input().split()))
for j in range(N):
  A[j].append(j+1)
A.sort(key = lambda x:x[0])
B = [A[k][1] for k in range(N)]
for s in B:
  print(s,end = ' ')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
N = int(input())
A_list = [int(i) for i in input().split()]

arg = np.argsort(A_list)
print(arg+1)

Submission status: Wrong Answer

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

import copy

ans_num = copy.deepcopy(nums)

for i in range(n):
    f_n = nums[i]
    print(f_n)
    ans_num[f_n -1] = i +1
    
map(str,ans_num)
print(' '.join(map(str,ans_num)))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

B = sorted(range(len(A)), key=lambda k: A[k])
resutl = ""
for i in B:
    resutl += str(i+1) + " "
print(resutl.rstrip())

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(list,input().split()))
for i in range(N):
  A[i][0] = int(A[i][0])
for j in range(N):
  A[j].append(j+1)
A.sort(key = lambda x:x[0])
B = [A[k][1] for k in range(N)]
for s in B:
  print(s,end = ' ')

Submission status: Wrong Answer

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

order = [0] * n

for ii in range(n):
    order[ii] = a.index(a_new[ii])+1

print(order)

Submission status: Wrong Answer

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

import numpy as np
' '.join(map(str, np.array(A).argsort() + 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def main():
  n = ni()
  a = list(na())
  res = []
  for i in a:
    res.append(a[i-1])
  print(*res)

main()

Submission status: Wrong Answer

Solution code:
n = int(input())
a_lst = list(map(int, input().split()))
ans = []
for i in range(1,n+1):
    ans.append(a_lst.index(i)+1)
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=list(range(1,int(input())+1))
a=list(map(int,input().split()))
na=[list(x) for x in zip(*sorted(zip(a, n)))]
print(na[1])

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[a.index(a[i])+1] = a[i]
print(dic)
dic_sorted = sorted(dic.items(), key=lambda x:x[1])
for i in range(N):
    print(dic_sorted[i][0],'',end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

#print(A.index(1))

a = []

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

Submission status: Wrong Answer

Solution code:
import numpy as np

n = int(input().strip())
a_list = np.array([e for e in input().strip().split()])

order = np.argsort(a_list) + 1
print(" ".join(map(str, order)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

s = [0]*n
for i,a_n in enumerate(a):
    s[a_n-1] = i+1

print(s)

Submission status: Wrong Answer

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

print(ans)

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

str = ' '.join(ans)
print(str, end='')

Submission status: Wrong Answer

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

ans = [0] * n

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

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    ans = list(map(lambda x: str(x[1]+1), sorted([(a, i) for i, a in enumerate(input().split(' '))])))
    print(' '.join(ans))





if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
A=[int(i) for i in input().split()]
C=[(A[i-1],i) for i in range(1,n+1)]

C.sort()
ans=""

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
Num = [int(i) for i in range(1,N+1)]

List = []
for i in range(len(A)):
    List.append([A[i],i+1])
print(List)

List.sort()
ans = []
for i in range(len(List)):
    ans.append(List[i][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):
    for l in range(n):
        if a[i]==l+1:
            b[i]=l+1
            break
print(*b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

zyunban_hito = [(a,i) for i,a in enumerate(a_list)]

zyunban_hito.sort()

result = [str(hito+1) for _,hito in zyunban_hito]

" ".join(result)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())

lista = [int(i) for i in input().split()]

res = []
for i,v in enumerate(lista):
    res.append((i,v))
    
print(res)


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

for i in res[:-1]:
    print(i[0]+1, end=' ')
    
print(res[-1][0]+1)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

B = np.argsort(A) + 1
print(str(B)[1:-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    N = II()
    A = LMIIS()
    for i in range(N):
        A[i] = [A[i],i]
    A.sort()
    print(A)
    for i in range(N):
        print(A[i][1]+1)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for n in range(N):
  print(A.index(n+1)+1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

import math

if N%2==0:
    for i in range(math.ceil(N/2)):
        B+=str(A.index(i+1)+1)+' '
        C+=str(A.index(N//2+i+1)+1)+' '
    print(B+C[0:-1])
else:
    for i in range(math.ceil(N/2)):
        B+=str(A.index(i+1)+1)+' '
        C+=str(A.index(N//2+i+1)+1)+' '
    print(B+C[2:-1])

Submission status: Time Limit Exceeded

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

C=''

for i in range(N):
    C+=str(A.index(i+1)+1)+' '
print(C[0:-1])

Submission status: Time Limit Exceeded

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

B=[0]*N
C=''

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    n = int(input())
    a = tuple(map(int,input().split()))
    ans = [a.index(i+1)+1 for i in range(n)]
    print(' '.join(map(str,ans)))
resolve()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(a) for a in input().split()]
ans = []
for i in range(N):
  ans.append(A.index(max(A)) + 1)
  A[A.index(max(A))] = 0
ans.reverse()
for i in range(N):
  print(ans[i], end = " ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:


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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

print(' '.join(list(str(A.index(i+1)+1) for i in range(n))))

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
n=int(input())
A=list(map(int,input().split()))
ans=deque()
for i in range(n):
  ans.append(1+A.index(i+1))
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans_str = str(a.index(1)+1)

for i in range(1,N):
    ans_str += " "+ str(a.index(i+1)+1)
print(ans_str)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
alist = list(map(int, input().split()))
blist = []
for i in range(1,N+1):
    blist.append(alist.index(i)+1)
print(' '.join(map(str, blist)))

Submission status: Time Limit Exceeded

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

for i in range(1,N+1):
  n  = A.index(i)
  a.append(n+1)

print(*a)

Submission status: Time Limit Exceeded

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

def order(i):
  n = A.index(i)
  return n


for i in range(1,N+1):
  n  = order(i)
  a.append(n+1)

print(*a)

Submission status: Time Limit Exceeded

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

ANS = [A.index(x) + 1 for x in range(1, N + 1)]

ANS = ' '.join(map(str, ANS))
print(ANS)

Submission status: Time Limit Exceeded

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

for i in range(n - 1):
    print(a.index(i + 1) + 1, end = ' ')
print(a.index(n) + 1)

Submission status: Time Limit Exceeded

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

for x in range(1,n+1):
  print(an.index(x)+1, end=" ")

Submission status: Time Limit Exceeded

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

ans = ''
for i in range(1, N+1):
  ans += str(A.index(i)+1)
  ans += ' '
  
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(1,n+1):
  ans=a.index(i)+1
  if(i!=n):
     print(ans,end=" ")
  else:
    print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(x.strip()) for x in input().split()]
ans = str('')
for y in range(n):
  idx = a.index(y+1) + 1
  ans += str(idx)+' '
print(ans.rstrip())

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = ""

for i in range(N):
    ans += str(A.index(i+1)+1) + " "

print(ans)

Submission status: Time Limit Exceeded

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

ans = []

for i in range(N):
    ans.append(str(A.index(i+1)+1))

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

s = []
for i in range(1,N+1):
  s.append(A.index(i)+1)
  
[print(x, end=' ') for x in s]

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    mylist.append(str(a.index(i)+1))
print(' '.join(mylist))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
l=len(A)
x=[]
for i in range(l):
    m=A.index(min(A))
    x.append(m+1)
    A[m]=10**5+1
x=[str(a) for a in x]
L=' '.join(x)
print(L)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

print(" ".join(list(map(str,Sort_List))))