Problem--136A--Codeforces--Presents
来源:互联网 发布:中电云集 php版本太低 编辑:程序博客网 时间:2024/05/20 22:41
Presents
time limit per test:2 seconds
memory limit per test:256 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 3input
3
1 3 2
output
1 3 2input
2
1 2
output
1 2
#include<stdio.h>int main(){ int n; scanf("%d",&n); int num[n],t; for(int i=1; i<=n; i++) { scanf("%d",&t); num[t]=i; } for(int i=1; i<=n; i++) printf("%d ",num[i]);}
- Problem--136A--Codeforces--Presents
- CodeForces-136A-Presents
- CodeForces 136A Presents
- codeforces 136A Presents
- Presents(CodeForces 136A)
- 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(找规律)
- 空间金字塔池化 Spatial Pyramid Pooling in Deep Convolutional Networks for Visual Recognition
- replace()结合正则表达式
- 用自己的域名重定向到csdn博客首页
- 安卓实现自定义View的三种方式
- HDU 5714 树状数组 + 离散化
- Problem--136A--Codeforces--Presents
- pandas数据样本行列选取
- 使用http的post方式与网络交互通信
- 关于从相机界面返回上一级页面出现黑屏的问题
- 自己模拟二级弹窗(附源码)
- 韩信点兵
- 千锋学员自述学习Hadoop历程
- Android材料设计动画之触摸反馈
- HDFS的理论学习笔记