简单数学-题解-Trailing Zeroes (III)

Trailing Zeroes (III)

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! = 12…*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 ≤ 108) in a line.

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

Sample Input
3

1

2

5

Sample Output
Case 1: 5

Case 2: 10

Case 3: impossible

用二分找

#include<iostream>
#include<cstdio>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;

long long f(long long m){
	long long ans=0;
	while(m>=5){
		ans+=m/5;
		m/=5;
	}
	return ans;
}


int main ()
{
	int t,o=1;
	scanf("%d",&t);
	while(t--){
		long long q;
		scanf("%lld",&q);
//		printf("%lld\n",f(q));
		long long i=4,j=4000000000000000025;
		while(j-i>1){
			long long mid=(i+j)>>1;
			if(f(mid)>=q) j=mid;
			else i=mid;
		}
		if(f(j)==q)
			printf("Case %d: %lld\n",o++,j);
		else
			printf("Case %d: impossible\n",o++);
	}
	return 0 ;
}