ACM 数论 hdu 1124 Factorial
2016-05-12 13:37
309 查看
[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]
[align=left]Sample Output[/align]
题意:求n!的0的个数
想要出现0,只可能是2*5; 5的个数决定了0的个数
#include<stdio.h>
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
scanf("%d",&m);
int sum=0;
while(m>=5)
{
sum=sum+m/5;
m=m/5;
}
printf("%d\n",sum);
}
}
}
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的个数
想要出现0,只可能是2*5; 5的个数决定了0的个数
#include<stdio.h>
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
while(n--)
{
scanf("%d",&m);
int sum=0;
while(m>=5)
{
sum=sum+m/5;
m=m/5;
}
printf("%d\n",sum);
}
}
}
相关文章推荐
- 实现qq空间返回重进控制器不销毁
- 敏捷开发Scrum 学习笔记,适于移动开发
- 三元运算符
- The MathType DLL cannot be found.Please reinstall mathtype 解决方法
- 素数
- android studio如何把library生成jar包
- MFC中char*,string和CString之间的转换
- mysql - 语法复习与学习
- SecureCRT的使用方法和技巧
- 掌中行_mysql的相关命令
- iOS 环信UI3.0集成中的问题
- (经典)POJ-2385 DP
- arm处理器中a5 a8 a9,v6 v7,arm7 arm9 arm11都是依据什么来分类的【转】
- Webpack打包React踩到的坑
- 13Dialog中隐藏键盘的注意事项
- 策略模式(Strategy)
- 如何使用Flexible实现手淘H5页面的终端适配
- Michael的Python笔记(二)
- scala本地wordcount的程序编写
- struts2 国际化 中文乱码英文不乱码问题