Problem:


Score : 300 points

Problem Statement

Takahashi is a teacher responsible for a class of N students.

The students are given distinct student numbers from 1 to N.

Today, all the students entered the classroom at different times.

According to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).

From these records, reconstruct the order in which the students entered the classroom.

Constraints

 1 \le N \le 10^5 

 1 \le A_i \le N 

 A_i \neq A_j  (i \neq j)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \ldots A_N

Output

Print the student numbers of the students in the order the students entered the classroom.

Sample Input 1

3
2 3 1

Sample Output 1

3 1 2

First, student number 3 entered the classroom.

Then, student number 1 entered the classroom.

Finally, student number 2 entered the classroom.

Sample Input 2

5
1 2 3 4 5

Sample Output 2

1 2 3 4 5

Sample Input 3

8
8 2 7 3 4 5 6 1

Sample Output 3

8 2 4 5 6 7 3 1



Sample input:
3
2 3 1


Sample output:
3 1 2

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

for i in range(n):
  A[i].append(i)
A=sorted(A, key=lambda x:x[0])
B=[A[i][1] for i in range(n)]

print(*B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

Num = int(sys.stdin.readline().rstrip())
list_stu_Num = list(sys.stdin.readline().rstrip().split())
print(*np.argsort(list_stu_Num) + 1)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

ans = []
[ans.append(j+1) for i, j in enumerate(A)]
print(*ans)

Submission status: Wrong Answer

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), end=" ")

Submission status: Wrong Answer

Solution code:
N = int(input())

A = list(map(int, input().split()))
ans=[]
for i in range(1,N):
    print(A.index(i), end=" ")

Submission status: Wrong Answer

Solution code:
N = int(input())

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N= int(input())
H = [int(i) for i in input().split( )]
J = [0]*N
for i in range(N):
    J[H[i]-1] = i
for j in range(N):
    print(J[j])

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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 = None
for i in range(1, Num + 1):
    for l in range(0, Num):
        if list_stu_Num[l] == str(i):
            if not list_attend_stu:
                list_attend_stu = list(str(l + 1))
            else:
                list_attend_stu.append(l + 1)
print(*list_attend_stu)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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 = None
for i in range(1, Num + 1):
    for l in range(0, Num):
        if list_stu_Num_int[l] == i:
            if not list_attend_stu:
                list_attend_stu = list(str(l + 1))
            else:
                list_attend_stu.append(l + 1)
print(*list_attend_stu)

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

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

ans = [ i for i in range(n)]
for i,j in enumerate(aes):
    ans[j-1] = i+1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
Num_str = str(Num)
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_stu_Num_int = [int(s) for s in list_stu_Num]
list_Attendance_Num_end = None
while Num > 0:
    for i in range(1, Num + 1):
        if list_stu_Num_int.index(i) + 1 == Num:
            list_Attendance_Num = list(str(Num))
            if not list_Attendance_Num_end:
                list_Attendance_Num_end = list_Attendance_Num
            else:
                list_Attendance_Num_end = list_Attendance_Num_end + list_Attendance_Num
    Num = Num - 1
else:
    list_Attendance_Num_end.reverse()
    list_Attendance_Num_end_int = [int(s) for s in list_Attendance_Num_end]
    print(*list_Attendance_Num_end_int)

Submission status: Wrong Answer

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
Num_str = str(Num)
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_stu_Num_int = [int(s) for s in list_stu_Num]
list_Attendance_Num_end = None
while Num > 0:
    for i in range(1, Num + 1):
        if list_stu_Num_int.index(i) + 1 == Num:
            list_Attendance_Num = list(str(Num))
            if not list_Attendance_Num_end:
                list_Attendance_Num_end = list_Attendance_Num
            else:
                list_Attendance_Num_end = list_Attendance_Num_end + list_Attendance_Num
    Num = Num - 1
else:
    list_Attendance_Num_end.reverse()
    list_Attendance_Num_end_int = [int(s) for s in list_Attendance_Num_end]
    print(list_Attendance_Num_end_int)

Submission status: Wrong Answer

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
Num_str = str(Num)
list_stu_Num = list(sys.stdin.readline().rstrip().split())
list_stu_Num_int = [int(s) for s in list_stu_Num]
list_Attendance_Num_end = None
while Num > 0:
    for i in range(1, Num + 1):
        if list_stu_Num_int.index(i) + 1 == Num:
            list_Attendance_Num = list(str(Num))
            if not list_Attendance_Num_end:
                list_Attendance_Num_end = list_Attendance_Num
            else:
                list_Attendance_Num_end = list_Attendance_Num_end + list_Attendance_Num
    Num = Num - 1
else:
    list_Attendance_Num_end.reverse()
    print(list_Attendance_Num_end)

Submission status: Wrong Answer

Solution code:
import sys

Num = int(sys.stdin.readline().rstrip())
Num_str = str(Num)
list_stu_Num = list(sys.stdin.readline().rstrip().split())
#print(list_stu_Num)
list_stu_Num_int = [int(s) for s in list_stu_Num]
#print(list_stu_Num_int)
list_Attendance_Num_end = None
while Num > 0:
    for i in range(1, Num + 1):
        if list_stu_Num_int.index(i) + 1 == Num:
            list_Attendance_Num = list(str(list_stu_Num_int.index(i)))
            if not list_Attendance_Num_end:
                list_Attendance_Num_end = list_Attendance_Num
            else:
                list_Attendance_Num_end = list_Attendance_Num_end + list_Attendance_Num
            #print(list_Attendance_Num_end)
    Num = Num - 1
else:
    print(list_Attendance_Num_end)

Submission status: Wrong Answer

Solution code:
from operator import itemgetter
n = int(input())
a = list(map(int,input().split()))
ans = []
for i in range(0,n):
  ans.append([a[i],i+1])
print(ans)
ans= sorted(ans,key = itemgetter(0))
print(ans)
for j in range(n):
  print(ans[j][1],end = " ")

Submission status: Wrong Answer

Solution code:
input()
l = sorted([(i+1,v) for i,v in enumerate(input().split())], key=lambda x:x[1])
print(*[i for i, v in l])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input()
print(*[str(i) for i, v in sorted([(i+1,v) for i,v in enumerate(input().split())], key=lambda x:x[1])])

Submission status: Wrong Answer

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

x = [0 for i in range(len(a))]

for i,v in enumerate(a):
	x[v-1] = i+1

print(x)

Submission status: Wrong Answer

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

ans = list(range(0,N))
for i in nums:
    print(nums.index(i)+1)
    ans[i-1] = nums.index(i)+1

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

Submission status: Wrong Answer

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

ans = list(range(0,N))
for i in nums:
    print(nums.index(i)+1)
    ans[i-1] = nums.index(i)+1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
L=list(map(int,input().split()))
NL=[]
for i in range(N):
  NL.append(L[i])
print(NL)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

order = np.argsort(A_lis)

ans = ""
for elem in order:
    ans+=str(elem)
    ans+=" "
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

order = np.argsort(A_lis)
print(order)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=input()
A=list(map(int, input().split()))
A.sort()
for i in A:
    print(i, end=" ")

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split(" "))))
b = list(np.argsort(a)[::-1] + 1)
b = [str(s) for s in b]
print(" ".join(b))

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split(" "))))
b = list(np.argsort(a)[::-1])
b = [str(s) for s in b]
print(" ".join(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(N):
    for j in range(N):
        if A[j]==i:
            print(j)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

result = []

for i in range(len(a)):
    temp = a.index(str(i + 1))
    print(temp)
    result.append(temp + 1)

print(result)

Submission status: Wrong Answer

Solution code:
N=int(input())

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

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

keys_values_dict=dict(zip(keys,values))

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

ans=[keys_values_dict_sorted_as_list[i][0] for i in range(N)]

print(ans)

Submission status: Wrong Answer

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

result = []
for i in range(len(a)):
    temp = int(a[i]) - 1
    result.append(a[temp])

print(result)

Submission status: Wrong Answer

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

order = []
for i in range(1, n+1):
    order.append(As.index(str(i)) + 1)
print(order)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split(' ')))
a.sort()
for i in a:
    print(i)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split(' ')))
a.sort()
print(a)
for i in a:
    print(i)

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c
# -*- coding: utf-8 -*-

stu_cnt = int(input())
stu_bangou = list(map(int, input().strip().split()))

stu_junban = list()
for i in range(1,stu_cnt+1):
    stu_junban.append(stu_bangou.index(i)+1)

print(stu_junban)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
dic = {}
for i in range(N):
    dic[i] = A[i]
dic = sorted(dic.items(), key=lambda x: x[1])
dic = list(zip(*dic))
print([dic[0][i] + 1 for i in range(N)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
a = { x+1 : A[x] for x in range(len(A))}
ans = sorted(a.items(), key=lambda x:x[1])
dict_ans = dict(ans)
ans_val = dict_ans.keys()
print(list(ans_val))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

input_line = input()
N= int(input_line)

input_line = input()
student_num = list(map(int,input_line.split()))

buff = [0 for i in range(N)]
for i in range(len(student_num)):
    buff[student_num[i]-1] = i+1
print(buff)

Submission status: Wrong Answer

Solution code:

s = input().split()
n=int(s[0])

s=(input().split())

list=[[0 for i in range(2)] for j in range(n)]


for i in range(n):
    list[i][1]=i
    list[i][0]=int(s[i])

list.sort()

print('list = {}'.format(list))
for i in range(n):
    print(list[i][1]+1)

Submission status: Wrong Answer

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

ans = [0] * n

for i in range(n):
    s = a[i]
    ans[s-1] = i + 1

print(ans)

Submission status: Wrong Answer

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

Solution code:
import random

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

random.shuffle(a)

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

ans = [0] * n
for (i,ai) in zip(range(n),a):
    ans[ai-1] = i+1
print(ans)

Submission status: Wrong Answer

Solution code:
n = input()
li = list(map(int,input().split()))
lists = []
for j in range(int(n)):
    lists.insert(j, 0)
count = 1
for i in li:
    lists[i-1] = count
    count += 1
print(lists)

Submission status: Wrong Answer

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

print(" ".join(a))

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = list(map(str, input().split()))
o_idx =[]
for i in range(N):
    idx = lst.index((str(i+1)))
    o_idx.extend(str(idx+1))

print(" ".join(o_idx))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

dic = {}

for i in range(n):
    dic["{}".format(a[i])] =i+1
dics= sorted(dic.items())
ans=[i[1] for i in dics]
print(" ".join(map(str,ans)))

Submission status: Wrong Answer

Solution code:

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

dic = {}

for i in range(0,len(a)):
    dic["{}".format(a[i])] =i+1 
dics= sorted(dic.items())
ans=[i[1] for i in dics]
print(" ".join(map(str,ans)))

Submission status: Wrong Answer

Solution code:
A=dict(zip(range(1,int(input())+1),input().split()))
B=sorted(A.items(),key=lambda x:x[1])
for b in B:
    print(b[0],end=" ")

Submission status: Wrong Answer

Solution code:
A={str(n+1):a for n,a in zip(range(int(input())),input().split())}
A_=sorted(A.items(),key=lambda x:x[1])
for a_ in A_:
    print(a_[0],end=" ")

Submission status: Wrong Answer

Solution code:
A={str(n+1):a for n,a in zip(range(int(input())),input().split())}
print(" ".join(sorted(A.items(),key=lambda x:x[1])[i][0] for i in range(len(A))))

Submission status: Wrong Answer

Solution code:
N=range(int(input()))
A={str(n+1):a for n,a in zip(N,input().split())}
print(" ".join(sorted(A.items(),key=lambda x:x[1])[i][0] for i in N))

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
h = list(map(int, input().split()))
b = [N]
for i in range (1,N+1):
    for j in range(1, N):
        if h[j-1]==i:
            b.append(j)

for i in range(N):
    sys.stdout.write(str(b[i])+" ")

Submission status: Wrong Answer

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

i = 0
while i < N:
    j = 0
    while j < N:
        if i + 1 == A[j]:
            B.append(j + 1)
            break
        j += 1
    i += 1

print(B)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
num = int(input())

oridata = input()

data = oridata.split()

ans = [0] * num



for i in range(0, len(data), 1):
    onedata = int(data[i])
    ans[onedata - 1] = i+1


print(ans)

Submission status: Wrong Answer

Solution code:
X=int(input())
Y=[int(i) for i in input().split()]
list=[]
result=1
for i in Y:
  list.insert(i-1,result)
  result+=1
b=" ".join(map(str, list))
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X=int(input())
Y=[int(i) for i in input().split()]
list=[]
result=1
for i in Y:
  list.insert(i-1,result)
  result+=1
print(list)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def solve(A):
    dict_A = {key: val for key, val in zip(range(N), A)}
    score_sorted = sorted(dict_A.items(), key=lambda x : x[1])

    score_sorted = dict(score_sorted)

    answer = [str(i) for i in list(score_sorted.keys())]

    return ' '.join(answer)


print(solve(A))

Submission status: Wrong Answer

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


def solve(A):
    dict_A = {key: val for key, val in zip(range(1, N + 1), A)}
    score_sorted = sorted(dict_A.items(), key=lambda x : x[1])

    score_sorted = dict(score_sorted)

    answer = [str(i) for i in list(score_sorted.keys())]

    return ' '.join(answer)


print(solve(A))

Submission status: Wrong Answer

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


def solve(A):
    dict_A = {key: val for key, val in zip(range(1, N + 1), A)}
    score_sorted = sorted(dict_A.items(), key=lambda x : x[1])

    score_sorted = dict(score_sorted)

    answer = [str(i) for i in list(score_sorted.keys())]
    print(answer)

    return ' '.join(answer)


print(solve(A))

Submission status: Wrong Answer

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


def solve(A):
    dict_A = {key: val for key, val in zip(A, range(N))}
    score_sorted = sorted(dict_A.items(), key=lambda x : x[1])
    score_sorted = dict(score_sorted)

    return list(score_sorted.keys())


print(solve(A))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split(' ')))
A_indexed = [(a, index+1) for index, a in enumerate(A)]
A_indexed.sort(key=lambda a_indexed : a_indexed[1])
print(' '.join('{}'.format(a_indexed[0]) for a_indexed in A_indexed))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
a = np.array(input().split(), dtype='int')

ans = np.empty(n)

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

print(*ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
a = np.array(input().split(), dtype='int')

ans = np.empty(n)

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

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = input().split(" ")

dic = {}
for i, l in enumerate(lst):
  dic[int(l)] = i

ll = []
for i in range(1, n+1):
  ll.append(str(dic[i]))
  
answer = " ".join(ll)
print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
ans_list = []
for i in range(1, len(A) + 1):
  #print(i)
  for j in range(1, len(A) + 1):
    #print(j)
    if i == A[j - 1]:
      ans_list.append(j)
  break

map_ans_list = map(str, ans_list)
print(' '.join(map_ans_list))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
ans_list = []
for i in range(1, len(A) + 1):
  #print(i)
  for j in range(1, len(A) + 1):
    #print(j)
    if i == A[j - 1]:
      ans_list.append(j)
      break
    
print(ans_list)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []#生徒たちが出席した順番
rev = [] #早く来た順の生徒の番号

for x in input().split():
    A.append(int(x))

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

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

Submission status: Wrong Answer

Solution code:

N = int(input())
I = input().split()
A = []
for i in range(N):
    A.append([int(I[i]),i,])

b = sorted(A,key=lambda A :A[0])

print("最初に出席番号", b[0][1]+1, "の生徒が登校しました。")

if N > 2:
    for i in range(1,N-1):
        print("続いて出席番号", b[i][1]+1, "の生徒が登校しました。")

if N > 1:        
    print("最後に出席番号", b[N-1][1]+1, "の生徒が登校しました。")

Submission status: Wrong Answer

Solution code:
N = int(input())

A = list(map(int, input().split()))
B = []

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

print(B)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

dic = {a.index(i)+1: i for i in a}
s_dic = sorted(dic.items(), key=lambda x: x[1])

ans = ''
for i in range(n):
    ans += str(s_dic[i][0]) + ' '

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
K = list(map(int,input().split()))
M = dict(zip(range(1,N+1),K))
M = sorted(M.items(), key = lambda x:x[1])
newM = []
for i in M:
  newM.append(i[0])
print(newM)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input()
A=a.split()
B=a.split()
C=[]
for i in range(len(A)):
    C.append(0)
print(C)
for j in range(len(A)):
    A[j]=int(A[j])
for k in range(len(A)):
    C[A[k]-1]=k+1
for l in range(len(C)):
    C[l]=str(C[l])
s = ' '.join(C)
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
attends = input().split(' ')
ordered = sorted(attends)
ans = ''
for each in ordered:
    ans += str(int(attends.index(each)) + 1) + ' '
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input()
A=a.split()
B=a.split()
C=[]
for i in range(len(A)):
    A[i]=int(A[i])
for i in range(len(A)):
    C.append(B[A[i]-1])
s = ' '.join(C)
print(s)

Submission status: Wrong Answer

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

for i in range(n):
  queue.append(0)
 
for i in range(n):
  a = ls[i] - 1
  queue.insert(a, i+1)
  
for i in range(len(queue)):
  if(queue[i] != 0):
    print(queue[i], end=' ')

Submission status: Wrong Answer

Solution code:
N = int(input())
d = []

A = list(map(int, input().split()))
k = []
ANS = []
for i in range(1, N+1):
  k.append(i)

d = list(zip(k, A))
d.sort(key=lambda x:x[0])

for b in range(N):
  print(d[b][1], end=" \n"[b + 1 == N])

Submission status: Wrong Answer

Solution code:
N = int(input())
dic = {}

A = list(map(int, input().split()))
k = []
ANS = []
for i in range(1, N+1):
  k.append(i)

dic = dict(zip(k, A))
dic = dict(sorted(dic.items(), key=lambda x:x[0]))

for key in dic:
  ANS.append(key)

for b in range(N):
  print(ANS[b], end=" \n"[b + 1 == N])

Submission status: Wrong Answer

Solution code:
N = int(input())
dic = {}

A = list(map(int, input().split()))
k = []
ANS = []
for i in range(1, N+1):
  k.append(i)

dic = dict(zip(k, A))
dic = dict(sorted(dic.items(), key=lambda x:x[1]))

for key in dic:
  ANS.append(key)

for b in range(N):
  print(ANS[b], end=" \n"[b + 1 == N])

Submission status: Wrong Answer

Solution code:
N = int(input())
dic = {}
dic2 = {}
A = list(map(int, input().split()))
k = []
ANS = []
for i in range(1, N+1):
  k.append(i)

dic = dict(zip(k, A))
dic2 = dict(sorted(dic.items(), key=lambda x:x[1]))

for key in dic2:
  ANS.append(key)

for b in range(N):
  print(ANS[b], end=" \n"[b + 1 == N])

Submission status: Wrong Answer

Solution code:
N = int(input())
dic = {}
dic2 = {}
A = list(map(int, input().split()))
k = []
ANS = []
for i in range(1, N+1):
  k.append(i)

dic = dict(zip(k, A))
dic2 = dict(sorted(dic.items(), key=lambda x:x[1]))
print(dic2)
for key in dic2:
  ANS.append(key)

for b in range(N):
  print(ANS[b], end=" \n"[b + 1 == N])

Submission status: Wrong Answer

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

S = ""
for i in range(N):
  S += str(A.index(i+1))
  if i != N:
    S += " "
  
print(S)

Submission status: Wrong Answer

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

ans = []
for k in range(0,len(A)):
    print(k)
    ans.append(A.index(k+1))
    
ans = list(map(lambda x:x+1, ans))
ans = list(map(str, ans))
L = " ".join(ans)

print(L)

Submission status: Wrong Answer

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

ans = []
for k in range(0,len(A)):
    print(k)
    ans.append(A.index(k+1))
    
ans = list(map(lambda x:x+1, ans))

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())

A = np.array([int(i) for i in input().split()])

x = np.argsort(A)
x += 1

print(x)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
ans = ["a" for x in range(len(nu))]
                          
for i, v in enumerate(nu):
  #print("i=", i)
  #print("v=", v)
  ans[v-1] = i+1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
NU = [int(x) for x in input().split()]
r2 = {}

for i in NU:
  r2[i] = NU.index(i)


j2 = []
for i in range(len(r2)):
  j2.append(r2[i+1]+1)
print(j2)

Submission status: Wrong Answer

Solution code:
N = int(input())
NU = [int(x) for x in input().split()]
r = {}

for i in NU:
  r[NU.index(i)] = i

j = []
for i in range(len(r)):
  j.append(r[i])
print(j)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [a for a in map(int, input().split())]
R = {}
for i in range(1,N+1):
    R[i] = A[i-1]

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

Ans = [a[0] for a in R_sorted]
print(Ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n % 2 == 0:
    a = n // 2
else:
    a = n // 2 + 1

print(a/n)

Submission status: Wrong Answer

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

print(attend_list)

Submission status: Wrong Answer

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

N = int(input())
As = [int(i) for i in input().split()]
order = [0]*N

for i in range(N):
    order[i-1] = As[i]
order = map(str, order)
print(" ".join(order))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
attendance_book = list(map(int, input().split()))
attendance_order = []
for i in range(n):
  j = attendance_book[i]-1
  attendance_order.insert(j, i+1)
print(' '.join(map(str, attendance_order)))