For this Question: A tuple (R, G, B) is considered good if R*G+B <= N and R, G and B are all positive. Given N, find number of good tuples.Input contains a single integer N.

Constraints:
1 <= N <= 1000000Print number of good tuples.Sample Input
3

Sample Output
4

Explanation:
Following are the good tuples:
(1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(2, 1, 1), I have written this Solution Code: import java.util.*;
import java.io.*;
class Main{
	public static void main(String[] args)throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int n=Integer.parseInt(br.readLine());
		long count=0;
		for(int i=1;i<n;i++){
			int t=n-i;
			while(t>=1){
				count+=t;
				t=t-i;
			}
		}
		System.out.println(count);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?