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())
attends = [int(x) for x in input().split()]
for x in range(1, n + 1):
    print(attends.index(x) + 1)

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

Submission status: Time Limit Exceeded

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

index_number = [str(int(a.index(str(i + 1))) + 1) for i in range(n)]


print(" ".join(index_number))

Submission status: Time Limit Exceeded

Solution code:
import sys
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())
caps = list(map(int, input().split()))
order = [0] * N
output = []
for i in range(0,N):
    if i < N - 1 :
        print(caps.index(i+1)+1, sep=" ")
    else:
        print(caps.index(i+1)+1, sep="")

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

a_list = [int(i) for i in a]

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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


x = np.array(A)

for i in range(len(x)):
    print (np.argsort(x)[i]+1,"",end="")

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = input()
    a = input().split(" ")
    res = [str(i+1) for i in range(len(a))]
    r = ""
    for i in res:
        r += str(a.index(i) + 1) + " "
    print(r[:-1])
if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

h = [int(x) for x in input().split(' ')]

listh =[]
for j in range(n) :
	listh.append([h[j], j+1])

listh.sort()

s = ''
for k in range(n) :
	s = s + str(listh[k][1]) + ' '

print(s)

Submission status: Time Limit Exceeded

Solution code:
import copy
N=int(input())
L=[int(x) for x in input().split()]
L0=copy.copy(L)
L.sort()
Ans=[]

for i in range(N):
	for j in range(N):
		if L[i]==L0[j]:
			Ans.append(j+1)

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

Submission status: Time Limit Exceeded

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

for i in range(1,N+1):
  print(h.index(i)+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):
  S+=str(A.index(i)+1)+' '
print(S)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int,input().split()))
S = ''

for i in range(N):
    n = A.index(i+1)
    S += str(n+1) + ' '

print(S.lstrip())

Submission status: Time Limit Exceeded

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


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
a = int(input())
b = list(map(int,input().split()))
c = []
for val in range(a):
    c.append(5)
for val in range(a):
    c[b[val]-1] = val+1
    d = str()
for val in c:
    d = d + str(val) + " "
d = d.rstrip()
print(d)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

ans = ""

Aians = sorted(enumerate(Ai), key = lambda x: x[-1])

for ansNum in Aians:
    ans = ans + str(ansNum[0] + 1) + " "

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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


for i in range(1, n+1):
    for j in range(0, n):
        if i == a[j]:
            ans.append(j+1)

print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

b = list(a.index(i) + 1 for i in range(1,n+1))
  
print(' '.join(map(str, b)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
# C - Go to School
n = (int)(input())

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

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

a.sort()

result = ""
for j in a:
    result = result + str(map[j]) + " "

print(result[:-1])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

order = [0] * N
flag = 0
for i in range(0, N):
    flag = A.index(min(A))
    order[i] = flag + 1
    A[flag] = N + 1

for s in order:
    print(s, end =" ")

Submission status: Time Limit Exceeded

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

index_number = [str(a.index(i + 1) + 1) for i in range(n)]


print(" ".join(index_number))

Submission status: Time Limit Exceeded

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

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

a = ""
for idx in range(n-1):
  a += str(ans[idx])
  a += " "

a += str(ans[n-1])
print(a)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
Alist = input().split()
Result = []
for i in range(1,n+1):
    Result.append(int(Alist.index(str(i))) + 1)
for i in range(0,n):
    print(Result[i],end=" ")

Submission status: Time Limit Exceeded

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

li = list()
for i, n in enumerate(A):
    li.append((i + 1, n))

li.sort(key=lambda x: x[1])
ans = ""
for y in li:
    ans = ans.__add__(str(y[0]) + " ")

print(ans.strip())

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(' '.join(map(str, b)))

Submission status: Time Limit Exceeded

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

out = ' '.join(R)
print(out)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

r = []

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

result = ""

for t in r:
    result = result + str(t+1) + " "

print(result)

Submission status: Time Limit Exceeded

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

print(out_str[:-1])

Submission status: Time Limit Exceeded

Solution code:
#N:生徒の人数、A:登校記録のリスト、j:何人目の生徒が登校している、i:出席番号

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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[a[i]-1] = i+1
    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: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
ls = [0]*N
for i in range(N):
    ls[i] = A.index(i+1)
def plus(n):
    return n + 1
ls = map(plus,ls)
print(*ls)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = ""
for i in range(n):
    ans = ans + str( a.index(i+1)+1 )
    if i+1 is not n:
        ans += " "

print(ans)

Submission status: Time Limit Exceeded

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

for i in range(len(A)):
  print(A.index(i+1)+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):
    if i != n+1:
        print('{} '.format(a.index(i)+1),end="")
    else:
        print(a.index(i)+1)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

ans = ""

Aians = sorted(enumerate(Ai), key = lambda x: x[-1])

for ansNum in Aians:
    ans = ans + str(ansNum[0] + 1) + " "

print(ans)

Submission status: Time Limit Exceeded

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

n = int(input())
a = list(map(int,input().split()))
l = []

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

Submission status: Time Limit Exceeded

Solution code:
# N, K = map(int, input().split())
N = int(input())
H = [int(i) for i in input().split()]
ans_list = []

for j in range(N):
    # print(H.index(j+1) + 1)
    ans_list.append(H.index(j+1) + 1)

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

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 += [a.index(i)+1]
print(' '.join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a_list = list(map(int,input().split()))
import copy
b_list = copy.deepcopy(a_list)
ans_list = []
for i in range(n):
  ans_list.append(a_list.index(min(b_list)) + 1 )
  b_list.remove(min(b_list))
for i in ans_list:
    print(i, end = ' ')

Submission status: Time Limit Exceeded

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

ans=""
for i in range(n):
    ans+=str(listb[i])+" "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
h = [int(i) for i in input().split()]
num = []
for i in range(len(h)):
  num += [h.index(i+1)+1]
print(*num, sep=" ")

Submission status: Time Limit Exceeded

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

    max_num = 10005
    ans = []
    for i in range(len(a)):
        target = a.index(min(a))
        ans.append(target + 1)
        a[target] = max_num

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


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

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

    print(a.index(i) + 1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
L = list(map(int, input().split()))
ret = []
for i in range(1,n+1):
  ret.append([k+1 for k, x in enumerate(L) if x == i])
print(*sum(ret,[]))

Submission status: Time Limit Exceeded

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

while i < n:
    j =a.index(min(a))+1
    a[j-1]+=n
    i+=1
    print(j, end=" ")

Submission status: Time Limit Exceeded

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

t = []
for i in range(N):
    t.append(0)

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

res = ''
for i in range(N):
    res = res + str(t[i]) + ' '

print(res.strip())

Submission status: Time Limit Exceeded

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


def key_search(dicti, item):
    for k, v in dicti.items():
        if v == item:
            return k


popu = {str(i): As[i] for i in range(n)}
jb = {str(i+1): int(key_search(popu, i+1)) + 1 for i in range(n)}

# print(popu)
# print(jb)

Ans = [jb[str(i+1)] for i in range(n)]
print(*Ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

student_list = input().rstrip().split(' ')

answer = ""

for n in range(1, N+1):
  i = student_list.index(str(n))
  answer += str(i+1) + " "
  
print(answer[0:-1])

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

ans = ""

list(enumerate(Ai))
Aians = sorted(enumerate(Ai), key = lambda x: x[-1])

for ansNum in Aians:
    ans = ans + str(ansNum[0] + 1) + " "

print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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


ans = []

for i in range(n):
	idx = a.index(min(a))
	a[idx] = n+100
	ans.append(idx+1)

print(*ans)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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
for i in range(len(a)):
  print(a[i], end="")
  if(i<len(a)):
    print(" ",end="")

Submission status: Time Limit Exceeded

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

for i in range(n):
    j = a.index(i+1)
    m.append(str(j+1))
else:
    print(" ".join(m))

Submission status: Time Limit Exceeded

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

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

out = ' '.join(R)
print(out)

Submission status: Time Limit Exceeded

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

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

    # print(a.index(i) + 1, end=" ")

print(*li)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
attends = list(map(int, input().split()))
for x in range(1, n + 1):
    print(attends.index(x) + 1)

Submission status: Time Limit Exceeded

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

for i in range(N):
    n = 0
    a = min(B)
    for n in range(len(A)):
        if A[n] == a:
            S += str(n+1) + ' '
            B.remove(min(B))

print(S.lstrip(' '))

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()))
x = []
for i in range(1000000, 1000000 + n):
    x.append(i + 1)
for j in range(n):
    x.remove(a[j] + 1000000)
    x.insert(a[j] - 1, j + 1)
print(" ".join(map(str, x)))

Submission status: Time Limit Exceeded

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]=n+1

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

Submission status: Time Limit Exceeded

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

for i in range(1,len(h)+1):
  print(h.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(len(a)):
    for j in range(len(a)):
        if i+1 == a[j]:
            ans.append(j+1)
            break
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = list(map(int, input().split()))
ans=""
def func1(lst, value):
    return [i for i, x in enumerate(lst) if x == value]
for i in range(N):
    # tmp=L.index(i+1)
    tmp=func1(L, i+1)
    ans+=str(tmp[0]+1)+" "
print(ans)

Submission status: Time Limit Exceeded

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(' '.join(map(str, a)))

Submission status: Time Limit Exceeded

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

    a_tuple_list = []
    for i, a in enumerate(a_list):
        temp = (a, i)
        a_tuple_list.append(temp)
    a_tuple_list.sort()

    ret = ''
    for t in a_tuple_list:
        ret += str(t[1]+1) + ' '
    print(ret)


if __name__ == '__main__':
    sub_c()

Submission status: Time Limit Exceeded

Solution code:
#coding:utf-8
n = int(input())
a = list(map(int, input().split()))
a_sort = sorted(a)
ans = []

for i in range(0, n):
    for j in range(0, n):
        if a_sort[i] == a[j]:
            ans.append(j+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
N=int(input())
A=tuple(map(int,input().split()))
X=[None]*N
for i in range(N) :
    X[i]=str(A.index(i+1)+1)
print(" ".join(X))

Submission status: Time Limit Exceeded

Solution code:
def q_C(N, arrA):
	res = [0] * N
	#sortA = sorted(arrA, reverse=True)
	for i in range(N):
		tmp = i + 1
		for j in range(N):
			if tmp == arrA[j]:
				res[i] = j + 1
				break
	print(*res)

N = int(input())
arrA = [int(x) for x in input().split()]
q_C(N, arrA)

Submission status: Time Limit Exceeded

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

n = int(raw_input())
li = map(int, raw_input().split())

s = ""

for i in xrange(1,n+1):
    s += str(li.index(i) +1) + " "

print s

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = list(map(int, input().split()))
dic={}
for i in range(N):
    dic[i]=a.index(i+1)+1
print(*list(dic.values()), sep=" ")

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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


b = {}
for i in range(0,n):
    for j,x in enumerate(a):
        if x == i+1:
            print(str(j+1)+" ",end="")
            break

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
a = list(map(int, input().split()))
mozi=""
for i in range(n):
    mozi = mozi+" "+str(a.index(i+1)+1)

print(mozi)

Submission status: Time Limit Exceeded

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

l = []
for i in range(n):
    hoge = A.index(min(A))
    print(hoge+1, end=' ')
    A[hoge] = n+1

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    ans += str(a_l.index(i)+1)+' '

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
caps = list(map(int, input().split()))
order = [0] * N
output = []
for i in range(0,N):
    order[i] = caps[caps[i]-1]
for i in range(0,N):
    output.append(caps[order.index(i+1)])

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

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = input()
    a = list(map(lambda x:int(x),input().split(" ")))
    res = ""
    res = [str(a.index(i+1) + 1) for i in range(len(a))]
    print(" ".join(res))

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, A: "List[int]"):
    result_list = []
    for i in range(1, N + 1):
        result_list.append(str(A.index(i) + 1))
    print(" ".join(result_list))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

sorted_a = sorted(a)
for value in sorted_a:
    print(a.index(value) + 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(str(a.index(i)+1))
b=' '.join(ans)
print(b)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
h = [int(i) for i in input().split()]
num = []
for i in range(len(h)):
  num.append(h.index(i+1)+1)
print(*num, sep=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(*a)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

#count = 0
#numdict = {}

number = 1
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(" ")))
M=max(a)+1

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

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:
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby



num = int(stdin.readline().rstrip())
data = stdin.readline().rstrip().split()
res = []
for el in range(1, num + 1):
    res.append(str(data.index(str(el)) + 1))
print(' '.join(res))

Submission status: Time Limit Exceeded

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

P = []

for i in range(N):
    temp = A.index(i+1) + 1
    print(temp,end=' ')
#    temp = str(temp)
#    P.append(temp)


#print(' '.join(P))

Submission status: Time Limit Exceeded

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

for i in range(N):
    n = 0
    a = min(B)
    for n in range(len(A)):
        if A[n] == a:
            O.append(n+1)
            B.remove(min(B))

S = ''
for j in range(N):
    S += str(O[j]) + ' '

print(S.lstrip(' '))

Submission status: Time Limit Exceeded

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

import numpy as np

ans = []
for i in range(N):
    tmp = np.argmin(nums)
    ans.append(tmp+1)
    nums[tmp] = 10**10
print(*ans)

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(' '.join(map(str, order)))

Submission status: Time Limit Exceeded

Solution code:
#C

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


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

Submission status: Time Limit Exceeded

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

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()))
l = []

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

a = list(map(lambda x:int(x), input().split()))

#junban = []

for i in range(n):
    jun = a.index(i+1)
    #junban.append(jun+1)
    if i != n:
        print(jun+1," ",end="")
    else:
        print(jun+1)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

n = int(input())
a_list = np.array(list(map(int, input().split())))
# a_list = np.array([3,4,2,1,5])

ans_list = a_list.argsort() + 1

ans = str(ans_list[0])
for i in ans_list[1:]:
    ans = ans + ' ' + str(i)

print(ans)

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
X=[None]*N
for i in range(N) :
    X[i]=str(A.index(i+1)+1)
print(" ".join(X))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = list(map(int, input().split()))
ans=""
for i in range(N):
    tmp=L.index(i+1)
    ans+=str(tmp+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):
    print(A.index(i)+1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
out = [0] * n
count = 0
out_str = ""
for i in range(n):
    out[a[i] - 1] = i + 1
        
for i in range(n):
    out_str = out_str + str(out[i]) + " "

print(out_str[:-1])

Submission status: Time Limit Exceeded

Solution code:

N= int(input())
A=[[int(i), ind] for ind, i in enumerate(input().split())]

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

Submission status: Time Limit Exceeded

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

d = {}
for a in A:
    d[A.index(a) + 1] = a

ans = [str(k) for k, _ in sorted(d.items(), key=lambda x: x[1])]
print(" ".join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while i < n:
    j =a.index(min(a))+1
    b.append(j)
    a[j-1]+=n
    i+=1
    print(j, end=" ")

Submission status: Time Limit Exceeded

Solution code:
x=[]
a=int(input())
l=input().split()
for i in range(a):
  x.append(str(l.index(str(i+1))+1))
print(' '.join(x))

Submission status: Time Limit Exceeded

Solution code:
def myinput(rownum):
    res = []
    for i in range(rownum):
        temp = input().split(" ")
        res += temp
    return res


def main():
    r = myinput(2)
    n = r[0]
    a = list(map(lambda x:int(x),r[1:]))
    res = ""
    res = [str(a.index(i+1) + 1) for i in range(len(a))]
    print(" ".join(res))

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(1, n + 1):
    l.append([i, a[i - 1]])

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

res = str(l[0][0])
for i in range(1, n):
    res = res + " " + str(l[i][0])
print(res)

Submission status: Time Limit Exceeded

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

l = []
for i in range(n):
    hoge = A.index(min(A))
    l.append(hoge+1)
    A[hoge] = n+1

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