For this Question: Given a pair product array pairProd[] containing positive integers of size K. Your task is to find the original array from given product array. A pair-product array for an array is the array that contains product of all pairs in ordered form.
For example: The product array for {a,b,c} will be {a*b, a*c, b*c}The input line contains T, denoting the number of testcases. Each testcase contains two lines. The first line contains K size of pair product array and second line contains elements of pair product array i.e. pairProd[i] separated by space.

Constraints:
1 <= T <= 100
3 <= K <= 10000
1 <= pairProd[i] <= 10000For each testcase print the original array separated by space in new line.Sample Input:
2
6
6 8 16 12 24 32
3
3 11 33

Sample Output:
2 3 4 8
1 3 11

Explanation:
Testcase 2: Elements of product array from the original array will be: 1*3, 1*11, 3*11., I have written this Solution Code: import java.util.*;
import java.lang.*;
import java.io.*;

class Main
 {
	static void extractOriginal(int a[],int b[],int n2)
	{
	    b[0] =(int)Math.sqrt((a[0]*a[1])/a[n2-1]);
	    for(int i=1;i<n2;i++)
	    {
	        b[i]=a[i-1]/b[0];
	    }
	    
	}
	public static void main (String[] args)
	 {
	 //code
	 Scanner scan=new Scanner(System.in);
	 int t=scan.nextInt();
	 for(int j=0;j<t;j++)
	 {
	    int n1=scan.nextInt();
	    int a[]=new int[n1];
	    
	    for(int i=0;i<n1;i++)
	    {
	     a[i]=scan.nextInt();
	    } 
	    int n2=(int)(1+Math.sqrt(1-4*1*(-2*n1)))/2;
	    int b[]=new int[n2];
	   extractOriginal(a,b,n2);
	   for(int k=0;k<n2;k++)
	   {
	       System.out.print(b[k]+" ");
	   }
	   System.out.println();
	   }
	 }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?