#欧拉函数，整除分块#洛谷 1447 JZOJ 2225 能量采集

题目

$$\sum _{i=1}^n\sum _{j=1}^{m}2\times gcd(i,j)-1$$

---

分析

原式=$$2\times (\sum _{i=1}^n\sum _{j=1}^{m}gcd(i,j))-nm$$
重点就是${\sum }_{i=1}^n{\sum }_{j=1}^{m}gcd(i,j)$
$$=\sum _{i=1}^n\sum _{j=1}^m\sum _{k|gcd(i,j)}\phi (k)(欧拉定理)$$
$$=\sum _{i=1}^n\sum _{j=1}^m\sum _{k|i,k|j}\phi (k)$$
$$=\sum _{k=1}^{min(n,m)}\phi (k)\lfloor \frac{n}{k}\rfloor \lfloor \frac{m}{k}\rfloor$$
那么原式$$=2\times \sum _{k=1}^{min(n,m)}\phi (k)\lfloor \frac{n}{k}\rfloor \lfloor \frac{m}{k}\rfloor -nm$$
那么就可以用整除分块求解，然而也快不了多少

---

代码

#include <cstdio>
#define rr register
#define min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
ll n,m,t,ans,phi[100001],v[100001],prime[10001],cnt;
inline void init(int N){
    phi[1]=1;
    for (rr int i=2;i<=N;++i){
        if (!v[i]) phi[i]=(prime[++cnt]=v[i]=i)-1;
        for (rr int j=1;j<=cnt&&prime[j]*i<=N;++j){
            v[i*prime[j]]=prime[j];
            if (i%prime[j]) phi[i*prime[j]]=phi[i]*(prime[j]-1);
                else {phi[i*prime[j]]=phi[i]*prime[j]; break;}
        }
    }
    for (rr int i=2;i<=N;++i) phi[i]+=phi[i-1];
}
signed main(){
    scanf("%lld%lld",&n,&m);
    init(t=min(n,m));
    for (rr ll l=1,r;l<=t;l=r+1){
        r=min(n/(n/l),m/(m/l));
        ans+=(phi[r]-phi[l-1])*(n/l)*(m/l);
    }
    printf("%lld",2*ans-n*m);
    return 0;
}