codeforces 136A Presents(水题)
2014-06-06 20:54
120 查看
A. Presents
点击打开题目
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
Input
Output
Input
Output
Input
Output
[/code]
点击打开题目
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.
Sample test(s)
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 不多说,关键在于读题。 代码: [code]#include <iostream> #include<memory.h> using namespace std; int main() { int a[110],b[110],n,count1,i; while(cin>>n) { count1=0; memset(b,0,sizeof(b)); for(i=0; i<n; i++) { cin>>a[i]; b[a[i]]=i+1; } for(i=0; i<110; i++) { if(b[i]!=0) { if(count1==n-1) { cout<<b[i]<<endl; break; } cout<<b[i]<<" "; count1++; } } } return 0; }
[/code]
相关文章推荐
- Presents(CodeForces 136A)
- Problem--136A--Codeforces--Presents
- codeforces 136A Presents
- CodeForces 136A Presents
- Codeforces 136A-Presents(题意)
- Codeforces 413A Data Recovery(水题)
- codeforces水题100道 第十题 Codeforces Round #277 (Div. 2) A. Calculating Function (math)
- codeforces水题100道 第二十题 Codeforces Round #191 (Div. 2) A. Flipping Game (brute force)
- codeforces 50A Domino piling(数学水题)
- codeforces 119A Epic Game(模拟水题)
- Codeforces 734A Anton and Danik(水题,没参加晚上零点场)
- codeforces 701A A. Cards(水题)
- Codeforces 632A Grandma Laura and Apples 【水题】
- 【codeforces 483B】Friends and Presents
- Codeforces 451B Sort the Array(水题)
- codeforces 702B B. Powers of Two(水题)
- 【水题】CodeForces - 233A Perfect Permutation
- Codeforces 637A Voting for Photos 【水题】
- Codeforces 459B Pashmak and Flowers(水题)
- Codeforces 588B Duff in Love【暴力】水题