Trailing Zeroes (III) LightOJ - 1138

题目链接：https://cn.vjudge.net/problem/LightOJ-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

3

1

2

5

Sample Output

Case 1: 5

Case 2: 10

Case 3: impossible

题意：给你一个n问你多少的阶乘末尾0位n个。

思路：n的阶乘后有多少个0判断n的阶乘种有多少个5相乘即可，然后用二分查找这个数。

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int zhao(int x)
{
    ll res=0;
    while(x)
    {
        res+=x/5;
        x=x/5;
    }
    return res;
}
int main()
{
    ll t;
    scanf("%lld",&t);
    for(ll kcase=1;kcase<=t;kcase++)
    {
        ll n,res=-1;
        scanf("%lld",&n);
        ll l=1,r=500000000;
        while(l<=r)
        {
            ll mid=(l+r)/2;
            if(zhao(mid)==n)
            {
                res=mid;
                r=mid-1;
            }
            else if(zhao(mid)>n)
            {
                r=mid-1;
            }
            else
            {
                l=mid+1;
            }
        }
        if(res!=-1)
        cout<<"Case "<<kcase<<": "<<res<<endl;
        else
        cout<<"Case "<<kcase<<": "<<"impossible"<<endl;
    }
}