Presents

2023-10-14 17:40
文章标签 presents

本文主要是介绍Presents,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

文章目录

  • 一、 Presents
  • 总结


一、 Presents

本题链接:Presents

题目
A. Presents
time limit per test2 seconds
memory limit per test256 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 3

input
3
1 3 2
output
1 3 2

input
2
1 2
output
1 2

本博客给出本题截图
在这里插入图片描述
在这里插入图片描述

题意:输入n个数字,第i个数字代表第i个人把自己的礼物送给了谁,要求按位输出每一个人收到的是哪一个人送出的礼物

AC代码

#include <iostream>using namespace std;const int N = 110;int p[N], pre[N];int main()
{int n;cin >> n;for (int i = 1; i <= n; i ++ ){cin >> p[i];pre[p[i]] = i;}for (int i = 1; i <= n; i ++ )cout << pre[i] << ' ';return 0;
}

总结

水题,不解释

这篇关于Presents的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/212080

相关文章

ACM/STEPS find your presents(2)

整数的异或是先把它们化成二进制,再按位异或。比如3^5, 3=011,5=101,两数按位异或后为 110,即6。 几个数异或满足交换律。2^3^2=2^2^3=0^3=3. 两个相同的数异或为0,普通数都出现了偶数次,所以它们异或后都是0,而0与那个特别数异或后还是那个特殊数。 用的这样的运算后就看起来很简单了 #include <iostream> using namespace

codeforces 136A(Presents) Java

水题,提升必备!!! 注意不同操作系统中,换行符号不同: Windows:”\n” Linux:”\r\n” Mac OS:”\r” import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;impo

CF 793D Presents in Bankopolis

D. Presents in Bankopolis 一个有向图,节点“有序”,找一条长度为k的最短路径,额外要求是当前边不能“跃过”已经经过的节点。 起点的选择范围是[1,n]然后每经过一个点,下一个能到达的点的范围就会缩小,注意到总可以用一个连续的范围表示之,记为[l,r]。那么用dp解决,状态dp[l][r][k]表示可达范围是[l,r],已经走了k步。 貌似dp写成记忆化搜索更符合我的