#pragma comment(linker, "/STACK:10240000,10240000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
long long ans[1234], MI[12], X;
int cnt;
int length( long long x) {
int ans = 0;
while (x) {
ans ++;
x /= 10;
}
return ans;
}
void solve( long long L, long long a, long long b) {
long long ga = (a * X - b * MI[6]) * MI[L + 1] + b * X - a * MI[6];
long long gb = MI[7] - X * 10, K = ga / gb;
if (ga % gb == 0 && K >= 0 && length(K) <= L) ans[cnt ++] = a * MI[L + 1] + K * 10 + b;
}
int main() {
#ifndef ONLINE_JUDGE
freopen ( "in.txt" , "r" , stdin);
#endif // ONLINE_JUDGE
MI[0] = 1;
for ( int i = 1; i < 12; i ++) MI[i] = MI[i - 1] * 10;
int T, cas = 0;
cin >> T;
while (T --) {
printf ( "Case #%d:\n" , ++ cas);
double x;
cin >> x;
X = ( long long )(x * MI[6] + 0.1);
if (X == MI[6]) {
cout << 0 << endl;
continue ;
}
cnt = 0;
for ( int L = 0; L < 9; L ++) {
for ( int a = 1; a < 10; a ++) {
for ( int b = 0; b < 10; b ++) {
solve(L, a, b);
}
}
}
cout << cnt << endl;
for ( int i = 0; i < cnt; i ++) {
printf ( "%I64d%c" , ans[i], i == cnt - 1? ‘\n‘ : ‘ ‘ );
}
}
return 0;
}
|