For this Question: There is a function F defined as,
F(x) = GCD(1, x) + GCD(2, x) +. . + GCD(x, x)
Your task is to find F(x), for the given x.First line contain integer T denoting number of test cases.
Next t lines contain an integer x. 

Constraints 
1 <= T <= 20000
1 <= x <= 100000For each test case print F(n) in separate lineSample Input
5
1
2
3
4
5

Sample output
1
3
5
8
9, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {


































	static int getCount(int no)
{

    int result = no;
    for(int p = 2; p * p <= no; ++p)
    {
        if (no % p == 0)
        {
            while (no % p == 0)
                no /= p;
            result -= result / p;
        }
    }
    if (no > 1)
        result -= result / no;
    return result;
}
static int sumOfGCDofPairs(int n)
{
    int res = 0;

    for(int i = 1; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            int d1 = i;
            int d2 = n / i;
            res += d1 * getCount(n/d1);
            if (d1 != d2)
                res += d2 * getCount(n/d2);
        }
    }
    return res;
}
	public static void main (String[] args) throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int t=Integer.parseInt(br.readLine().trim());
		for(int T=0;T<t;T++)
		{

			int x=Integer.parseInt(br.readLine().trim());
			System.out.println(sumOfGCDofPairs(x));
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?