UVA11426 GCD - Extreme (II) --- 欧拉函数

最新推荐文章于 2023-01-26 22:23:01 发布

十一号路口。

最新推荐文章于 2023-01-26 22:23:01 发布

阅读量113

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/lmhlmh_/article/details/100116607

版权

数论专栏收录该内容

28 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 4000000;
ll s[maxn+10],f[maxn+10];
int phi[maxn+10];


int main() {
    phi[1] = 1;
    for(int n = 2;n <= maxn;n++) {
        phi[n] = n;
        int t = n;
        int m = (int)sqrt(n+0.5);
        for(int i = 2;i*i <= t;i++) 
            if(t%i==0) {
                phi[n] = phi[n] / i * (i-1);
            
                while(t % i == 0) t /= i;
            }
        if(t > 1) {
            phi[n] = phi[n] / t * (t-1);
        }
    }

    for(int i = 1;i <= maxn;i++)
        for(int n = 2*i;n <= maxn;n += i) f[n] += (ll)phi[n/i]*i;

    s[2] = f[2];
    for(int i = 3;i <= maxn;i++) s[i] = s[i-1] + f[i];

    int n;
    while(scanf("%d",&n) == 1 && n) {
        printf("%lld\n",s[n]);  
    }

    return 0;
}