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:
# ABC 142 C go to school
n = int(input())
s = list(map(int,input().split()))

# ソートされたリストのインデックスを返す
for i in range(len(s)):
    print(sorted(range(len(s)), key=lambda k:s[k])[i] + 1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
# ABC 142 C go to school
n = int(input())
a_list = list(map(int,input().split()))
print_list = []
for i in range(1,n+1):
    print(a_list.index(i)+1, end = " ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
l = list(map(int, input().split()))
l2 = l.copy()
ans = []
l.sort()

for i in l:
    ans.append(l2.index(i)+1)

print(*ans)

Submission status: Time Limit Exceeded

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

for i in range(N):
    ans.append(l.index(min(l))+1)
    l[l.index(min(l))] = max(l) + 1

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import sys
import numpy as np
if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline

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

ans = []
for i in range(N):
	a = np.argmin(A)
	ans.append(str(a+1))
	A[a] = float('INF')

print(' '.join(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))
    
for s in ans:
    print(s+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.append(a.index(i)+1)
    
for s in ans:
    print(s, end =" ")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(*ans)

Submission status: Time Limit Exceeded

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

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

print(' '.join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import bisect
n=int(input())
l=list(map(int,input().split()))
s=''
for i in range(1,n+1):
    s+=str(l.index(i)+1)+' '
print(s)

Submission status: Time Limit Exceeded

Solution code:
import bisect
n=int(input())
l=list(map(int,input().split()))
l_2=[]
for i in range(1,n+1):
    l_2.append(l.index(i)+1)
s=''
for j in range(n):
    s+=str(l_2[j])+' '
print(s)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def abc142_c():    
    n = int(input())
    a = list(map(int,input().split()))
    i = 0
    dict = {}

    for num in a:
        i += 1
        dict[i] = num

    sorted_arrive_list = sorted(dict.items(), key=lambda x :x[1])
    ans = ''
    for l in sorted_arrive_list:
        ans = ans + str(l[0]) + ' '
    print(ans)

if __name__ ==  '__main__':
    abc142_c()

Submission status: Time Limit Exceeded

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

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=[]

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

d = dict(zip(a, b))

d_sorted = sorted(d.items(), key=lambda x:x[0])
ans = ""
for i in range(n):
    ans += str(d_sorted[i][1]) + " "

print(ans)

Submission status: Time Limit Exceeded

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

for i in range(N):
  print(a.index(i)+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):
    num = A.index(i) + 1
    ans.append(num)
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
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)

Submission status: Time Limit Exceeded

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

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 = ans + str(a.index(i)+1) + " "

print(ans.rstrip())

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(str(a.index(i)+1))
	
print(' '.join(ans))

Submission status: Time Limit Exceeded

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

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

print(' '.join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
ans = ""
a = list(map(int,input().split()))
for i in range(n):
    b = a.index(i+1)
    ans += str(b+1)
    if i != n-1:
        ans += " "
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())
students = list(map(int, input().split()))


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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

res = [a_s.index(i) + 1 for i in range(1, n + 1)]
for r in res:
	print(r, end=" ")

Submission status: Time Limit Exceeded

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

res = [a_s.index(i) + 1 for i in range(1, n + 1)]
[print(r, end=" ") for r in res]

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

order = []
for j in range(1, n+1):
    for c, k in enumerate(a, start=1):
        if j == k:
            order.append(c)
            break

result = str(order).strip("[]").replace(",", "")
print(result)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

for i in range(1, n+1):
  for j in range(1, n+1):
    if a[j-1] == i:
      list.append(str(j))
print(' '.join(list))

Submission status: Time Limit Exceeded

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

def A(N,a):
    b = []
    for i in range(N):
        b.append(a.index(i+1)+1)
    b = ' '.join(map(str, b))
    print(b)  
A(N,a)

Submission status: Time Limit Exceeded

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

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()))
n = list(range(1,N+1))
for i in range(N):
    print(n[a.index(i+1)] )

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

m=[]
i=1

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

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

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
# Your code here!
n = int(input())

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

for i in range(n):
    for j in range(len(timelist)):
        if(timelist[j]==i+1):
            print(j+1,end=" ")

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):
    tmp = A.index(i)
    ans[i-1] = tmp + 1
ans_str = [str(a) for a in ans]
print(" ".join(ans_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:
from sys import stdin
n = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]
b = []
for i in range(n):
    for j in range(n):
        if i+1 == a[j]:
            b.append(j + 1)
b = [str(i) for i in b]
b = ' '.join(b)
print(b)

Submission status: Time Limit Exceeded

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

for i in range(N):
  ans_list.append(A.index(i+1)+1)
  
print(*ans_list)

Submission status: Time Limit Exceeded

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

for i in range(N):
  for j in range(N):
    if A[j] == i+1:
      ans_list.append(j+1)

print(*ans_list)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n,*a= map(int,open(0).read().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()))
b = [j+1 for i in range(n) for j in range(n) if a[j] == (i+1)]

#for i in range(n)
print(*b)

Submission status: Time Limit Exceeded

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

ans = []
for _ in range(N):
    index = A.index(min(A))
    ans.append(index + 1)
    A[index] = N + 1
print(' '.join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
for i in range(1, Num + 1):
    for l in range(0, Num):
        if list_stu_Num[l] == str(i):
            list_attend_stu.append(l + 1)
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
for i in list_stu_Serial_Num:
    i = str(i)
    l = list_stu_Num.index(i)
    list_attend_stu.append(l)
print(*list(map(lambda x: x + 1, list_attend_stu)))

Submission status: Time Limit Exceeded

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

ans_list = []
for i in range(1, N + 1):
    ans_list.append(A_list.index(i) + 1)
    
print(' '.join([str(n) for n in ans_list]))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans_list = []
for i in range(1, N + 1):
    ans_list.append(str(A_list.index(i) + 1))

ans = ' '.join(ans_list)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(x) for x in 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 = [int(x) for x 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])

Submission status: Time Limit Exceeded

Solution code:
from functools import cmp_to_key
import heapq
N = int(input())
A = list(map(int,input().split()))
B = [(A[i],i+1) for i in range(0,len(A))]
B.sort()
st = ""
for i in B:
    st = st + " " + str(i[1])
print(st[1:])

Submission status: Time Limit Exceeded

Solution code:
from functools import cmp_to_key
import heapq
N = int(input())
A = list(map(int,input().split()))
B = []
for i in range(0,len(A)):
    B.append((A[i],i+1))
B.sort()
st = ""
for i in B:
    st = st + " " + str(i[1])
print(st[1:])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = [int(i) for i in 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 = [int(i) for i in input().split()]
b =[]

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

print(*b, sep=' ')

Submission status: Time Limit Exceeded

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

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


print(*b, sep=' ')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
a = list(map(int, input().split()))
A = np.empty((0, 2), int)
for i in range(n):
  A = np.append(A, np.array([[i+1, a[i]]]), axis = 0)

ans = str(A[A[:, 1].argsort(), :][:, 0]).replace('[', '').replace(']', '')
print(ans)

Submission status: Time Limit Exceeded

Solution code:
a=input()
b=input()
N=int(a)
c=b.split()
A=[]
B=[]
for i in range(N):
    A.append(int(c[i]))
for j in range(1,N+1):
    B.append(A.index(j)+1)
for k in range(N):
    print(B[k])

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
import sys
import numpy as np
input = sys.stdin.readline
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:
import numpy as np
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())
list = list(map(int, input().split()))

dict = {}
for i in list:
    dict[i]= list.index(i)+1
for i in range(1, n+1):
    print(dict[i], end = " ")

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = input().split()
A = [int(s) for s in A]
i = 0
j = 1
while j <= N:
    if j==A[i]:
        print(i+1)
        i = 0
        j = j + 1
    else:
        i = i + 1

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = [0]*N
for i in nums:
    ans[i-1] = nums.index(i)+1

print(*ans)

Submission status: Time Limit Exceeded

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

ans = [0]*N
for i in nums:
    ans[i-1] = nums.index(i)+1

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while True:
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid + 1
        elif x < arr[mid]:
            end = mid -1
        else:
            break
    return mid + 1
for i in range(N):
    print(binary_search(H,i+1))

Submission status: Time Limit Exceeded

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    n = INT()
    a = LIST()
    ans = [a.index(i)+1 for i in range(1, n+1)]

    print(*ans)

if  __name__=='__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(_) for _ in input().split()]
ans=[]
for i in range(n):
	m=min(a)
	ans.append(str(a.index(m)+1))
	a[a.index(m)]=10**6
print(' '.join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
for i in list_stu_Serial_Num:
    i = str(i)
    l = list_stu_Num.index(i)
    list_attend_stu.append(l)
print(*list(map(lambda x: x + 1, list_attend_stu)))

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
for i in list_stu_Serial_Num:
    i = str(i)
    l = list_stu_Num.index(i) + 1
    list_attend_stu.append(l)
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_stu_Num_int = [int(s) for s in list_stu_Num]
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
for i in list_stu_Serial_Num:
    l = list_stu_Num_int.index(i) + 1
    list_attend_stu.append(l)
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
list_stu_Num_index = list(range(Num))
for i in list_stu_Serial_Num:
    for l in list_stu_Num_index:
        if list_stu_Num[l] == str(i):
            list_attend_stu.append(l + 1)
            break
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
list_stu_Serial_Num = list(range(1, Num + 1))
list_stu_Num_index = list(range(Num))
for i in list_stu_Serial_Num:
    for l in list_stu_Num_index:
        if list_stu_Num[l] == str(i):
            list_attend_stu.append(l + 1)
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_attend_stu = []
for i in range(1, Num + 1):
    for l in range(0, Num):
        if list_stu_Num[l] == str(i):
            list_attend_stu.append(l + 1)
print(*list_attend_stu)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=list(int(x) for x in input().split())
val=[]
for i in range(1,N+1):
  val.append(str(a.index(i)+1))

val=" ".join(val)
print(val)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(1, N+1):
  for num in range(0, N):
    if A[num] == i:
      O.append(num +1 )
      break
  
print(*O)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
def quick_sort(arr, arr2):
    left = []
    right = []
    if len(arr) <= 1:
        return arr

    # データの状態に左右されないためにrandom.choice()を用いることもある。
    # ref = random.choice(arr)
    ref = arr[0]
    ref_count = 0

    for ele in arr:
        if ele < ref:
            left.append(ele)
        elif ele > ref:
            right.append(ele)
        else:
            ref_count += 1
    left = quick_sort(left, arr2)
    right = quick_sort(right, arr2)
    return left + [ref] * ref_count + right


N = int(input())
A = list(map(int, input().split()))
Ans = list(range(1, N + 1))

#for i in Ans:
#    print(i, end=" ")

for i in range(N):
    for j in range(len(A)):
        if A[j] == i+1:
            print(Ans.pop(j), end=" ")
            A.pop(j)
            break

Submission status: Time Limit Exceeded

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

for i in range(N):
    for j in range(N):
        if A[j] == i + 1:
            print(j + 1, end=" ")
            break

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(str(a.index(i)+1))
print(" ".join(ans))