lightoj-【1138 - Trailing Zeroes (III)】

最新推荐文章于 2019-07-14 10:50:05 发布

有梦就不怕痛

最新推荐文章于 2019-07-14 10:50:05 发布

阅读量296

点赞数

分类专栏：二分

本文链接：https://blog.csdn.net/Cai_Nia/article/details/52294448

版权

二分专栏收录该内容

11 篇文章 0 订阅

订阅专栏

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

Case 1: 5

Case 2: 10

Case 3: impossible

<span style="font-size:18px;">#include<cstdio>
#define max 0x7f7f7f7f
#define LL long long
LL n;
LL judge(LL mid)
{
	LL sum=0,i;
	while(mid)
	{
		sum+=mid/5;
		mid/=5;
	}
	return sum;
}
int main()
{
	int t,text=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld",&n);
		printf("Case %d: ",text++);
		LL left=0,right=max,mid;
		while(left<=right)
		{
			mid=(right+left)>>1;//到了最后left和right值肯定相等这时的mid也就是最优解 
			if(judge(mid)>=n)//我们的条件是满足的话right=mid-1;那么跳出循环时 
			{				//left是最优解 
				right=mid-1;
			}
			else
			{
				left=mid+1;
			}
		}
		if(judge(left)==n)
			printf("%lld\n",left);
		else
			printf("impossible\n");
	}
	return 0;
}</span>