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: Runtime Error

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

res = [""] * N
for i in range(N):
  res[A[i]-1] = i+1

print(" ".join(res))

Submission status: Runtime Error

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

i = 0
person = [0,0,0,0,0,0,0,0]
ans = []
for k in a:
    i += 1
    person[k-1] = i

a.sort()
for l in a:
    ans.append(str(person[l-1]))

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

Submission status: Runtime Error

Solution code:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
	dic_l[l[i]]=i 
	for j in range(1,n+1):
		lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Submission status: Runtime Error

Solution code:
n=int(input()) 
l=list(map(int,input().split())) 
dic_l={} 
lst_1=[] 
for i in range(n): 
  dic_l[l[i]]=i 
  for j in range(1,n+1): 
    lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Submission status: Runtime Error

Solution code:
n=int(input()) 
l=list(map(int,input().split())) 
	dic_l={} 
	lst_1=[] 
	for i in range(n): 
		dic_l[l[i]]=i 
	for j in range(1,n+1): 
		lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Submission status: Runtime Error

Solution code:
n=int(input()) 
l=list(map(int,input().split())) 
	dic_l={} 
	lst_1=[] 
	for i in range(n): 
		dic_l[l[i]]=i 
		for j in range(1,n+1): 
			lst_1.append(str(dic_l[j]+1)) 
print(" ".join(lst_1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
v=int(input())
#文字列
s=[0]*v
x=0
for i in range(v):
    x=int(input())
    s[x-1]=i+1
for i in range(v-1):
    print(s[i]," ",sep="",end="")
print(s[v-1])

Submission status: Runtime Error

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

L = [0]*n

for i, order in enumerate(l, 1):
    L[order-1] = i

print(*L)

Submission status: Runtime Error

Solution code:
N = int(input())
a = []
for i in range(N):
  k = int(input())
  a.append([k,i])
sort(a)
for i in range(N):
  print(a[i][1])

Submission status: Runtime Error

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

a=[0]*N

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
student = list(map(int,input().split()))
 
ans = [0] * n   #登校した順番を記録するためのリスト
 
for i in range(n):
    s = student[i]   #出席番号がiの人が来た時に、既にs人いました。
    ans[s-1] = i+1 　#なのでansリスト(来た順に対応させる)のs-1番目(リストの仕様)に出席番号iの人が配属されます。

print(*ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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(" ".join(map(str, ans)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
nums = list(map(int,input().split(" ")))
res = [0 for _ in range(len(nums))]
for i in range(len(nums)):
    index = i+1
    cnt = nums[i]
    res[cnt-1] = index
print(res)

Submission status: Runtime Error

Solution code:
n = int(input())
array = list(map(int, input().strip().split(" ")))
ans = [0]*n

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



print(" ".join(ans))

Submission status: Runtime Error

Solution code:
n = int(input())
array = list(map(int, input().strip().split(" ")))
ans = [0]*n

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



print(" ".join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import _collections
import string
from functools import lru_cache
import heapq

class cin():
    def int():
        return int(sys.stdin.readline().rstrip())
    def string():
        return sys.stdin.readline().rstrip()
    def mapInt():
        return [int(x) for x in cin.string().split()]
    def stringList(n):
        return [input() for i in range(n)]
    def intListList(n):
        return [cin.mapInt() for i in range(n)]
    def intColsList(n):
        return [int(input()) for i in range(n)]
        
class Math():
    def gcd(a,b):
        if b == 0:
            return a
        return Math.gcd(b,a % b)
    def lcm(a,b):
        return (a * b) // Math.gcd(a,b)
    def roundUp(a,b):
        return -(-a // b)
    def toUpperMultiple(a,x):
        return Math.roundUp(a,x) * x
    def toLowerMultiple(a,x):
        return (a // x) * x
    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret

MOD = int(1e09) + 7

def main():
    N = cin.int()
    A = cin.mapInt()
    T = [0] * N
    for i in range(N): 
        T[A[i] - 1] = i + 1
    print(*T," ")
    return

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

o = []
for i in range(n):
    o.append(a.index(i))
    o.append(" ")
print(o)

Submission status: Runtime Error

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

o = []
for i in range(n):
    o.append(a.index(i))
print(o)

Submission status: Runtime Error

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

o = []
for i in range(n):
    o.applend(a.index(i))
print(o)

Submission status: Runtime Error

Solution code:
int main()
    {
        int a[100000]={0},i;
        int n,t;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&t);
            a[t]=i;
        }
        
        for(i=1;i<=n;i++)
        printf("%d ",a[i]);

Submission status: Runtime Error

Solution code:
n=int(input())
l = [0]*100000
for i in range(1,n+1):
    num=int(input())
    l[num]=i
for i in range(1,n+1):
    print(l[i])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#142
import pandas as pd
N = int(input())
S = list(map(int,input().split()))
df = pd.DataFrame()
for i, j in enumerate(S,1):
    df_tem = pd.DataFrame([i, j]).T
    df = pd.concat([df, df_tem], axis=0)
df.columns = ['x', 'y']
df = df.sort_values(by='y')

print(' '.join(list(map(str,df['x'].tolist()))))

Submission status: Runtime Error

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(" ".join(mao(str, ans)))

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(input())
ans=''
for i in range(1,n+1):
    ans+=str(a.index(str(i))+1)+' '

print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
L = []
for i in range(1,N+1):
    temp = int(input())
    L.append(temp - 1)
for i in L:
    print (i)

Submission status: Runtime Error

Solution code:
n1 = int(input())
l1 = [int(x) for x in input().split()]
l2 = [""] * 8

for i, v in enumerate(l1):
  l2[v -1] = i + 1

ans = ""
for i in l2:
  ans = ans + str(i) + " "
print(ans[:-1])

Submission status: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

Solution code:
i=int(input())
s=input().split()
a=[]
ls=[]
for k in range(i):
  ls.append([s[k],k+1])
ls.sort()
for k in range(i):
  a[k]=ls[k][1]
print(*a)

Submission status: Runtime Error

Solution code:
i=int(input())
s=input().split()
a=""
ls=[]
for k in range(i):
  ls.append([s[k],k+1])
ls.sort()
for k in range(i-1):
  a=a+ls[k][1]+" "
a=a+ls[i-1][1]
print(a)

Submission status: Runtime Error

Solution code:
i=int(input())
s=input().split()
a=""
for k in range(i-1):
  a+=s.index(str(k+1))+" "
a+=s.index(str(i))
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
li = list(map(int, input().split()))
ans = dict()
for i in range(len(li)):
    ans[li[i]] = i + 1
ali = []
for j in sorted(ans.keys()):
    ali.append(ans[j])
print(*join(ali))

Submission status: Runtime Error

Solution code:
N = int(input())
li = list(map(int, input().split()))
ans = dict()
for i in range(len(li)):
    ans[li[i]] = i + 1
ali = []
for j in sorted(ans.keys()):
    ali.append(ans[j])
print(ali.split())

Submission status: Runtime Error

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

ans = range(n)
for i in range(n):
    ans[a[i]-1] = i+1
print(" ".join(map(str,ans)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

typedef struct {
    int ipt; int num;
} tpl;

int asc(const void *a, const void *b) {
    return ((*(tpl *)a)).ipt - ((*(tpl *)b)).ipt;
}

int main(void){
    int N;
    scanf("%d", &N);
    int a[100000 + 10];
    tpl array[100000 + 10];
    for (int i = 0; i < N; i++) {
        scanf("%d", &array[i].ipt);
        array[i].num = i + 1;
    }
    qsort(array,N,sizeof (tpl), asc);
    for (int i = 0; i < N; i++) {
        printf("%d ",array[i].num);
    }

}

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
d=[0]*n
for i,val in enumerate(l):
  d[v-1]=i+1
print(d)

Submission status: Runtime Error

Solution code:
#ABC142_C
N=int(input())
A=list(map(int,input().split()))
ans=[i+1 for i,_ in sorted(enumerate(A),key=itemgetter(1))]

print(*ans)

Submission status: Runtime Error

Solution code:
#ABC142_C
N=int(input())
A=list(map(int,input().split()))
ans=[i+1 for i,_ in sorted(enumerate(A),key=itemgetter(1))]
print(*ans)

Submission status: Runtime Error

Solution code:
n = int(input())
t = list(input().split())
o = []
for i in range(n):
  for j in range(n):
  	if t[j] == (i+1):
      o.append(j)
print(o)

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = list(range(1,N+1,1))
C = zip(A,B)
C.sort()
a, b = zip(*C)
print(" ".join(str(x) for x in b))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = list(range(1,N+1,1))
C = zip(A,B)
C.sort()
a, b = zip(*C)
print(' '.join(b))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int,input().split()))
B = list(range(1,N+1,1))
C = zip(A,B)
C.sort()
a, b = zip(*C)
print(' '.join(b))

Submission status: Runtime Error

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


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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [] * N
for i in A:
    ans[i] = i
print(ans.join(" "))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
int main (){
    int N;
    vector<int> A;
    cin >> N;
    for(int i = 0; i < N; i++){     /*A = list(map(int, input().split()))*/
        int t;
        cin >> t;
        A.push_back(t); 
    }
    for(int i = 0; i < N; i++){
        if(i == N - 1){
            cout << find(A.begin(), A.end(), N) - A.begin() + 1 << endl;
        }else{
            cout << find(A.begin(), A.end(), i + 1) - A.begin() + 1 << " "; 
        }
    }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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 l[j] == i:
            print(j, end = " ")
            break

Submission status: Runtime Error

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

for num in range(N):
  if num == (list(A))[i]:
    listA.append(num)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
h = input().split()
count = 0

for i in range(N):
    if int(h[i]) >= K:
        count += 1

print(count)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
disk, idx = list(range(n + 1)), list(range(n + 1))

now = 0
for _ in range(m):
    nxt = int(input())
    disk[idx[nxt]], idx[nxt], idx[now] = now, 0, idx[nxt]
    now = nxt
print(*disk[1:], sep="\n")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import unittest


class TestC(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think([2, 3, 1]), [3, 1, 2])

    def test_2(self):
        self.assertEqual(think([1, 2, 3, 4, 5]), [1, 2, 3, 4, 5])

    def test_3(self):
        self.assertEqual(think([8, 2, 7, 3, 4, 5, 6, 1]), [8, 2, 4, 5, 6, 7, 3, 1])


def solve():
    a = read()
    result = solve(a)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a):
    list_of_index_and_a = []
    for index, e in enumerate(a):
        list_of_index_and_a.append((index + 1, e))

    list_of_index_and_a.sort(key=lambda x: x[1])
    return [x[0] for x in list_of_index_and_a]


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Runtime Error

Solution code:
n = int(input())
L = list(map(int,input().split()))
S = []
for i in range(n):
  S.append([L[i],i+1])
S.sort()
for i in range(n):
  print(' '.join(S[i][1]))

Submission status: Runtime Error

Solution code:
n = int(input())
a=[]

b = list(map(int, input().split()))
for i in range(n):
    4a+=[[i+1, b[i]] ]
    
    
import operator as op
a.sort(key = op.itemgetter(1))

x=""
for i in range(n):
    x+=str(a[i][0])
    if i!=n-1:
        x+=" "
#a = [[3,-9],[2,3],[1,20]]
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall

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

B = [0]*N

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

print(B*)

Submission status: Runtime Error

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

print(*d)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
##(N,K)=map(int,input().split())
##v=list(map(int, input().split()))
N=int(input())

v=[0]*N
for i in range(N):
    c=int(input())
    v[c-1]=i

for i in v:
    print(i+1)
    print(" ")

Submission status: Runtime Error

Solution code:
##(N,K)=map(int,input().split())
##v=list(map(int, input().split()))
N=input()

v=[0]*N
for i in range(N):
    c=input()
    v[c]=i

for i in v:
    print(i+" ")

Submission status: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
N, K = map(int,input().split( ))
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(arr,i))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import deque
n = int(input())
a = deque(list(map(int, input().split())))
ans = []
for i in range(1,n+1):
    ans[a.popleft()] = i
    
print(*ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

B=np.argsort(A)+1

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

Submission status: Runtime Error

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

B=np.argsort(A)

print(' '.join(map(str,B+1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
list=[]
for num in range(n):
    i=int(input())
    list.append(i)
for num in range(n):
    print(list.index(num+1)+1)

Submission status: Runtime Error

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

ans = []

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

Submission status: Runtime Error

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

random.shuffle(a)

print(a)

Submission status: Runtime Error

Solution code:
N=int(input())
list=[]
for i in range(10^5):list.append([0])
c=1
for i in range(N):
    n=int(input())
    list[n]=c
    c+=1

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

Submission status: Runtime Error

Solution code:
N=int(input())

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

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

for i in range(N);
	print(B[i],end=" ")

Submission status: Runtime Error

Solution code:
N=int(input())

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

B=[[0]*N]
for i in range(N):
  B[A[i]]=i

for i in range(N);
	print(B[i],end=" ")

Submission status: Runtime Error

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

Submission status: Runtime Error

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 ' '.join(list(score_sorted.keys()))


print(solve(A))

Submission status: Runtime Error

Solution code:
N = int(input())
order = [int(x) for x in input().split()]
order_sorted = sorted(range(len(order)), key=lambda k: order[k])
order_sorted = [x+1 for in x order_sorted]
print(*order_sorted)

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
A = [int(i) for i in input().split()]
arr = np.arange(3) 
for i in range(N):
    arr[A[i]-1] = i+1
for i in range(N):   
    print(arr[i],end=" ")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
a=[]
for i in range(n):
       a〔int(input())〕=i+ 1
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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(dic[i])
  
answer = " ".join(ll)
print(answer)

Submission status: Runtime Error

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

for i in nu:
  r2[i] = nu.index(i)
#print(r2)

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

print(" ".join(j2))

Submission status: Runtime Error

Solution code:
N = int(input())
Alist = list(map(int, input().split()))
V = [0 for v in range(N)]
for i in range(N):
  V[Alist[i]] += i+1

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

Submission status: Runtime Error

Solution code:
N = int(input())
Alist = list(map(int, input().split()))
V = [0 for v in range(N)]
for i in range(1,N+1):
  A = Alist[i]
  V[A] += i
print(' '.join(map(str,V)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()
a = []
b = []
c = []
num = n
for i in range(n):
  a[i] = (int(x) for x in input().split())
  b[a[i]].append(i)
print(b)

Submission status: Runtime Error

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

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

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

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

Submission status: Runtime Error

Solution code:
n = input()
a = []
b = []
c = []
num = n
for i in range(n):
  a[i].append(input())
  b[a[i]].append(i)
print(b)

Submission status: Runtime Error

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

i = 0
for x in input().split():
    i += 1
    A.append(int(x))
    students.append(int(i))

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

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

Submission status: Runtime Error

Solution code:
n = input()
a = []
b = []
c = []
num = n
for i in range(n):
  a[i].append(input())
for i in range(n):
  b[a[i]].append(i)
for i in range(n):
  c[a[i]].append(i)
print(c)

Submission status: Runtime Error

Solution code:
n = input()
a = []
b = []
c = []
num = n
for i in range(n):
  a[i].append()
for i in range(n):
  b[a[i]].append(i)
for i in range(n):
  c[a[i]].append(i)
print(c)

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
lis = list(map(lambda x: -int(x),input().split()))

import heapq
heapq.heapify(lis)
for _ in range(M):
    tmp = -heapq.heappop(lis)
    tmp //= 2
    heapq.heappush(lis,-tmp)

print(-sum(lis))

Submission status: Runtime Error

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: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
  int N; cin >> N;
  vector<int> P(N), Q(N);
  for(int i=0; i<N; i++){
    cin >> P[i];
  }
  for(int i=0; i<N; i++){
    Q[P[i]-1] = i+1;
  }
  for(int i=0; i<N; i++){
    cout << Q[i] << " ";
  }
}

Submission status: Runtime Error

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

classmate = [[0] * 2 for i in range(N)]

for i in range(len(number_classmate)):
    classmate[i][0] = number_classmate[i]
    classmate[i][1] = i+1
print(classmate)

classmate.sort(key=lambda s: s[0])

mapped_list = map(str, list(i[1] for i in classmate))
first_index = ' '.join(mapped_list)

print(first_index)

Submission status: Runtime Error

Solution code:
n = int(input())

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

queue = []

for i in range(n)
	a = ls[i] - 1
  	queue[a] = i

    
print(queue)

Submission status: Runtime Error

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