hdu 1124 (n! 中素数p的个数的应用)
2017-04-27 15:15
344 查看
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.
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
求的是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;
}
相关文章推荐
- HDU 4228 Flooring Tiles 反素数的应用
- hdu_5104_素数表的应用
- HDU 1124 求末尾0的个数,函数 [ x ] , { x } 在数论中的小应用
- hdu 5317 (普通素数筛的应用)+(前缀和预处理)
- hdu(素数的简单应用)
- hdu 1131 Count the Trees(catalan数的应用)
- HDU 2012 素数判定 解题报告
- hdu 2066一个人的旅行 Dijkstra算法应用
- hdu 2072 单词数(map的简单应用)
- HDU 1022 stack 的应用
- hdu 2012 素数判定
- HDU 2012 素数判断
- hdu 2098 分拆素数和 悲剧超时了。
- hdu 2136 Largest prime factor (分解素数技巧)
- HDU 1754 I hate it 线段树的应用
- http://acm.hdu.edu.cn/showproblem.php?pid=1905 素数判断 + 二分
- 素数判断算法-----应用
- HDU-1268 找新朋友 (素数筛选)
- http://acm.hdu.edu.cn/showproblem.php?pid=2303 (素数打表 + java大数取模)
- HDU_2222 关键字查找(AC自动机应用)...