The Euler function
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3448 Accepted Submission(s): 1409
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
筛法打表,不然会超时,同时注意MLE。。
筛法打表,不然会超时,同时注意MLE。。
#include<stdio.h>
#include<string.h>
#define maxn 3000003
int vis[maxn],arr[maxn];
int main()
{
//freopen("in.txt","r",stdin);
arr[1]=0;
for(int i=2;i<=maxn;i++)
arr[i]=i;
memset(vis,0,sizeof(vis));
for(int i=2;i<=maxn;i++)
{
if(!vis[i])
{
for(int j=i;j<=maxn;j+=i)
{
arr[j]=arr[j]/i*(i-1);
vis[j]=1;
}
}
}
int a,b;
while(scanf("%d %d",&a,&b)!=EOF)
{
__int64 sum=0;
for(int i=a;i<=b;i++)
sum+=arr[i];
printf("%I64d\n",sum);
}
return 0;
}