多校hdu FSF’s game 4944

Problem Description
FSF has programmed a game.
In this game, players need to divide a rectangle into several same squares.
The length and width of rectangles are integer, and of course the side length of squares are integer.


After division, players can get some coins.
If players successfully divide a AxB rectangle(length: A, width: B) into KxK squares(side length: K), they can get A*B/ gcd(A/K,B/K) gold coins.
In a level, you can’t get coins twice with same method. 
(For example, You can get 6 coins from 2x2(A=2,B=2) rectangle. When K=1, A*B/gcd(A/K,B/K)=2; When K=2, A*B/gcd(A/K,B/K)=4; 2+4=6; )


There are N*(N+1)/2 levels in this game, and every level is an unique rectangle. (1x1 , 2x1, 2x2, 3x1, ..., Nx(N-1), NxN)


FSF has played this game for a long time, and he finally gets all the coins in the game.
Unfortunately ,he uses an UNSIGNED 32-BIT INTEGER variable to count the number of coins.
This variable may overflow.
We want to know what the variable will be.
(In other words, the number of coins mod 2^32)
 


Input
There are multiply test cases.


The first line contains an integer T(T<=500000), the number of test cases


Each of the next T lines contain an integer N(N<=500000).
 


Output
Output a single line for each test case.


For each test case, you should output "Case #C: ". first, where C indicates the case number and counts from 1. 


Then output the answer, the value of that UNSIGNED 32-BIT INTEGER variable. 
 


Sample Input
3
1
3
100
 


Sample Output
Case #1: 1
Case #2: 30
Case #3: 15662489


HintIn the second test case, there are six levels(1x1,1x2,1x3,2x2,2x3,3x3)
Here is the details for this game:
1x1: 1(K=1); 1x2: 2(K=1); 1x3: 3(K=1);  2x2: 2(K=1), 4(K=2); 2x3: 6(K=1); 3x3: 3(K=1), 9(K=3); 

1+2+3+2+4+6+3+9=30 

给定一个整数n，求∑j=1nf(n,j)。其中f(i,j)=i∗jgcd(i/k,j/k)(k为i,j的公因子)

对于∑j=1nf(n,j)而言，我们用aj(1<=j<=n)表示gcd(n/k,j/k)所能取到的值的集合，
那么∑j=1nf(n,j)=(n∗1/a1+n∗2/a2+⋯+n∗n/an)=n∗(1/a1+2/a2+⋯+n/an),注意aj中的值一定是n的因子。
所以我们就可以枚举n的因子m，1m,2m...n，可以得到哪些aj中包含因子m
sum(m) = (1m / m) + (2m / m) + ... + (n / m) = (1 + n / m) * (n / m) / 2
所以∑j=1n=∑m为n的因子nsum(m)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int MAXN = 500000;
const __int64 MOD = (__int64)1 << 32;

__int64  ans[MAXN + 5], sum[MAXN + 5];
int n;

void init()
{
    __int64 i,j;
    memset(ans, 0, sizeof(ans));
    memset(sum , 0, sizeof(sum));
    for (i = 1; i <= MAXN; i++)
        for (j = i; j <= MAXN; j += i)
            sum[j] += (j / i + 1) * (j / i) / 2;
    for (i = 1; i <= MAXN; i++)
    {
        ans[i] = ans[i - 1] + sum[i] * i;
        ans[i] %= MOD;
    }
}

int main()
{
    int t = 1, cas;
    init();
    scanf("%d", &cas);
    while (cas--)
    {
        scanf("%d", &n);
        printf("Case #%d: %I64u\n", t++, ans[n]);
    }
    return 0;
}