lightoj1138

二分

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define C 0.5772156649
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;
const int N=+,maxn=+,inf=0x3f3f3f;

ll getzero(ll k)
{
    ll ans=;
    while(k){
        ans+=k/;
        k/=;
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    ll t,cnt=;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        ll l=,r=;
        while(l<=r){
            ll m=(l+r)/;
            if(getzero(m)<n)l=m+;
            else r=m-;
        }
        if(getzero(l)==n)cout<<"Case "<<++cnt<<": "<<l<<endl;
        else cout<<"Case "<<++cnt<<": impossible"<<endl;
    }
    return ;
}
/*********************
100000000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
*********************/