[HDU]3501 Calculation 2 [欧拉函数之求和]

最新推荐文章于 2023-09-21 23:55:55 发布

ctsas

最新推荐文章于 2023-09-21 23:55:55 发布

阅读量439

点赞数

分类专栏：欧拉函数数学知识点文章标签：欧拉函数

本文链接：https://blog.csdn.net/ctsas/article/details/55532264

版权

数学知识点同时被 2 个专栏收录

11 篇文章 0 订阅

订阅专栏

欧拉函数

8 篇文章 0 订阅

订阅专栏

Problem Description
Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said to be coprime to B if A, B share no common positive divisors except 1.

Input
For each test case, there is a line containing a positive integer N(1 ≤ N ≤ 1000000000). A line containing a single 0 follows the last test case.

Output
For each test case, you should print the sum module 1000000007 in a line.

Sample Input
3
4
0

Sample Output
0
2

解题报告

\sum g c d (i, n) = 1 i < n i = n \cdot φ (n) / 2

$\sum_{gcd(i,n)=1}^{i<n}i=n\cdot φ(n)/2$

#include<stdio.h>
typedef __int64 LL;

LL E(LL n){
    LL res=1;
    for(LL i=2;i*i<=n;i++)
        if(n%i==0){
            res*=i-1;
            n/=i;
            while(n%i==0) res*=i,n/=i;
        }
    if(n>1) res*=n-1;
    return res;
}

int main()
{
    LL n;
    while(~scanf("%lld",&n)&&n){
        LL ans=(n-1)*n/2-n*E(n)/2;
        printf("%lld\n",ans%1000000007);
    }
    return 0;
}