Codeforces Beta Round #97 (Div. 2), problem: (A) Presents solution

Codeforces Beta Round #97 (Div. 2), problem: (A) Presents: http://codeforces.com/problemset/problem/136/A

Codeforces Beta Round #97 (Div. 2), problem: (A) Presents editorial: http://codeforces.com/blog/entry/3353

Codeforces Beta Round #97 (Div. 2), problem: (A) Presents solution: http://ideone.com/c1Tez1

#include <iostream>
#include <cstdio> 
#include <map>
using namespace std;

int main() {
    int n, a;
    map <int, int> p;
    scanf("%d", &n);
    for(int i=1; i<=n; i++) scanf("%d", &a), p[a]=i;
    for(int i=1; i<=n; i++) printf("%d ", p[i]);
    return 0;
}