N - 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

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

3

1

2

5

Sample Output

Case 1: 5

Case 2: 10

Case 3: impossible

题意：给你一个数Q，范围（1~10^8）,则n!的阶乘的末尾有Q个0，求最小的n。

这个题有一个规律，n的阶乘末尾0的个数为从（1~n）n个数中5的因子个数和，也即while（n）

{

ans+=n/5;

n=n/5

}

中ans的值，知道这一规律，我们就该想到普通的for循环一定会超时，而上面的规律

正好可以使用二分查找，很方便。

#include <stdio.h>
#include <string.h>
typedef long long ll;
ll F(ll n)
{
    int ans=0;
    while(n)
    {
        ans+=n/5;
        n/=5;
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        ll L=10000000000,R=0,mid,term,n,k;
        scanf("%lld",&n);
        while(R<=L)
        {
            mid=(L+R)/2;
            term=F(mid);
            if(term>n)
                L=mid-1;
            else if(term<n)
                R=mid+1;
            else if(term==n)
                break;

        }
        if(term==n)
            printf("Case %d: %lld\n",i,mid-mid%5);
        else printf("Case %d: impossible\n",i);
    }
    return 0;
}