HackerRank Sequence Equation Solution

#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;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
#ifdef ONPC
    freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
#else
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector <int> p(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> p[i];
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (p[p[j]] == i)
            {
                cout << j << endl;
                break;
            }
        }
    }
}

import java.io.*;
import java.util.*;
class Main {
	InputReader in;
	PrintWriter out;
	void main() {
		int n = in.nextInt();
		int nxt[] = new int[n];
		for (int i = 0; i < n; ++i) {
			int y = in.nextInt();
			nxt[--y] = i;
		}
		for (int i = 0; i < n; ++i)
			out.println(nxt[nxt[i]] + 1);
	}
	
	public static void main(String[] args) {
		new Main();
	}
	public Main() {
		in = new InputReader(System.getProperty("ONLINE_JUDGE") != null ? null : "main.inp");
		out = new PrintWriter(System.out);
		main();
		out.close();
	}
	class InputReader {
		BufferedReader bf;
		StringTokenizer st = null;
		
		InputReader(String filename) {
			try {
				bf = new BufferedReader(filename == null
					? new InputStreamReader(System.in)
					: new FileReader(filename)
				);
			} catch (IOException e) {
				e.printStackTrace();
				System.err.println("use stdin instead");
				bf = new BufferedReader(new InputStreamReader(System.in));
			}
		}
		
		String nextString() {
			try {
				while (st == null || !st.hasMoreTokens())
					st = new StringTokenizer(bf.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			return st.nextToken();
		}
	
		long nextLong() {return Long.parseLong(nextString());}
		int nextInt() {return Integer.parseInt(nextString());}
		double nextDouble() {return Double.parseDouble(nextString());}
	}
}

rr = raw_input
rrM = lambda: map(int, rr().split())
N = int(rr())
A = rrM()
A = [x-1 for x in A]
B = [0] * N
for i,u in enumerate(A):
    B[i] = A[u]
C = [0]*N
for i,u in enumerate(B):
    C[u] = i+1
for x in C:
    print x

function processData(input) {
    var lines = input.split("\n");
    var data = lines[1].split(' ').map(Number);
    var all = {};
    for(var i=0;i<data.length;i++){
        all[data[i]] = i+1;
    }
    for(var i=1;i<=data.length;i++){
        console.log(all[all[i]]);
    }
}
process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});
process.stdin.on("end", function () {
    processData(_input);
});

// main method in "Solution" will be run as your answer
object Solution {
    def main(args: Array[String]) {
        //Enter your code here. Read input from STDIN. Print output to STDOUT
            val n = io.StdIn.readLine().toInt
    val px = io.StdIn.readLine().split(" ").toList.map(_.toInt)
    val revP = px.zip(1 to n).toMap
    (1 to n) map(revP) map(revP) foreach(println)
    }
}

VAR i,n,j,l:integer; a:array[1..50] of integer;
Begin
Readln(n);
for i:=1 to n do
Begin
Read(a[i]);
end;
for i:=1 to n do
Begin
for j:=1 to n do
Begin
if i = a[j] then Begin
for l:=1 to n do
Begin
if a[l] = j then Writeln(l);
end;
end;
end;
end;
Readln;
END.