hdu 1124 Factorial(末尾0)
2015-09-05 14:35
411 查看
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1124
Total Submission(s): 3259 Accepted Submission(s): 2100
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.
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
Sample Output
分析:简单数论问题。所求的阶乘结果末尾0的个数纸盒2和5的匹配数相关。
例如:60-->14
5 10 15 20 25(25=5*5) 30 35 40 45 50(50=5*5*2) 55 60
-->(14个5)
25/5=5 5/5=1 -->5+1=6
50/5=10 10/5=2 -->12
60/5=12 12/5=2 2/5=0 -->14
Factorial
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3259 Accepted Submission(s): 2100
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.
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
6 3 60 100 1024 23456 8735373
Sample Output
0 14 24 253 5861 2183837
分析:简单数论问题。所求的阶乘结果末尾0的个数纸盒2和5的匹配数相关。
例如:60-->14
5 10 15 20 25(25=5*5) 30 35 40 45 50(50=5*5*2) 55 60
-->(14个5)
25/5=5 5/5=1 -->5+1=6
50/5=10 10/5=2 -->12
60/5=12 12/5=2 2/5=0 -->14
#include <iostream> #include <cstdio> using namespace std; int get(int a){ return a/5; } int main() { //freopen("cin.txt","r",stdin); int t,q,temp; cin>>t; while(t--){ scanf("%d",&q); int ans=0; temp=get(q); while(temp){ ans+=temp; temp=get(temp); } printf("%d\n",ans); } return 0; }
相关文章推荐
- 归并排序之逆序对数
- 中兴通讯2013校招软件笔试题
- java文件的远程传输
- 第二周项目0-宣告“主权”
- 懒加载和抓取策略
- java命名规范
- 8583报文解析
- HDU 2087 剪花布条
- PAT 1084. Broken Keyboard (20)
- 联通宽带10M以下只能3台电脑上网
- 资源汇总
- PHP环境搭建
- 笔试题:删除链表中重复的节点
- C#中new、override、virtual关键字的区别
- 性能测试基本概念
- 基于TLS(线程局部存储)的高效timelog实现
- Hadoop学习之MapReduce执行过程详解
- php配置
- Linux环境安装IPython配置python开发环境
- unsigned 和 signed