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: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

int p[N];

signed main() {
	IOS;
	int t;	cin >> t;
	while(t--){
		int ans = 0;
		int n;	cin >> n;
		for(int i = 1; i <= n; i++){
			ans += i*(n/i);
		}
		cout << ans << endl;
	}
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?