A. Presents

A. Presents

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Little Petya very much likes gifts. Recently he has received a new laptop as a New Year gift from his mother. He immediately decided to give it to somebody else as what can be more pleasant than giving somebody gifts. And on this occasion he organized a New Year party at his place and invited n his friends there.

If there’s one thing Petya likes more that receiving gifts, that’s watching others giving gifts to somebody else. Thus, he safely hid the laptop until the next New Year and made up his mind to watch his friends exchanging gifts while he does not participate in the process. He numbered all his friends with integers from 1 to n. Petya remembered that a friend number i gave a gift to a friend number pi. He also remembered that each of his friends received exactly one gift.

Now Petya wants to know for each friend i the number of a friend who has given him a gift.

Input
The first line contains one integer n (1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party. The second line contains n space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend number i. It is guaranteed that each friend received exactly one gift. It is possible that some friends do not share Petya’s ideas of giving gifts to somebody else. Those friends gave the gifts to themselves.

Output
Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend number i.

Examples
input
4
2 3 4 1
output
4 1 2 3
input
3
1 3 2
output
1 3 2
input
2
1 2
output
1 2

问题链接：A. Presents.

问题简述：

第一行：输入n (1 ≤ n ≤ 100)（有n个人）
第二行：输入n个数，代表每个人把礼物给了谁。
请按次序输出这个人收到了谁的礼物。

问题分析：

简单的问题，用两个数组即可解决。

程序说明：

AC通过的C语言程序如下：

#include<iostream>
using namespace std;

int main()
{
	int n,a[100];
	cin>>n;
	for(int i = 0;i<n;i++)
	{
		cin>>a[i]; 
	}
	int b[100];
	for(int i = 0;i<n;i++)
	{
		b[a[i]-1] = i+1;//反过来
	}
	for(int i = 0;i<n-1;i++)
	{
		cout<<b[i]<<" ";
	}
	cout<<b[n-1];
	return 0;
}