hdu 1124 (n! 中素数p的个数的应用)
来源:互联网 发布:手机必备软件大全 编辑:程序博客网 时间:2024/05/21 22:42
Factorial
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4030 Accepted Submission(s): 2652
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!中末尾0的个数,即10的个数,相当于在n!中找2和5的个数的最小值;’
#include<bits/stdc++.h>using namespace std;const int maxn = 1000 + 10;int fun(int n,int p){int ans = 0;int temp = p;while(n >= temp){ans += n/temp;temp = temp *p;}return ans;}int main(){int n;int Tcase;scanf("%d",&Tcase);while( Tcase --) //while( ~ scanf("%d",&n)){scanf("%d",&n);cout << min(fun(n,2),fun(n,5)) << endl;}return 0;}
0 0
- hdu 1124 (n! 中素数p的个数的应用)
- HDU 3304 求杨辉三角第N行中能被素数P整除的数的个数
- HDU 1124 n!中0的个数
- 204.Count Primes(1-N中,素数的个数)
- HDU 5901 1-n中素数个数
- 容斥原理的应用---求1--r中与n互素数的个数
- C(n,k)中素数P的问题
- n!素因子分解中素数p的幂
- 1-N中素数的个数(N非常大)-HDU5901
- (java)统计小于N的数中素数的个数
- hdu 5901 Count primes(Meisell-Lehmer 统计n(很大)以内的素数个数)
- 求1--r中与n互素数的个数
- 素数的分布(素数定理),求1~10^n 素数个数的位数
- 正整数n内包含质数(素数)的个数
- 求小于n的素数个数(模板)
- 不小于N的素数个数
- 求n以内的素数个数问题
- 计算从[1,n]的素数个数
- C++中const迭代器 和 const_iterator的区别
- 理解TIME_WAIT,彻底弄清解决TCP: time wait bucket table overflow
- python的一个好玩模块wordcloud
- 十进制转二进制(最简代码)
- 微信小程序开发—(二)轮播图
- hdu 1124 (n! 中素数p的个数的应用)
- [笔记]前端
- Noj
- webpack学习笔记(一)
- ReentrantLock 重入锁
- c++版矩阵基本操作,行列式,逆(不限矩阵大小)
- 关于String的常见问题
- 导出excel
- MySQL服务器的连接数设置