构造水题 Codeforces Round #206 (Div. 2) A. Vasya and Digital Root

题目传送门

 /*
     构造水题：对于0的多个位数的NO，对于位数太大的在后面补0，在9×k的范围内的平均的原则
 */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 using namespace std;

 const int MAXN = 1e3 + ;
 const int INF = 0x3f3f3f3f;
 int a[MAXN];

 int main(void)        //Codeforces Round #206 (Div. 2) A. Vasya and Digital Root
 {
     //freopen ("A.in", "r", stdin);
     int k, d;
     while (scanf ("%d%d", &k, &d) == )
     {
         if (d ==  && k > )    {puts ("No solution");    continue;}
         if (k >= d)
         {
             for (int i=; i<=d; ++i)    putchar ('');
             for (int i=; i<=k-d; ++i)    putchar ('');
             puts ("");
         }
         else
         {
             if ( * k < d)    {puts ("No solution");    continue;}
             for (int i=; i<=k; ++i)    a[i] = d / k;
             int res = d % k;
             for (int i=; i<=res; ++i)    a[i]++;
             for (int i=; i<=k; ++i)    printf ("%d", a[i]);
             puts ("");
         }

     }

     return ;
 }