codeforces 136A Presents(水题)
来源:互联网 发布:炒股软件 编辑:程序博客网 时间:2024/05/18 00:33
点击打开题目
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 numberi 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.
The first line contains one integer n (1 ≤ n ≤ 100) — the quantity of friends Petya invited to the party. The second line containsn space-separated integers: the i-th number is pi — the number of a friend who gave a gift to friend numberi. 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.
Print n space-separated integers: the i-th number should equal the number of the friend who gave a gift to friend numberi.
42 3 4 1
4 1 2 3
31 3 2
1 3 2
21 2
1 2不多说,关键在于读题。代码:#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;}
- codeforces 136A Presents(水题)
- Presents(CodeForces 136A)
- CodeForces-136A-Presents
- CodeForces 136A Presents
- codeforces 136A Presents
- Codeforces 136A-Presents(题意)
- codeforces 136A(Presents) Java
- CodeForces 136 A.Presents(水~)
- Problem--136A--Codeforces--Presents
- 【CodeForces】669A - Little Artem and Presents(找规律)
- 136A - Presents
- CodeForces 669A Little Artem and Presents
- CodeForces 669A Little Artem and Presents
- 【CodeForces】669A - Little Artem and Presents
- 【CodeForces】[669A]Little Artem and Presents
- CodeForces 669A Little Artem and Presents
- codeforces 669A Little Artem and Presents
- A. Presents
- 标准C++中的string类的用法总结
- 小明的骰子(SDUT 2859)
- list_entry()详解
- android+mina 开发环境搭建
- winform网络编程之Socket类
- codeforces 136A Presents(水题)
- linux内核中常用的数据结构和操作详解
- Android HttpClient多线程
- Apple Swift 编程语言入门教程
- ICE同步调用与异步调用(1)
- 博客园app小项目有源码--在百度手机助手上线
- JQuery日记6.7 Javascript异步模型(二)
- 生活学习规划
- js格式化时间