Sequence Equation

                            Solution in C :

python 3  :

n = int(input())
ps = [int(x) for x in input().split()]

for x in range(1, n+1):
    for y in range(n):
        if ps[ps[y]-1] == x:
            print(y+1)
            break











Java  :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    public static void main(String args[] ) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int arr[]=new int[n];
        for(int i = 0 ;i<n;i++)
            arr[i]=sc.nextInt();
        for(int i = 0 ;i<n;i++)
            {
            int pos = 0;
            for(int j = 0 ; j<n;j++)
                {
                if(arr[j]==i+1)
                {
                pos = j+1 ;
                    break;
                }
              }
            int pos1=0;
            for(int j = 0 ; j<n;j++)
                {
                if(arr[j]==pos)
                {
                pos1 = j ;break;
            }
            }
            System.out.println(pos1+1);
        }
    }
}












C ++  :

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int, int> II;

int main() {
    #ifdef LOCAL
        freopen("Data.inp", "r", stdin);
        freopen("Data.out", "w", stdout);
    #endif

    int n, a[100];
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) if (a[a[j]] == i) {
            cout << j << endl;
            break;
        }
    }

    return 0;
}










C  :

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int i,n,a[100],j;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(j=1;j<=n;j++)
        {
        for(i=1;i<=n;i++)
            if(a[a[i]]==j)
            break;
            printf("%d\n",i);
    }
    return 0;
}