uva-10820-Send a Table 欧拉函数，筛法求欧拉函数

G - Send a Table

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice UVA 10820

Appoint description:

Description

Problem A
Send a Table
Input: Standard Input

Output: Standard Output

 

When participating in programming contests, you sometimes face the following problem: You know how to calcutale the output for the given input values, but your algorithm is way too slow to ever pass the time limit. However hard you try, you just can't discover the proper break-off conditions that would bring down the number of iterations to within acceptable limits.

Now if the range of input values is not too big, there is a way out of this. Let your PC rattle for half an hour and produce a table of answers for all possible input values, encode this table into a program, submit it to the judge, et voila: Accepted in 0.000 seconds! (Some would argue that this is cheating, but remember: In love and programming contests everything is permitted).

Faced with this problem during one programming contest, Jimmy decided to apply such a 'technique'. But however hard he tried, he wasn't able to squeeze all his pre-calculated values into a program small enough to pass the judge. The situation looked hopeless, until he discovered the following property regarding the answers: the answers where calculated from two integers, but whenever the two input values had a common factor, the answer could be easily derived from the answer for which the input values were divided by that factor. To put it in other words:

Say Jimmy had to calculate a function Answer(x, y) where x and y are both integers in the range [1, N].  When he knows Answer(x, y), he can easily derive Answer(k*x, k*y), where k is any integer from it by applying some simple calculations involving Answer(x, y) and k. For example if N=4, he only needs to know the answers for 11 out of the 16 possible input value combinations: Answer(1, 1), Answer(1, 2), Answer(2, 1), Answer(1, 3), Answer(2, 3), Answer(3, 2), Answer(3, 1), Answer(1, 4), Answer(3, 4), Answer(4, 3) and Answer(4, 1). The other 5 can be derived from them (Answer(2, 2), Answer(3, 3) and Answer(4, 4) from Answer(1, 1), Answer(2, 4) from Answer(1, 2), and Answer(4, 2) from Answer(2, 1)). Note that the function Answer is not symmetric, so Answer(3, 2) can not be derived from Answer(2, 3).

Now what we want you to do is: for any values of N from 1 upto and including 50000, give the number of function Jimmy has to pre-calculate.

Input

The input file contains at most 600 lines of inputs. Each line contains an integer less than 50001 which indicates the value of N. Input is terminated by a line which contains a zero. This line should not be processed.

 

Output

For each line of input produce one line of output. This line contains an integer  which indicates how many values Jimmy has to pre-calculate for a certain value of N.

 

 

 

 

Sample Input                               Output for Sample Input

2 5 0

3 19

---

Problem setter: Little Joey

Special Thanks: Shahriar Manzoor

关于筛法求欧拉函数

别人博客的解释

先筛出N以内的所有素数，再以素数筛每个数的φ值。
比如求10以内所有数的φ值：
设一数组phi[11]，赋初值phi[1]=1,phi[2]=2...phi[10]=10；
然后从2开始循环，把2的倍数的φ值*(1-1/2)，则phi[2]=2*1/2=1,phi[4]=4*1/2=2,phi[6]=6*1/2=3....；
再是3，3的倍数的φ值*(1-1/3)，则phi[3]=3*2/3=2,phi[6]=3*2/3=2，phi[9]=.....；
再5，再7...因为对每个素数都进行如此操作，因此任何一个n都得到了φ(n)=n*（1-1/p1)(1-1/p2)....(1-1/pk)的运算
觉得这个“筛”还是比较好用的，以前求数的所有因子之和也是用的它。

原文章

#include<iostream>
#include<cstring>

using namespace std;

const int maxn=50001;
int n;
int ans;
int phi[maxn];

void phi_table()
{
       memset(phi, 0, sizeof(phi));
       phi[1]=1;
       for(int i=2;i<=maxn;i++)
       if(!phi[i]){
              for(int j=i;j<=maxn;j+=i){
                     if(!phi[j]) phi[j]=j;
                     phi[j]=phi[j]/i*(i-1);
              }
       }
}
void init()
{
       phi_table();
}
void solve()
{
       for(int i=2;i<=n;i++){
              ans+=2*phi[i];
       }
       cout<<ans+1<<endl;

}
int main()
{
       init();
       while(cin>>n&&n){
              ans=0;
              solve();
       }
}