For this Question: Given a positive integer n. The task is to find the sum of product of all possible pairs of (x, y) where x and y will be represented as such y = floor(n/x), x varies from 1 to n.The first line of input contains an integer T. Each test case contains an integer N.

Constraints:
1 <= T <= 100
1 <= N <= 10^6For each test case in a new line print the required output.Input:
2
5
10

Output:
21
87

Explanation:
Testcase 1:
Following are the possible pairs of (x, y): (1, 5), (2, 2), (3, 1), (4, 1), (5, 1).
So, 1*5 + 2*2 + 3*1 + 4*1 + 5*1 
   = 5 + 4 + 3 + 4 + 5 
   = 21., I have written this Solution Code: import java.io.*;
import java.util.*;
import java.math.*;

class Main {
	public static void main (String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t=Integer.parseInt(br.readLine());
        while(t!=0){
            int n=Integer.parseInt(br.readLine());
            long res=0;
            for(int i=1;i<=n;i++){
                res=res+(i*(int)Math.floor(n/i));
            }
            System.out.println(res);
            t--;
        }

	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?