zoukankan      html  css  js  c++  java
  • A

    Problem 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 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(n表示编号从1到n的学生总数)个数,第i个数表示编号为i的学生送礼物给编号为j的学生,要求输出编号为j的学生收到那个送他礼物的学生编号i,水过!
    AC代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4     int n,x,t[105];
     5     cin>>n;
     6     for(int i=1;i<=n;++i){cin>>x;t[x]=i;}
     7     for(int i=1;i<=n;++i)
     8         cout<<t[i]<<(i==n?"
    ":" ");
     9     return 0;
    10 }
     
  • 相关阅读:
    Rust 总章
    GO 总章
    vue引入d3
    echarts地图修改高亮颜色及区域界线颜色
    vue+element 树形穿梭框组件
    element表格上下固定,内容高度自适应
    echarts在dialog弹框中不显示的解决方案
    echarts 饼图给外层加边框
    selenium等待元素出现
    Pycharm永久激活
  • 原文地址:https://www.cnblogs.com/acgoto/p/9149986.html
Copyright © 2011-2022 走看看