LightOJ 1138 Trailing Zeroes

1138 - Trailing Zeroes (III)

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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	Output for Sample Input
3 1 2 5	Case 1: 5 Case 2: 10 Case 3: impossible

题意：

给一个数q代表0的个数，求出一个最小的n，满足n的阶乘末尾开始0的个数为q

求n的阶乘末尾开始连续0的个数的函数

int judge(ll n)			//求n的阶乘从末位开始连续0的个数 
{
	ll ans=0;
	while(n)
	{
		ans += n/5;
		n /= 5;
	}
	return ans;
}

代码

#include<cstdio>
#define inf 0x3f3f3f3f
#define ll long long
int judge(ll n)			//求n的阶乘从末位开始连续0的个数 
{
	ll ans=0;
	while(n)
	{
		ans += n/5;
		n /= 5;
	}
	return ans;
}
int main()
{
	ll t,k=0;	
	scanf("%lld",&t);
	while(t--)
	{
		ll q;
		scanf("%lld",&q);
		printf("Case %lld: ",++k);
		ll l=0,r=inf,mid;
		while(l <= r)
		{
			mid = (l + r)/2;
			if(judge(mid) >= q)			//0的个数大于q减小区间，找出最小的n 
			{
				r = mid-1;
			}
			else
			{
				l = mid+1;
			}
		 } 
		 if(judge(l) == q)
		 	printf("%lld\n",l);
		 else
		 	printf("impossible\n");
	}
 }