HDU 2824

HDU 2824

The Euler function

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

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

基本是欧拉函数的模板题，计算phi(a)到phi(b)的和

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctype.h>
#include<algorithm>
#include<time.h>
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
typedef long long LL;
const int maxn=3000000;
int phi[maxn+1]; 

void init()
{
	int i,j;
	clock_t t1,t2;
	for(i=1;i<=maxn;i++) 
		phi[i]=i;
	for(i=2;i<=maxn;i+=2) 
		phi[i]/=2;
	for(i=3;i<=maxn;i+=2) 
		if(phi[i]==i)
			for(j=i;j<maxn;j+=i)
				phi[j]=phi[j]/i*(i-1);
}

int main(void)
{
	int t,a,b,i;
	init();
	while(scanf("%d%d",&a,&b)!=EOF)
	{
		LL ans=0;
		for(i=a;i<=b;i++)
			ans+=phi[i];
		printf("%I64d\n",ans);
	}
	return 0;
}