ACJoy A Presents
2016-02-27 20:19
633 查看
A B C D E F G H I J
A - Presents
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
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 nspace-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 Input
Input
Output
Input
Output
Input
Output
交换礼物, 排一下编号。
代码:#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10000 + 100;
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
int *a = new int[n+10];
memset(a, 0, sizeof(a));
int tmp;
int cnt = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d", &tmp);
a[tmp] = ++cnt;
}
for(int i = 1; i < n; i++)
{
printf("%d ", a[i]);
}
printf("%d\n", a
);
}
return 0;
}
A - Presents
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
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 nspace-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 Input
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
交换礼物, 排一下编号。
代码:#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 10000 + 100;
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
int *a = new int[n+10];
memset(a, 0, sizeof(a));
int tmp;
int cnt = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d", &tmp);
a[tmp] = ++cnt;
}
for(int i = 1; i < n; i++)
{
printf("%d ", a[i]);
}
printf("%d\n", a
);
}
return 0;
}
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C++联合体转换成C#结构的实现方法
- C++高级程序员成长之路
- C++编写简单的打靶游戏
- C++ 自定义控件的移植问题
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- 使用Lua来扩展C++程序的方法
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例
- C与C++之间相互调用实例方法讲解
- 解析C++中派生的概念以及派生类成员的访问属性