poj1401
来源:互联网 发布:卢松松博客php版 编辑:程序博客网 时间:2024/06/02 03:24
题意:求n!有多少个0!!2*5会产生0,所以求出2和5中个数最小的既5的个数!!
Factorial
Description
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.
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.
Input
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.
Output
For every number N, output a single line containing the single non-negative integer Z(N).
Sample Input
63601001024234568735373
Sample Output
0142425358612183837
#include<stdio.h>
int main()
{
int t,n,sum;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
sum=0;
while(n>=5)
{
sum+=n/5;
n=n/5;
}
printf("%d\n",sum);
}
return 0;
}
- poj1401
- poj1401
- POJ1401
- poj1401
- poj1401
- poj1401(Factorial)
- poj1401 Factorial
- poj1401--Factorial
- POJ1401-Factorial
- Poj1401 - Factorial
- poj1401——Factorial
- 北大ACM poj1401
- POJ1401解题报告
- poj1401解题报告
- 数论基础(POJ1401)
- POJ1401 数学N!因子分解
- poj1401 阶乘最后的零的个数
- poj1401(计算n!中0的个数)
- 一些牛人的牛博客
- 测试用例的设计心得
- windows下练习linux编程的软件-cygwin的用法(超简单)
- GPG(pgp)加解密中文完整教程
- poj 2016 Play on Words--欧拉通路
- poj1401
- HDU 1506 Largest Rectangle in a Histogram
- STL 关联容器
- 开发资源汇总
- poj 1730 Perfect Pth Powers
- ORACLE 10进制转换2进制
- shell的expr命令
- 通过Launcher里的WorkSpace完成桌面的3D转屏效果(有源码)
- 指针和引用的区别 .