HDU-2824 The Euler function(欧拉函数)

The Euler function

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8008    Accepted Submission(s): 3336

Problem Description

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)

 

 

Input

There are several test cases. Each line has two integers a, b (2<a<b<3000000).

 

 

Output

Output the result of (a)+ (a+1)+....+ (b)

 

 

Sample Input

3 100

 

 

Sample Output

3042

 

 

Source

2009 Multi-University Training Contest 1 - Host by TJU

 

 

Recommend

 

欧拉函数挺有用的似乎，欧拉函数表和朴素筛法是有着异曲同工之妙的

#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
const int MAX=3e6+5;
int phi[MAX];
void eular(){
    int i,j;
    for (i=1;i<MAX;i++) phi[i]=i;
    for (i=2;i<MAX;i+=2) phi[i]/=2;
    for (i=3;i<MAX;i+=2){
        if (phi[i]==i)
            for (j=i;j<MAX;j+=i)
                phi[j]=phi[j]/i*(i-1);
    }
}
int main(){
    freopen ("euler.in","r",stdin);
    freopen ("euler.out","w",stdout);
    int i,j;
    eular();
    LL x,y,ans;
    while (~scanf("%lld%lld",&x,&y)){
        for (i=x,ans=0;i<=y;i++) ans+=(LL)phi[i];
        printf("%lld\n",ans);
    }
    return 0;
}