HDU-2824 The Euler function

The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smaller than n and coprime to n, and this function has a lot of beautiful characteristics. Here comes a very easy question: suppose you are given a, b, try to calculate (a)+ (a+1)+....+ (b)

InputThere are several test cases. Each line has two integers a, b (2<a<b<3000000).OutputOutput the result of (a)+ (a+1)+....+ (b)Sample Input

3 100

Sample Output

3042

// 线性筛法求欧拉函数

#include <cstdio>

#define MAX 3000001

typedef long long LL;

LL phi[MAX];

void euler() {
    for( LL i = 1; i < MAX; i++ )  phi[i] = i;
    for( LL i = 2; i < MAX; i++ ) {
        if( phi[i] == i ) {   //如果i是质数
            for( LL j = i; j < MAX; j += i ) {
                phi[j] = phi[j] / i * ( i - 1 );    //提一个1/i,先进行除法是为了防止中间数据的溢出
            }
        }
    }
}

int main() {
    euler();
    LL a, b;
    while( scanf( "%lld%lld", &a, &b ) != EOF ) {
        LL sum = 0;
        for( LL i = a; i <= b; i++ ) sum = sum + phi[i];
        printf( "%lld\n", sum );
    }
    return 0;
}