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查找不互质因子之和;找出互质因子之和,总和再减去就行了互质因子之和,互质因子个数*n/2;#include <stdio.h> #include <string.h> #include <math.h> #define mod 1000000007 typedef __int64 LL; int Euler(int x) { int i, res = x; for(i = 2; i <= (int)sqrt((double)x); ++i) { if(x % i == 0) { res = res / i * (i - 1); while(x % i == 0) x /= i; } } if(x > 1) res = res / x * (x - 1); return res; } int main() { int n, i; LL ans; while(scanf("%d", &n), n) { ans = (LL)n * (n - 1) / 2 - (LL)Euler(n) * n / 2; printf("%d\n", ans % mod); } return 0; }