Codeforces-136A A. Presents

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
问题链接:
http://codeforces.com/problemset/problem/136/A
问题简述:
首先输入n代表你接下来要输入多少个数,之后输入相应数量的数 数字代表要送给第几个人 最后输出送完之后的结果
问题分析:
比如2 3 4 1,就是1送给2,2送给3,3送给4 ,4送给1 最后就是4,1,2,3,可以理解为数字互送
代码:

#include<iostream>
using namespace std;
int main()
{
	int n,a[102],b[102];
	cin >> n;
	for(int i=1;i<=n;i++)
	{
		cin >> a[i];
		if (i == a[i]) b[i] = i;
		if (i != a[i])  b[a[i]] = i; 
	}
	for (int j = 1; j < n; j++)
		cout << b[j] <<" ";
	    cout << b[n];
	return 0;
}

版权声明:本文为weixin_44013946原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。