hdu1124
来源:互联网 发布:sudoers ubuntu 编辑:程序博客网 时间:2024/06/08 15:39
Factorial
http://acm.hdu.edu.cn/showproblem.php?pid=1124
Problem 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
题意:给出一个数n 求n!后面有几个0
以为0必须是有2(的倍数)*5(的倍数)才可以得到
而且2一定比5的个数多 所以只需要记录有多少个因子5就行了
#include <stdio.h>int main (){ int t,n,s; scanf("%d",&t); while (t--) { scanf("%d",&n); s=0; while (n) { n/=5; s+=n; } printf ("%d\n",s); } return 0;}
- hdu1124
- hdu1124
- HDU1124
- hdu1124
- hdu1124
- hdu1124
- hdu1124-Factorial
- HDU1124 Factorial
- hdu1124(djstra+dfs)
- hdu1124 数论 java版
- HDU1124:Factorial(简单数论)
- UVALive2158 POJ1401 HDU1124 ZOJ2024 Factorial【分析思维】
- hdu1124 数论 N阶乘有多少个尾0
- hdu1124 n!后有多少个0 数学
- HDU1124 一个数的阶乘的结果中包含 几个 0
- linux C 扩展语法1--内联函数方法简介
- Delphi连接SQL Server 2000
- 在UltraEdit (UEStudio)使用技巧及其中的正则表达式
- Android Robotium实例
- 在企业内部门户如何构建社区应用?
- hdu1124
- 如何获得Android的System Bar’s Height
- 多线程知识点整理
- [IT 男人帮 11-15] Think Different:烛照未来
- 将图片文件转化为字节数组字符串,并对其进行Base64编码处理
- 静态代码块
- 修正android 处理连续按键两次
- 数据库实验二
- python_对字典进行排序