数论基础1010 UVA 11426

题意:
求sigma(sigma(gcd(i,j))|(i < j < =n))|(1 <= i < n)

思路:
Ans(i)=Ans(i-1)+Sum(i)
Sum(i)=Gcd(i,1)+Gcd(i,2)+…Gcd(i,i-1)
Sum(i)=对于i的因子t,Gcd(i,x)=t的对数有phi(i/t)
Sum(i)=sigma(phi(i/t)*t)|(i|t)
然后我们可以枚举因子来统计每个Sum(i)

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) (x&(-x))
typedef long long LL;
const int maxn = 4000005;
const int inf=(1<<28)-1;
#define maxp 4000005
bool notprime[maxp];
int phi[maxp];
void get_phi()
{
    notprime[1]=true;
    for(int i=1;i<maxp;++i)
    phi[i]=1;
    for(int i=2;i<maxp;++i)
    if(!notprime[i])
    {
        phi[i]*=i-1;
        for(int j=i+i;j<maxp;j+=i)
        {
            notprime[j]=true;
            int n=j/i;
            phi[j]*=i-1;
            while(n%i==0)
            {
                n/=i;
                phi[j]*=i;
            }
        }
    }
}
LL Sum[maxn],Ans[maxn];
int main()
{
    get_phi();
    memset(Sum,0,sizeof(Sum));
    for(int i=1;i<maxn;++i)
     for(int j=i+i;j<maxn;j+=i)
     Sum[j]+=i*phi[j/i];
    Ans[1]=0;
    for(int i=2;i<maxn;++i)
    Ans[i]=Ans[i-1]+Sum[i];
    int n;
    while(~scanf("%d",&n)&&n)
    {
        printf("%lld\n",Ans[n]);
     }
    return 0;
}