#欧拉函数#SPOJ 5971 BZOJ 2226 LCMSUM

题目

求${\sum }_{i=1}^{n}lcm(n,i)$

---

分析

$$=\sum _{i=1}^n\frac{ni}{gcd(n,i)}$$
$$=n\sum _{d|n}\sum _{i=1}^n\frac{i}{d}[gcd(n,i)==d])$$
$$=n\sum _{d|n}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }i[gcd(n,id)==d]$$
$$=n\sum _{d|n}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }i[gcd(\frac{n}{d},i)==1]$$
$$=n\sum _{d|n}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }i[gcd(d,i)==1]=n\sum _{d|n}\frac{\phi (n)n}{2}$$
时间复杂度$O(nlogn)$

---

代码

#include <cstdio>
#include <cctype>
#define rr register
using namespace std;
const int N=1000001;
long long ans[N]; int phi[N];
inline signed iut(){
    rr int ans=0; rr char c=getchar();
    while (!isdigit(c)) c=getchar();
    while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
    return ans;
}
inline void print(long long ans){
	if (ans>9) print(ans/10);
	putchar(ans%10+48); 
}
signed main(){
	for (rr int i=1;i<N;++i) phi[i]=i;
	for (rr int i=2;i<N;++i) if (phi[i]==i)
	for (rr int j=i;j<N;j+=i)
	    phi[j]=1ll*phi[j]*(i-1)/i;
	for (rr int i=1;i<N;++i)
	for (rr int j=i;j<N;j+=i)
	    ans[j]+=i==1?1:(1ll*phi[i]*i>>1);
	for (rr int i=1;i<N;++i) ans[i]=ans[i]*i;
	for (rr int t=iut();t;--t)
		print(ans[iut()]),putchar(10);
}