HDU 1124 (求阶乘中0的个数)
2016-08-24 09:55
176 查看
Factorial
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3665 Accepted Submission(s): 2397
[align=left]Problem Description[/align]
The most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and every phone connects
to the BTS with the strongest signal (in a little simplified view). Of course, BTSes need some attention and technicians need to check their function periodically.
ACM technicians faced a very interesting problem recently. Given a set of BTSes to visit, they needed to find the shortest path to visit all of the given points and return back to the central company building. Programmers have spent several months studying
this problem but with no results. They were unable to find the solution fast enough. After a long time, one of the programmers found this problem in a conference article. Unfortunately, he found that the problem is so called "Travelling Salesman Problem" and
it is very hard to solve. If we have N BTSes to be visited, we can visit them in any order, giving us N! possibilities to examine. The function expressing that number is called factorial and can be computed as a product 1.2.3.4....N. The number is very high
even for a relatively small N.
The programmers understood they had no chance to solve the problem. But because they have already received the research grant from the government, they needed to continue with their studies and produce at least some results. So they started to study behaviour
of the factorial function.
For example, they defined the function Z. For any positive integer N, Z(N) is the number of zeros at the end of the decimal form of number N!. They noticed that this function never decreases. If we have two numbers N1<N2, then Z(N1) <= Z(N2). It is because
we can never "lose" any trailing zero by multiplying by any positive number. We can only get new and new zeros. The function Z is very interesting, so we need a computer program that can determine its value efficiently.
[align=left]Input[/align]
There is a single positive integer T on the first line of input. It stands for the number of numbers to follow. Then there is T lines, each containing exactly one positive integer number N, 1 <= N <= 1000000000.
[align=left]Output[/align]
For every number N, output a single line containing the single non-negative integer Z(N).
[align=left]Sample Input[/align]
6
3
60
100
1024
23456
8735373
[align=left]Sample Output[/align]
0
14
24
253
5861
2183837
题意:求n的阶乘中0的个数;
思路:直接求出n的阶乘含有多少个5就可以了;
代码:
#include<stdio.h> #include<string.h> int main() { int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); int ans=0; while(n) { ans+=n/5; n=n/5; } printf("%d\n",ans); } return 0; }
相关文章推荐
- 阶乘 hdu 1124 (Factorial)
- HDU 1124 Factorial&&nyoj 84 阶乘的 0【数学】
- HDU 1124 Factorial (阶乘后缀0)
- HDU1124 一个数的阶乘的结果中包含 几个 0
- hdu 1124 Factorial 数论,就是求一个数的阶乘的结果末尾有多少0.
- HDU-1042(大数阶乘)
- poj 1517 & hdu 1012 u Calculate e(简单阶乘)
- HDU 3641 Treasure Hunting(阶乘素因子分解+二分)
- HDU 1124 Factorial
- HDU 1124 Factorial(数论)
- hdu 1018 Stirling 求阶乘位数
- hdu 1018 阶乘位数
- HDU 1042 N! (大数阶乘加优化处理)
- HDU 1042 N! (大数阶乘,紫书上的方法超时!!还是Java大法好!!)
- HDU6044-Limited Permutation(fread挂&&阶乘求逆元&&组合数)
- hdu 1124 (n! 中素数p的个数的应用)
- HDU 1018 求阶乘的位数
- HDU 1124 求末尾0的个数,函数 [ x ] , { x } 在数论中的小应用
- hdu 1141 Factstone Benchmark 数论水题,,阶乘用斯特林公式
- HDU 3641 Treasure Hunting(阶乘素因子分解+二分)