赞
踩
本题链接: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
本博客给出本题截图:
题意:输入n
个数字,第i
个数字代表第i
个人把自己的礼物送给了谁,要求按位输出每一个人收到的是哪一个人送出的礼物
AC代码
#include <iostream> using namespace std; const int N = 110; int p[N], pre[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i ++ ) { cin >> p[i]; pre[p[i]] = i; } for (int i = 1; i <= n; i ++ ) cout << pre[i] << ' '; return 0; }
水题,不解释
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。