1375 - LCM Extreme

思路：

S(n)=sigama(LCM(n, i)) (1<=i<=n)

    =n*sigama(i/Gcd(n,i))

    =n*sigama(d|n{sigama(i|Gcd(n,i)=d)}/d)

而sigama(i){Gcd(n,i)=d}=d*sigama(i|Gcd(n/d,i)=1)

所以上式=n*sigama(d|n,sigama(i|Gcd(n/d,i)=1))

而sigama(i|Gcd(n/d,i)=1)=phi(n/d)/2*(n/d)(d!=n)

而d=n时上式显然等于1.

所以上式=n*(phi(n/d)/2*(n/d)(d!=n)+1(d==n))

        =n*(1+d*phi(d)/2)(d!=1)

#include <iostream>
#include <cstdio>
#define i64 unsigned long long
using namespace std;


int C,num=0;


const int MAX=3000005;
i64 f[MAX],s2[MAX];

void init()
{
    i64 i,j,p=1;
    f[1]=1;
    for(i=2;i<MAX;i++) if(!f[i]) for(j=i;j<MAX;j+=i)
    {
        if(!f[j]) f[j]=j;
        f[j]=f[j]/i*(i-1);
    }
    for(i=1;i<MAX;i++) for(j=i;j<MAX;j+=i) s2[j]+=i*f[i];
    for(i=1;i<MAX;i++)
    {
        if(i&1) f[i]=(1+s2[i])/2*i;
        else f[i]=i/2*(1+s2[i]);
        if(f[i]>=i) f[i]-=i;
        else f[i]=(p<<63)-i+f[i]+(p<<63);
    }
    for(i=1;i<MAX;i++) s2[i]=s2[i-1]+f[i];
}

int n;

int main()
{
    init();
    for(scanf("%d",&C);C--;)
    {
        scanf("%d",&n);
        printf("Case %d: %llu\n",++num,s2[n]);
    }
    return 0;
}