http://lightoj.com/volume_showproblem.php?problem=1138
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 ≤ 108) 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 |
PROBLEM SETTER: JANE ALAM JAN
首先要知道求一个数阶乘末尾零个数的函数
再接着二分枚举就好啦
#include<bits/stdc++.h>
#define LL long long
#define MAXN 100+10
#define MAXM 20000+10
#define INF 0x3f3f3f3f
using namespace std;
LL sum(LL N)//求N阶乘中 末尾连续的0的个数
{
LL ans = 0;
while(N)
{
ans += N / 5;
N /= 5;
}
return ans;
/*
ans+=n/5;
n/=5;
*/
}
int k = 1;
int main()
{
int t;
LL Q;
scanf("%d", &t);
while(t--)
{
scanf("%lld", &Q);
LL left = 1, right = 1000000000000;
LL ans = 0;
while(right >= left)
{
int mid = (left + right) >> 1;
if(sum(mid) == Q)//相等时 要赋值给ans
{
ans = mid;//保留一下答案;
right = mid - 1;//因为是求最小的,所以让right变小一下;
}
else if(sum(mid) > Q)
right = mid - 1;
else
left = mid + 1;
}
printf("Case %d: ", k++);
if(ans)
printf("%lld\n", ans);
else
printf("impossible\n");
}
return 0;
}