写东西的地方

Problem G How many zeros and how many digits? Input: standard input Output: standard output Given a decimal integer number you will have to find out how many trailing zeros will be there in its

Boring Sum Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1099    Accepted Submission(s): 517 Problem Description Number theory

Euler函数表达通式：euler(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…(1-1/pn),其中p1,p2……pn为x的所有素因数，x是不为0的整数。euler(1)=1（唯一和1互质的数就是1本身）。 欧拉公式的延伸：一个数的所有质因子之和是euler(n)*n/2。 参考http://blog.youkuaiyun.com/once_hnu/arti

The sum of gcd Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 645    Accepted Submission(s): 279 Problem Description You have an array