Sequence Equation - HackerRank || HackerRank Sequence Equation Solution

#include <stdio.h>

int main()
{
    int n;
    scanf("%d", &n);
    int array[n], x[n];
    for (int i = 0; i < n; i++) scanf("%d", &array[i]);
    for (int i = 0; i < n; i++)
    {
        x[i] = i + 1;
        for (int j = 0; j < n; j++)
        {
            if (x[i] == array[j])
            {
                for (int k = 0; k < n; k++)
                {
                    if ((j + 1) == array[k]) printf("%d\n", (k + 1));
                }
            }
        }
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int array[n], x[n];
    for (int i = 0; i < n; i++) cin >> array[i];
    for (int i = 0; i < n; i++)
    {
        x[i] = i + 1;
        for (int j = 0; j < n; j++)
        {
            if (x[i] == array[j])
            {
                for (int k = 0; k < n; k++)
                {
                    if ((j + 1) == array[k]) cout << k + 1 << endl;
                }
            }
        }
    }
    return 0;
}

import java.util.Scanner;

public class Sequence_Equation {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] array = new int[n];
        int[] x = new int[n];
        for (int i = 0; i < n; i++) array[i] = input.nextInt();
        for (int i = 0; i < n; i++) {
            x[i] = i + 1;
            for (int j = 0; j < n; j++) {
                if (x[i] == array[j]) {
                    for (int k = 0; k < n; k++) {
                        if ((j + 1) == array[k]) System.out.println((k + 1));
                    }
                }
            }
        }
    }
}