CodeForces 136A Presents
来源:互联网 发布:翅片式换热器计算软件 编辑:程序博客网 时间:2024/05/10 10:23
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 from1 ton. Petya remembered that a friend numberi gave a gift to a friend numberpi. 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 contains n space-separated integers: thei-th number ispi — 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: thei-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
题目不难 看懂就可以,将给定的数排序,然后按顺序输出每个数在输入时的序号。
结构体排序就可以。
AC代码:
#include <iostream>#include <stdio.h>#include <math.h>#include <string.h>#include <algorithm>using namespace std;struct shu{ int num,order;}s[105];int cmp(shu a,shu b){ return a.num<b.num;}int main(){ int i,n,num[105],order[105]; while(~scanf("%d",&n)) { for(i=0;i<n;i++) { scanf("%d",&s[i].num); s[i].order=i; } sort(s,s+n,cmp); for(i=0;i<n-1;i++) { printf("%d ",s[i].order+1); } printf("%d\n",s[n-1].order+1); } return 0;}
- CodeForces-136A-Presents
- CodeForces 136A Presents
- codeforces 136A Presents
- Presents(CodeForces 136A)
- Problem--136A--Codeforces--Presents
- codeforces 136A Presents(水题)
- Codeforces 136A-Presents(题意)
- codeforces 136A(Presents) Java
- CodeForces 136 A.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
- 【CodeForces】669A - Little Artem and Presents(找规律)
- 线性规划与网络流24——数字梯形问题
- bzoj2668 [cqoi2012]交换棋子
- Home键的广播监听
- java 并发概念与内存分析,原子性、可见性、有序性
- final修饰符
- CodeForces 136A Presents
- php类面向对象学习笔记
- Growth of a Population
- 在慕课上学习的,HTML和CSS基础学习笔记6
- javascript 学习1
- 41、检查重复字符串
- 图论 [未完成 待续~待修改]
- 开源框架(android)
- C++调用Python浅析