Codeforces Round #277.5 (Div. 2)-C_html/css_WEB-ITnose

简单细节题：

#include<iostream>#include<cstdio>#include<cmath>#include<map>#include<cstring>#include<algorithm>#define rep(i,a,b) for(int i=(a);i=(b);i--)#define clr(a,x) memset(a,x,sizeof a)typedef long long LL;using namespace std;const int mod=1e9 +7;const int maxn=105;const int maxm=905;int da[maxn],db[maxn];int main(){    int n,m;    while(~scanf("%d%d",&n,&m))    {        if(m>9*n||(n!=1&&m==0))        {            printf("-1 -1\n");            continue;        }        int cnt=0,ccnt=0,num=m;        while(num-9>=0)db[ccnt++]=9,num-=9;        if(num)db[ccnt++]=num;        while(n!=ccnt)db[ccnt++]=0;        num=m;        while(1=0;i--)                printf("%d",da[i]);            printf(" ");            for(int i=0;i<ccnt printf continue da while for i="cnt-1;i">=0;i--)            printf("%d",da[i]);        printf(" ");        for(int i=0;i<ccnt printf return>  <br>  <p></p>  <p class="sycode">   </p>
<p class="sycode">    </p>
<p class="sycode">     </p>
<p class="sycode">      </p>
<p class="sycode">       </p>
<p class="sycode">        </p>
<p class="sycode">         C. Given Length and Sum of Digits...        </p>        <p class="sycode">         </p>
<p class="sycode">          time limit per test         </p> 1 second                <p class="sycode">         </p>
<p class="sycode">          memory limit per test         </p> 256 megabytes                <p class="sycode">         </p>
<p class="sycode">          input         </p> standard input                <p class="sycode">         </p>
<p class="sycode">          output         </p> standard output                      <p class="sycode">        </p>
<p> You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.</p>              <p class="sycode">        </p>
<p class="sycode">         Input        </p>        <p> The single line of the input contains a pair of integers m, s (1?≤?m?≤?100,?0?≤?s?≤?900) ? the length and the sum of the digits of the required numbers.</p>              <p class="sycode">        </p>
<p class="sycode">         Output        </p>        <p> In the output print the pair of the required non-negative integer numbers ? first the minimum possible number, then ? the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers "-1 -1" (without the quotes).</p>              <p class="sycode">        </p>
<p class="sycode">         Sample test(s)        </p>        <p class="sycode">         </p>
<p class="sycode">          </p>
<p class="sycode">           input          </p>          <pre style="代码" class="precsshei">2 15

output

69 96

input

3 0

output

-1 -1