HDU 4944 FSF’s game 规律题

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define mod 4294967296
#define N 500010
typedef long long ll;
ll dp
, gc
;
void go(){
    memset(gc, 0, sizeof gc);
    for(ll i = 1; i < N; i++)
    {
        for(ll j = i; j < N; j+=i)
        {
            gc[j] += (j/i+1)*(j/i)/2;
            gc[j] %= mod;
        }
    }
}

int main() {
    go();
    dp[1] = 1;
    for(ll i = 2; i < N; i++)dp[i] = dp[i-1] + gc[i]*i, dp[i] %= mod;
    int T, Cas = 1, n; scanf("%d", &T);
    while(T-- > 0) {
        scanf("%d",&n);
        printf("Case #%d: ",Cas++);
        cout<<dp
<<endl;
    }
    return 0;
}