思路:二分统计5的个数
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int32_t N = 1e7 + 10;
int t, n;
int f5(int x) { //统计当前数中5的个数
int ans = 0;
while(x) {
ans += x / 5;
x = x / 5;
}
return ans;
}
int32_t main() {
cin >> t;
int s = 1;
while(t--) {
cin >> n;
int l = 1, r = 1000000000;
while(l <= r) {
int m = (l + r) >> 1;
if(f5(m) < n)
l = m + 1;
else
r = m - 1;
}
if(f5(l)==n)
printf("Case %lld: %lld\n", s++, l);
else
printf("Case %lld: impossible\n", s++);
}
return 0;
}