[bzoj2226][SPOJ5971]LCMSUM

2226: [Spoj 5971] LCMSum

Time Limit: 20 Sec Memory Limit: 259 MB
Submit: 949 Solved: 427
[Submit][Status][Discuss]
Description

Given n, calculate the sum LCM(1,n) + LCM(2,n) + .. + LCM(n,n), where LCM(i,n) denotes the Least Common Multiple of the integers i and n.
Input

The first line contains T the number of test cases. Each of the next T lines contain an integer n.
Output

Output T lines, one for each test case, containing the required sum.
Sample Input

3

1

2

5

Sample Output

1

4

55

HINT

Constraints

1 <= T <= 300000
1 <= n <= 1000000

首先我们先化简一下式子：

$$\sum_{i=1}^{n}lcm(i,n)$$
$$\sum_{i=1}^{n}\frac{i*n}{gcd(i,n)}$$
$$n*\sum_{i=1}^{n}\frac{i}{gcd(i,n)}$$
$$n*\sum_{d|n}\sum_{i=1}^{n}\frac{i}{d}(gcd(i,n)==d)$$
$$n*\sum_{d|n}\sum_{j=1}^{\frac{n}{d}}j(gcd(i,\frac{n}{d})==1)(j=\frac{i}{d})$$
$$n*\sum_{d|n}\sum_{j=1}^{d}j(gcd(i,d)==1)(\frac{n}{d}和d等价)$$
$$令f[i]=\sum_{i=1}^{d}i(gcd(i,d)==1)$$
f[i]就表示1~d中与i互质的数的和。怎样去求f[i]呢？
首先如果gcd(x,n)==1,那么gcd(n-x,n)==1
证明：如果gcd(n-x,n)=d(d!=1) 那么n-x=d(n1-x1),那么gcd(x,n)=d>1所以得证。
根据上面的这个性质，我们就可以将与d互质的数分为x和d-x两部分。因因为x+d-x=d，所以
$$f[i]=\sum_{i=1}^{d}i(gcd(i,d)==1)=\frac{d*phi[d]}{2}$$
$$ans=\sum_{d|n}\frac{d*phi[d]}{2}$$

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int N=1000010;
#define LL long long
int n,T,phi[N];
inline void prepare(){
    int i,j;
    phi[1]=1;
    for(i=2;i<=N;++i)
      if(!phi[i])
        for(j=i;j<=N;j+=i){
            if(!phi[j]) phi[j]=j;
            phi[j]=phi[j]/i*(i-1);
        }
}
inline void calc(int x){
    int i;
    LL ans=0;
    for(i=1;i<=sqrt(x);++i)
      if(!(x%i)){
        if(i!=1) ans+=(LL)i*(LL)phi[i]/2;
        else ans+=1;
        if(x/i!=i) ans+=(LL)(x/i)*(LL)phi[x/i]/2;
      }
    printf("%lld\n",ans*(LL)(x));
}
int main(){
    prepare();
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        calc(n);
    }
}