C - 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! = 1*2*...*N. For example, 5! = 120, 120 contains one zero on the trail.
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.
For each case, print the case number and N. If no solution is found then print 'impossible'.
3
1
2
5
Case 1: 5
Case 2: 10
Case 3: impossible
#include<cstdio>
#include<algorithm>
using namespace std;
long long Sum(long long m)
{
long long ans=0;
while(m)
{
ans+=m/5;
m/=5;
}
return ans;
}
int main()
{
int h=1,n; scanf("%d",&n);
while(n--)
{
long long q,ans=0;
scanf("%lld",&q);
long long left=1,right=1000000000000,mid;
while(left<=right)
{
mid=(left+right)/2;
if(Sum(mid)==q)
{
ans=mid;
right=mid-1;
}
else if(Sum(mid)>q)
right=mid-1;
else
left=mid+1;
}
printf("Case %d: ",h++);
if(ans)
printf("%lld\n",ans);
else
printf("impossible\n");
}
return 0;
}