[csu1392]YY一下

题意：给定x，求有多少个10^8以内的数满足这个数乘以x以后，最高位到了最低位。设最高位的数字和剩余长度，列等式推理即可。

 #pragma comment(linker, "/STACK:10240000,10240000")

 #include <iostream>
 #include <cstdio>
 #include <algorithm>
 #include <cstdlib>
 #include <cstring>
 #include <map>
 #include <queue>
 #include <deque>
 #include <cmath>
 #include <vector>
 #include <ctime>
 #include <cctype>
 #include <set>

 using namespace std;

 #define mem0(a) memset(a, 0, sizeof(a))
 #define lson l, m, rt << 1
 #define rson m + 1, r, rt << 1 | 1
 #define define_m int m = (l + r) >> 1
 #define Rep(a, b) for(int a = 0; a < b; a++)
 #define lowbit(x) ((x) & (-(x)))
 #define constructInt4(name, a, b, c, d) name(int a = 0, int b = 0, int c = 0, int d = 0): a(a), b(b), c(c), d(d) {}
 #define constructInt3(name, a, b, c) name(int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) {}
 #define constructInt2(name, a, b) name(int a = 0, int b = 0): a(a), b(b) {}

 typedef double db;
 typedef long long LL;
 typedef pair<int, int> pii;
 typedef multiset<int> msi;
 typedef multiset<int>::iterator msii;
 typedef set<int> si;
 typedef set<int>::iterator sii;
 typedef vector<int> vi;

 const int dx[] = {, , -, , , , -, -};
 const int dy[] = {, -, , , -, , , -};
 const int maxn = 1e5 + ;
 const int maxm = 1e5 + ;
 const int maxv = 1e7 + ;
 const int MD = 1e9 +;
 const int INF = 1e9 + ;
 const double PI = acos(-1.0);
 const double eps = 1e-;

 int digit(LL x) {
     int cnt = ;
     while (x) {
         cnt++;
         x /= ;
     }
     return cnt;
 }

 int main() {
     //freopen("in.txt", "r", stdin);
     double tx;
     while (cin >> tx) {
         LL x = (int)(tx *  + 0.5), get = ;
         if (x >= ) {
             puts("No solution");
             continue;
         }
         LL p = ;
         for (int i = ; i <= ; i++) {
             for (int k = ; k <= ; k++) {
                 LL tmp = k * (x * p - 1e4);
                 if (tmp % (LL)(1e5 - x)) continue;
                 tmp /= 1e5 - x;
                 if (digit(tmp) == i) {
                     printf("%d", k);
                     if (tmp > ) printf("%d", tmp);
                     puts("");
                     get = ;
                 }
             }
             p *= ;
         }
         if (!get) puts("No solution");
     }
     return ;
 }