我是靠谱客的博主 无情信封,最近开发中收集的这篇文章主要介绍codeforces 136A Presents(水题),觉得挺不错的,现在分享给大家,希望可以做个参考。

概述

A. Presents
点击打开题目
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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.

Sample test(s)
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<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(水题)的全部内容,希望文章能够帮你解决codeforces 136A Presents(水题)所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错,欢迎将靠谱客网站推荐给程序员好友。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(60)

评论列表共有 0 条评论

立即
投稿
返回
顶部