A New Function - LightOJ 1098 - Virtual Judgehttps://vjudge.net/problem/LightOJ-1098#author=0
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
#if 0
//整除分块
int main() {
int ans = 0;
for (int l = 1, r; l <= n; l = r + 1) {
r = n / (n / l);
ans += n / l * (l * (r - l + 1));
}
return 0;
}
#endif
ll n;
inline void solve() {
// ll n;
ll ans = 0;
for (ll l = 2, r; l <= n; l = r + 1) {
r = n / (n / l);
ans += (l + r) * (r - l + 1) / 2 * (n / l - 1);
}
printf("%lld\n", ans);
}
int main() {
int t;
scanf("%d", &t);
int cas = 0;
while (t--) {
scanf("%lld", &n);
printf("Case %d: ", ++cas);
solve();
}
return 0;
}