Trailing Zeroes

最新推荐文章于 2024-06-14 16:08:52 发布

Oenheng

最新推荐文章于 2024-06-14 16:08:52 发布

阅读量227

点赞数

分类专栏：小数学文章标签：小数学

本文链接：https://blog.csdn.net/oenheng/article/details/52214283

版权

小数学专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Trailing Zeroes (III)

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Submit Status Practice LightOJ 1138

uDebug

Description

You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains one zero on the trail.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case contains an integer Q (1 ≤ Q ≤ 10⁸) in a line.

Output

For each case, print the case number and N. If no solution is found then print 'impossible'.

Sample Input

Sample Output

Case 1: 5

Case 2: 10

Case 3: impossible

关键是知道怎么算一个数的阶乘有多少个0：

#include<cstdio>
#include<algorithm>
using namespace std;
#define manx 0x3f3f3f3f
int ge(int a)<span style="white-space:pre">	</span>//计算a的阶乘有多少个0；
{
	int ans=0;
	while(a!=0)
	{
		ans=ans+a/5;
		a=a/5;
	}
	return ans;
}
int main()
{
	int t,cont,i,l,r,mid;
	int n,ans;
	scanf("%d",&t);
	cont=0;
	while(t--)
	{
		scanf("%d",&n);
		l=0,r=manx;
		while(r>=l)
		{
			mid=(l+r)/2;
			if(ge(mid)>=n)
			{
				r=mid-1;
			}
			if(ge(mid)<n)
			{
				l=mid+1;
			}
		}
		if(ge(l)==n)
		printf("Case %d: %d\n",++cont,l);
		else
		printf("Case %d: impossible\n",++cont);
	}
	return 0;
}