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): 3333    Accepted Submission(s): 1368

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

gaojie   |   We have carefully selected several similar problems for you:   2818  2825  2817  2822  2820 

 

求欧拉函数，打表题：

 

 1 //453MS    23700K    484 B    G++
 2 #include<stdio.h>
 3 #define N 3000005
 4 __int64 ans[N];
 5 void init()
 6 {
 7     for(int i=1;i<N;i++) ans[i]=i;
 8     for(int i=2;i<N;i+=2) ans[i]/=2;
 9     for(int i=3;i<N;i+=2) 
10         if(ans[i]==i){
11             for(int j=i;j<N;j+=i) ans[j]=ans[j]/i*(i-1);
12         }
13 }
14 int main(void)
15 {
16     int a,b;
17     init();
18     while(scanf("%d%d",&a,&b)!=EOF)
19     {
20         __int64 ret=0;
21         for(int i=a;i<=b;i++) ret+=ans[i];
22         printf("%I64d\n",ret);
23     }
24     return 0;
25 }

 

转载于:https://www.cnblogs.com/GO-NO-1/p/3651305.html