ACM: uva 11426 -&…

GCD Extreme (II)

 

Given the value of N, you will have to find the value of G. The definition of G is given below:

Here GCD(i,j) means the greatest common divisor of integer i and integer j.

 

For those who have trouble understanding summation notation, the meaning of G is given in the following code:

G=0; for(i=1;i<<span class="SpellE">N;i++) for(j=i+1;j<=N;j++) {     G+=gcd(i,j); }

 

Input

The input file contains at most 100 lines of inputs. Each line contains an integer N (1 

 

Output

For each line of input produce one line of output. This line contains the value of G for the corresponding N. The value of G will fit in a 64-bit signed integer.

 

Sample Input 

10

100

200000

0

Output for Sample Input

67

13015

143295493160

题意: 计算gcd(1,n)+gcd(2,n)+...+gcd(n-1, n);

解题思路:

     1. 设f(n) = gcd(1,n)+gcd(2,n)+ ...+gcd(n-1,n);

          s(n) = f(2)+f(3)+...+f(n) (n>=2);

        即: s(n) = s(n-1)+f(n);

     2. 所有gcd(x,n)的值都是n的约数, 所以设g(n,i)表示gcd(x,n)=i的正整数x的个数.(x

        即: f(n) = sum{ i*g(n,i) | i是n的约数 };

        因为gcd(x,n)=i的充要条件: gcd(x/i,n/i)=1; x/i满足条件的个数有phi(n/i);

        (x/i与n/i互质的个数);

        即: g(n,i) = phi(n/i);

     3. 结果: s(n) = s(n-1)+f(n) = s(n-1)+sum{i*phi(n/i)};

代码:

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
#define MAX 4000005
typedef long long ll;

int n;
ll phi[MAX], s[MAX], f[MAX];

void phi_table(int n)
{
    for(int i = 2; i <= n; ++i) phi[i] = 0;
    phi[1] = 1;
   
    for(int i = 2; i <= n; ++i) if( !phi[i] )
    {
        for(int j = i; j <= n; j += i)
        {
            if( !phi[j] ) phi[j] = j;
            phi[j] = phi[j] / i*(i-1);
        }
    }
}

void init()
{
    phi_table(MAX-1);
    memset(f, 0, sizeof(f));
    for(int i = 1; i <= MAX-1; ++i)
        for(int j = i*2; j <= MAX-1; j += i)
            f[j] += i*phi[j/i];
    s[2] = f[2];
    for(int i = 3; i <= MAX-1; ++i)
        s[i] = s[i-1]+f[i];
}

int main()
{
//    freopen("input.txt", "r", stdin);
    init();
    while(scanf("%d", &n) != EOF)
    {
        if(n == 0) break;
       
        printf("%lld\n", s[n]);
    }
   
    return 0;
}