POJ 1401 Factorial (求N!的零数)
来源:互联网 发布:手机网络不好怎么办 编辑:程序博客网 时间:2024/05/15 23:44
Factorial
Time Limit: 1500MS Memory Limit: 65536KTotal Submissions: 15291 Accepted: 9444
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的阶乘中含有的0的个数思路:按照普通的想法,会找出2和5的个数,然后计算,但是我们发现,2的个数永远比5的多,所以说只需要找5的个数就行了,所以说F(n)=n/5+F(n/5)。ac代码:#include<stdio.h>#include<math.h>#include<string.h>#include<stack>#include<queue>#include<vector>#include<iostream>#include<algorithm>#define MAXN 1000100#define LL long long#define ll __int64#define INF 0xfffffff#define mem(x) memset(x,0,sizeof(x))#define PI acos(-1)using namespace std;int main(){LL n;int t,i;int cas=0;scanf("%d",&t);while(t--){scanf("%lld",&n);LL ans=0;while(n){ans+=n/5;n/=5;}printf("%lld\n",ans);}return 0;}
0 0
- POJ 1401 Factorial (求N!的零数)
- 求N!的最末位非零数
- 求n!的最后一位非零数
- 求N!的最末位非零数
- UVA568求n!的最后一位非零数
- 求N!中最后一个非零数
- poj 1150 The Last Non-zero Digit 求排列数的最后非零数
- poj 3406 Last digit 求组合数的最后非零数
- N!的最末位非零数
- N!的最末位非零数
- POJ 1401 && ZOJ 2202 Factorial 阶乘N!的末尾零的个数
- Poj 1401 Factorial(计算N!尾数0的个数——质因数分解)
- POJ 1401:Factorial 求一个数阶乘的末尾0的个数
- POJ 1401 Factorial 阶乘0的数量 .
- hdu 1066 Last non-zero Digit in N! 数学,求n!最后一位非零数
- poj 1401 Factorial
- POJ 1401 Factorial
- POJ 1401 Factorial
- Elementary OS Freya 体验
- ibatis insert返回主键
- android控件拖动,移动、解决父布局重绘时控件回到原点
- Spring 核心 Ioc(DI)
- 指针2
- POJ 1401 Factorial (求N!的零数)
- Android 长度单位
- dock 下安装ruby搭建rails 服务
- 很特别的一个动态规划入门教程
- 菜鸟搭建celery环境
- Java学习之 多态 Polymorphism
- 几张SVG矢量图看明所有操作系统之间的演进关系
- 主题使用自定义style时整个屏幕的背景色变成黑色的问题
- 利用 Python 实现多线程多任务提交 - matlab 函数示例