


1. X and Y should be greater than 0.
2. (X, Y) and (Y, X) are considered different solutions if X is not equal to Y, i.e. (X, Y) and (Y, X) will not be distinct if X=Y.
The first line of the input contains an integer 'T' denoting the number of test cases.
The first and only line of each test case consists of a single positive integer 'N'.
For each test case, print an integer that denotes the count of the number of pairs satisfying the equation in a new line.
The output of each test case should be printed in a separate line.
You don't have to print anything. It has already been taken care of. Just Implement the given function.
1 <= T <= 100
1 <= N <= 10^4
Where 'T' is the number of test cases, and 'N' is the given integer.
Time Limit: 1 sec.
E.g. For N = 6, Y values will lie in the range(N+1, N*N+N) ie. in range(7, 42).
Now, Y-N will be factor N*N for Y values in the set {7, 8, 9, 10, 12, 15, 18, 24, 42}.
For Y values in this set, we can get corresponding X values as {42, 24, 18, 15, 12, 10, 9, 8, 7}. So we have 9 (X, Y) pairs for which the given equation can be satisfied.
E.g. For N = 6, Y values will lie in the range(N+1, N*N+N) ie. in range(7, 42).
Now, factors for N*N will be {1, 2, 3, 4, 6, 9, 12, 18, 36}. With the help of these factors, we can get Y values which is nothing but Factor + N. Hence required Y values will be {7, 8, 9, 10, 12, 15, 18, 24, 42} and corresponding X values will be
{42, 24, 18, 15, 12, 10, 9, 8, 7}. This way, we have 9 (X, Y) pairs that satisfy the given equation.
Pair Product Div by K
Pair Product Div by K
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Co-Prime
First Digit One
Special Digit Numbers