hdu 2824 The Euler function 【欧拉打表】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2824

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

 

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

题意：求n~m之间所有与[n--m]互质的个数和！我是用打表过的！注：数据类型long long!

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn = 3e6+10;
typedef long long ll;
ll eu[maxn];
void euler() //欧拉线性打表
{
    for(int i=2;i<maxn;i++)
    {
        if(!eu[i])
        {
            for(int j=i;j<maxn;j+=i)
            {
                if(!eu[j]) eu[j] = j;
                eu[j] = eu[j]/i*(i-1);
            }
        }
        eu[i] += eu[i-1];
    }
}
int main()
{
    ios::sync_with_stdio(false);
    euler();
    int m,n;
    while(cin>>m>>n)
    {
        cout<<eu[n]-eu[m-1]<<endl;
    }
    return 0;
}