Teacher(Contest)
Teacher easy Time Limit: 2 sec Memory Limit: 128000 kB
Last updated
Teacher easy Time Limit: 2 sec Memory Limit: 128000 kB
Last updated
Problem Statement :
Tom 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 Tom's record, there were Ai 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. Input Input is given from Standard Input in the following format: First line contains a single integer N the array length and the second line contains elements of the array
Constraints 1 ⤠N ⤠10000 1 ⤠Ai ⤠N Ai ā Aj if (iā j) Output Print the student numbers of the students in the order the students entered the classroom. Example Sample Input 3 2 3 1
Sample Output 3 1 2
Explanation:- First, student number 3 entered the classroom. Then, student number 1 entered the classroom. Finally, student number 2 entered the classroom.
Sample Input: 5 5 4 3 2 1
Sample Output: 5 4 3 2 1
link: