HDU 2824 The Euler function

最新推荐文章于 2020-01-16 15:32:44 发布

置顶 sky_miange

最新推荐文章于 2020-01-16 15:32:44 发布

阅读量455

点赞数

分类专栏：欧拉函数文章标签： ACM算法

本文链接：https://blog.csdn.net/sky_miange/article/details/49128845

版权

欧拉函数专栏收录该内容

1 篇文章 0 订阅

订阅专栏

The Euler function

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

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

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 2821

筛法快速求欧拉函数之和

#include<cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod= 1000000007;
const int M=3000005;
int num[M];
void init(int x)
{
    int i,j;
    for(i=2; i<=x; i++)
        num[i]=i;
    for(i=2; i<=x; i++)
        if(num[i]==i)
            for(j=i; j<=x; j+=i)
                num[j]=(num[j]/i)*(i-1);
}
int main()
{
    int a,b;
    init(M);
    while(cin>>a>>b)
    {
        int i;
        ll res=0;
        for(i=a; i<=b; i++)
            res+=num[i];
        cout<<res<<endl;
    }
    return 0;
}