Light OJ-----1138二分

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

给一个数x，是指一个数n的阶乘包含x个0，其实就是求5的个数，因为只有5才会出现0(10 = 5*2)，2比5出现的频繁，所以有5就有2，只算5就行了

直接二分

#include<cstdio>
long long N = 0x7fffffff;
long long nu(long long a){
	long long num = 0;
	while(a > 0){
		a /= 5;
		num += a;
	}
	return num;
}
void two(int t){
	long long s, e, m;
	s = 0;
	e = N;
	while(s <= e){
		m = (s + e) >> 1;
		if(nu(m) == t){
			printf("%lld\n", m / 5 * 5);
			return;
		}
		else if(nu(m) > t){
			e = m-1;
		}
		else{
			s = m+1;
		}
	}
	printf("impossible\n");
}
int main(){
	int a, u, k = 1;
	scanf("%d", &a);
	while(a--){
		scanf("%d", &u);
		printf("Case %d: ", k++);
		two(u);
	}
	return 0;
}