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: Time Limit Exceeded

Solution code:
n = int(input())
mem = list(i+1 for i in range(n))
record = list(map(int, input().split()))
order = []
# mini = min[record]
# while mini != 99999999999:
    # mini = min(record)
while True:
    mini = min(record)
    for i in range(len(record)):
        if record[i] == mini:
            order.append(mem[i])
            record[i] = 99999999999
            mini = min(record)
            break
    if mini == 99999999999:
        break
print(" ".join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
mem = list(i+1 for i in range(n))
record = list(map(int, input().split()))
order = []
mini = 0
while min(record) != 99999999999:
    mini = min(record)
    for i in range(len(record)):
        if record[i] == mini:
            order.append(mem[i])
            record[i] = 99999999999
            break
print(" ".join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
mem = list(i+1 for i in range(n))
record = list(map(int, input().split()))
order = []
while min(record) != 99999999999:
    for i in range(len(record)):
        if record[i] == min(record):
            order.append(mem[i])
            record[i] = 99999999999
            break
print(" ".join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline


def main():
    n = int(input())
    a = list(map(int, input().split()))
    result = []
    for i in range(1, n + 1):
        result.append(a.index(i) + 1)
    print(*result, sep=' ')


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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


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

    result = []
    for i in range(1, n + 1):
        result.append(a.index(i) + 1)
    print(*result, sep=' ')


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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


def main():
    n = int(input())
    a = list(map(int, input().split()))
    a_sorted = sorted(a)

    result = []
    for i in range(1, n + 1):
        result.append(a.index(i) + 1)
    print(*result, sep=' ')


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

print(*l)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

out_lst = [0] * n

k = 0
for j in range(1,n+1):
    idx = student_lst.index(j)
    out_lst[j-1] = str(idx + 1)

#str_lst = [str(p) for p in out_lst]
list = ' '.join(out_lst)
print(list)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

out_lst = [0] * n

k = 0
for j in range(1,n+1):
    idx = student_lst.index(j)
    out_lst[j-1] = idx + 1

str_lst = [str(p) for p in out_lst]
list = ' '.join(str_lst)
print(list)

Submission status: Time Limit Exceeded

Solution code:
#C
#入力
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 = list(map(int, input().split()))
b=[str(a.index(i+1) + 1) for i in range(n)]
print(' '.join(b))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
if __name__ == "__main__":
  total_num = input()
  num_list = list(map(int, input().split()))
  num_dict = {}
  for num in num_list:
  	num_dict.setdefault(num, num_list.index(num))
  num_sorted = sorted(num_dict.items(), key=lambda x:x[0])
  student = [item[1] + 1 for item in num_sorted]
  for people in student:
    print(people, end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8

n = int(input())
toko = input().split()

order = []
for i in range(n):
    for j in range(n):
        if str(i + 1) == toko[j]:
            order.append(str(j + 1))
            continue
        
print(' '.join(order))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().split(" ")
order = ""
for i in range(n):
  for j in range(n):
    if a[j] == str(i+1):
      order += str(j+1) + " " 
order.rstrip()
print(order)

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

order = []

for i in range(N):
    order.append(A.index(i+1)+1)
    
print(' '.join(map(str, order)))

Submission status: Time Limit Exceeded

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

order = []

for i in range(N):
    order.append(A.index(i+1)+1)
    
print(' '.join(map(str, order)))

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

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

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

#8 2 4 5 6 7 3 1

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
li = list(map(int, input().split()))
for i in range(1, N + 1):
  print(li.index(i) + 1, end = ' ')

Submission status: Time Limit Exceeded

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

count=1
for i in range(n):
  print((array.index(i+1))+1,end=" ")

Submission status: Time Limit Exceeded

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

count=1
num=[]
for i in range(n):
  for j in range(n):
    if array[j]==count:
      print(j+1, end=" ")
      count+=1

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

s=""
for i in range(N):
    for j in range(N):
        if A[j]==i+1:
            s+="{} ".format(j+1)
            break
print(s)

Submission status: Time Limit Exceeded

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

an = ''
for i in range(n):
  an = an + str(ans[i]) + ' '
 
print(an)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
#Ai=A[i-1]
s=""
for i in range(N):
    if i!=0:
        s+=" "
#教室にi+1人いたとき
    for j in range(N):
#出席番号i=j+1
        if i+1==A[j]:
            s+="{}".format(j+1)

print(s)

Submission status: Time Limit Exceeded

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

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)

print (str(ans).replace('[','').replace(',','').replace(']',''))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

# print('----------output----------')

for i, k in enumerate(A):
    print(A.index(i+1)+1, end=' ')

Submission status: Time Limit Exceeded

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

for h in range(1,N+1):
    for i in range(N):
        if A[i] == h:
            print(i + 1)

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())))
ans=[]
for i in range(N):
    a=(A.index(i+1))+1
    ans.append(a)
ANS=(map(str,ans))
kotae=" ".join(ANS)
print(kotae)

Submission status: Time Limit Exceeded

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

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=" ")
print()

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)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import os

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

for i in range(1,N+1):
    print(alist.index(i)+1),

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)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

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

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

for i in range(n):
    p=a.index(i+1)
    print(no[p],end="")
    print('', end=' ')
    a.pop(p)
    no.pop(p)

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="")
    print('', 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.append(a.index(i)+1)

print(*ans)

Submission status: Time Limit Exceeded

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

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

print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import heapq

n = int(input())
a = list(map(int, input().split()))
ans = []
ha = a[:]
heapq.heapify(ha)

for _ in range(n):
    minA = heapq.heappop(ha)
    ans.append(a.index(minA)+1)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
from copy import deepcopy

ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))

n = ii()
a = li()

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

print(*b)

Submission status: Time Limit Exceeded

Solution code:
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)
for k in range(N):
    print(str(B[k]) + ' ', end = '')

Submission status: Time Limit Exceeded

Solution code:
N = int(input().split()[0])
aa = input().split()
bb = []

for i in range(1, N+1):
    num = aa.index(str(i))
    bb.append(num + 1)

print(*bb)

Submission status: Time Limit Exceeded

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

order = []

for attendance in range(N):
    order.append(str(A.index(attendance + 1) + 1))

print(" ".join(order))

Submission status: Time Limit Exceeded

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

order = []

for attendance in range(N):
    A = [x - 1 for x in A]
    order.append(str(A.index(0) + 1))

print(" ".join(order))

Submission status: Time Limit Exceeded

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

order = []

for attendance in range(1, N + 1):
    for student in range(len(A)):
        studentNumber = student + 1
        numberOfStudents = A[student]

        if numberOfStudents == attendance:
            order.append(str(studentNumber))

print(" ".join(order))

Submission status: Time Limit Exceeded

Solution code:
N = int(input().split()[0])
aa = input().split()
bb = []

for i in range(1, N+1):
    for j in range(0, N):
        if int(aa[j]) == i:
            bb.append(j+1)
            break

print(*bb)

Submission status: Time Limit Exceeded

Solution code:
N = int(input().split()[0])
aa = input().split()
bb = []

for i in range(1, N+1):
    for j in range(0, N):
        if int(aa[j]) == i:
            bb.append(j+1)

print(*bb)

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())
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:
import sys
input = sys.stdin.readline

n = int(input())
order = list(map(int, input().split()))
result = []
for j in range(n):
  for k in range(n):
    if j+1 == order[k]:
      result.append(k+1)
print(*result)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
order = list(map(int, input().split()))
while (min(order) != 999999):
  minVal = min(order)
  minIndex = order.index(minVal)
  print(minIndex+1, end = ' ')
  order[minIndex] = 999999

Submission status: Time Limit Exceeded

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)+1
maped_b=map(str,b)
ans=' '.join(maped_b)
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

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

ans = ''
for k,v in arr2:
	if v == 1:
		ans = str(k)
	else:
		ans = ans + ' ' + str(k)

print(ans)

Submission status: Time Limit Exceeded

Solution code:
_n = int(input())
_records = list(map(int, input().split()))
_order = []
_rank = 1
while len(_order) < _n:
  for _i in range(_n):
    if _records[_i] == _rank:
      _order.append(_i + 1)
      _rank = _rank + 1
      
print(" ".join(map(str, _order)))

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)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import collections
n = int(input())
a_list = list(map(int, input().split()))
come_list = [0] * (n+1)
come_num = 1
for a in a_list:
  come_list[a] = come_num
  come_num += 1

ret_str = ""
for index in range(1, len(a_list)+1):
  ret_str += str(come_list[index])
  ret_str += " "
print(ret_str)

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())
a=list(map(int,input().split()))
for i in range(1,n+1):
  for m in a:
    if i==m:
      print(a.index(m)+1,end=" ")

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)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[]
for i in range(n):
    ans+=[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+=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+=str(a.index(i+1)+1)+' '
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = input()
arr = map(int, raw_input().split())
new = [0 for i in range(n)]

for i in range(n):
    new[i] = arr.index(i+1)+1

for k in new:
    print k,

Submission status: Time Limit Exceeded

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

print(*[A.index(i)+1 for i in range(1, N+1)])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = tuple(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())
h = tuple(map(int, input().split()))
for i in range(1, n+1):
  print(h.index(i)+1, end =  " ")

Submission status: Time Limit Exceeded

Solution code:
num = int(input())
each_num = list(map(int, input().split(" ")))

ans = []

i = 1
for k in range(1, num+1):
    ans.append(each_num.index(k) + 1)
for i in range(num):
    print(ans[i], end = " ")

Submission status: Time Limit Exceeded

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


c=0

for i in range(n):
    d=min(student)+c
    z=student.index(d)
    c += 1
    
    print(z+1,end=" ")

Submission status: Time Limit Exceeded

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


a=[]
c=0

for i in range(n):
    d=min(student)+c
    z=student.index(d)
    a.append(z+1)
    c += 1
    
    print(a[i],end=" ")

Submission status: Time Limit Exceeded

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


a=[]
c=0

for i in range(len(student)):
    d=min(student)+c
    z=student.index(d)
    a.append(z+1)
    
    c += 1


for j in a:
    print(j,end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int, input().split()))
for i in range(N):
    print(str(A.index(i+1)+1), end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

member = list(map(int, input().split()))
ans = []

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

member = list(map(int, input().split()))
ans = []

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

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

Submission status: Time Limit Exceeded

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



while i<=n:
    print(a.index(i)+1, end=" ")
    i+=1

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
#A=int(input().split())
#print(A)
B=[ 0 for _ in range(N)]
#print(B)
ans=""
for i in range(N):
  B[A[i]-1]=i+1
#  ans+=str(A.index(i+1)+1)
#  if i!=N-1:

for i in range(N):
  ans+=str(B[i])
  if i!=N-1:
    ans+=" "
#print(B)
print(ans)

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)

Submission status: Time Limit Exceeded

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

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

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)

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

Submission status: Time Limit Exceeded

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

# パターン1
# A = list(enumerate(A))
# A.sort(key = lambda x: x[1])
# for i in range(N):
#     print(A[i][0] + 1, end = " ")

#パターン2
# A = sorted(range(N), key = lambda i: A[i])
# for i in range(N):
#     print(A[i]+1, end = " ")

# パターン3
min_A = sorted(A)
for i in range(N):
    print(A.index(min_A[i]) + 1, end = " ")

Submission status: Time Limit Exceeded

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

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

print(*answer)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:

b = []
b = input().split()
cnt = 1
i = 0
c = []

while cnt <= len(b):
    if int(b[i]) == cnt:
        c.append(i + 1)
        cnt += 1
    elif i == len(b) - 1:
        i = 0
    else:
        i += 1
for j in range(len(c)):
  if j == len(c) - 1:
    print(int(c[j]))
  else:
    print(int(c[j]), end=' ')

Submission status: Time Limit Exceeded

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


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

i = 1
for a_s in a:
    print(a.index(i)+1)
    i += 1

Submission status: Time Limit Exceeded

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


main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n = INT()
a = MAP()
res=[]

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n = INT()
a = MAP()
res=[]

for i in range(1,n+1):
    res.append(a.index(i)+1)
print(*res)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

B = [int(0) for n in range(N)]

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


#print('N', N)
#print('A', A)
#print('B', B)

B = [str(n) for n in B]

result = ' '.join(B)

print(result)

Submission status: Time Limit Exceeded

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

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



print(' '.join(List))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

B = [int(0) for n in range(N)]

for i in range(N) :
  for j in range(N) :
    if i+1 == A[j] :
      B[i] = j+1
      break
  

#print('N', N)
#print('A', A)
#print('B', B)

B = [str(n) for n in B]

result = ' '.join(B)

print(result)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = [int(i) for i in input().split()]
b = sorted(a)

l = [str(a.index(i)+1) for i in b]

l=" ".join(l)
print(l)

Submission status: Time Limit Exceeded

Solution code:
n,a=open(0);print(*sorted(range(1,int(n)+1),key=lambda x:int(a.split()[x-1])))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = list(map(int,input().split()))
s = []
for i in range(n):
    s.append([l[i],l.index(l[i])+1])
for k,v in dict(s).items():
    print(v,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.append(a.index(i)+1)
print (*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
 
l = ''
for i in range(n):
  l += '{} '.format(a.index(i+1)+1)
print(l)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
import sys
n = int(sys.stdin.readline())
alist = [int(x) for x in sys.stdin.readline().split()]
attends = [alist.index(y) + 1 for y in sorted(alist)]
print(*attends)