GCD - Extreme (II) UVA - 11426

GCD - Extreme (II) UVA - 11426

点击

参考代码

const int MAXN = 4000001;
LL Phi[MAXN];
void Euler(void)//首先欧拉函数打表
{
    for(int i  = 1;i < MAXN; ++i)
        Phi[i] = i;
    for(int i = 2;i < MAXN; ++i)
    {
        if(Phi[i]==i)
        {
            for(int j = i;j < MAXN; j += i)
            {
                Phi[j] = Phi[j]/i*(i-1);
            }
        }
    }
}
LL Ans[MAXN];
void init(void)//对答案打表
{
    for(int i = 2;i < MAXN; ++i)
    {
        for(int k = 1; k*i < MAXN; k++)
        {
            Ans[k*i] += k*Phi[i];
        }
    }
    for(int i = 3;i < MAXN; ++i)
       Ans[i] += Ans[i-1];
}
int main(void)
{
    std::ios::sync_with_stdio(false);

    Euler();
    init();
    LL n;
    while(cin>>n&&n)
    {
       cout<<Ans[n]<<endl;
    }
    return 0;
}