lightoj 1007 欧拉函数

Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable.

In this problem, you will be given two integers a and b. You have to find the summation of the scores of the numbers from a to b (inclusive). The score of a number is defined as the following function.

score (x) = n2, where n is the number of relatively prime numbers with x, which are smaller than x

For example,

For 6, the relatively prime numbers with 6 are 1 and 5. So, score (6) = 22 = 4.

For 8, the relatively prime numbers with 8 are 1, 3, 5 and 7. So, score (8) = 42 = 16.

Now you have to solve this task.

Input
Input starts with an integer T (≤ 105), denoting the number of test cases.

Each case will contain two integers a and b (2 ≤ a ≤ b ≤ 5 * 106).

Output
For each case, print the case number and the summation of all the scores from a to b.

Sample Input
Output for Sample Input
3
6 6
8 8
2 20
Case 1: 4
Case 2: 16
Case 3: 1237
Note
Euler’s totient function applied to a positive integer n is defined to be the number of positive integers less than or equal to n that are relatively prime to n. is read “phi of n.”

Given the general prime factorization of , one can compute using the formula

这个题是要求指定区间【a,b】的欧拉函数的平方的区间和
欧拉函数是指小于这个数本身的所有和他互质的数的个数
证明就不记录了没啥用
欧拉函数就等于他本身x对每个质因子ai做出*(1-1/ai)这种事。。

一开始把所有的数的质因子全部都求出来了然后挨个进去乘结果很显然的超时了…
讲道理不仅超时甚至就连自己编译器上跑都跑好几秒….

然后百度了模板

这个模板的意思就是先从这些数里边找出质数
也就是外层循环要做的事，每个数都能分解成有限个质数相乘
因此这里就不用除法，用质数相乘的方法更新所有的值
内层循环的意思是给所有已外层为质因数的数做出*(1-1/ai)这种事。。。
这个思路比较清奇….记一下

#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<string>
#include<memory.h>
#include<stack>
using namespace std;
unsigned long long oula[5000001];
int main()
{
    oula[0]=0;
    oula[1]=1;
    for(int a=2;a<=5000000;++a)
    {
        if(!oula[a])
        {
            for(int b=a;b<=5000000;b+=a)
            {
                if(!oula[b])oula[b]=b;
                oula[b]=oula[b]/a*(a-1);
            }
        }
    }
    for(int a=2;a<=5000000;a++)
    {
        oula[a]*=oula[a];
        oula[a]+=oula[a-1];
    }
    int T;
    cin>>T;
    int u=0;
    while(T--)
    {
        long long a,b;
        scanf("%lld%lld",&a,&b);
        printf("Case %d: %llu\n",++u,oula[b]-oula[a-1]);
    }
    return 0;
}