欧拉函数

刚开始入门欧拉函数

欧拉函数的公式：euler(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…(1-1/pn),其中p1,p2……pn为x的所有素因数，x是不为0的整数

(注意：每种质因数只一个。比如 12 = 2*2*3 那么      φ(12) = 12 * (1-1/2) * (1-1/3)=4  

欧拉函数性质：  1、  φ(mn) = φ(m) φ(n)

                               2、若n为奇数，φ(2n) = φ(n)。

(1) 若(N%a==0 && (N/a)%a==0) 则有:E(N)=E(N/a)*a;
(2) 若(N%a==0 && (N/a)%a!=0) 则有:E(N)=E(N/a)*(a-1);

欧拉公式的延伸：一个数的所有质因子之和是euler(n)*n/2。

题目    hdu 1787 GCD Again 

Problem Description Do you have spent some time to think and try to solve those unsolved problem after one ACM contest? No? Oh, you must do this when you want to become a "Big Cattle". Now you will find that this problem is so familiar: The greatest common divisor GCD (a, b) of two pos