Acmer 加油，贪心吗

今天我要开始我的博客生涯了，让愉快的小程序来抚慰俺的小心灵吧，今天AC一题在大家看起来很简单的题，但在我看来却不是，想想自己水平，突然又有学下去的动力了，哈哈。     题目如下：

Description

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.

Input

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.

Output

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).

Sample Input

Input

2 15

Output

69 96

Input

3 0

Output

-1 -1

//2015.1.16 寒假集训 #include<iostream> #include<cstdio> #include<cstring> using namespace std; int s1[105], s2[105]; void ff(int m) { for(int i=0;i<=m;i++) { s1[i]=0; s2[i]=0; } } int main() { int m,s,fg=1; while(scanf("%d%d",&m,&s)!=EOF) { ff(m); if(m==1&&s==0) {printf("%d %d\n",0,0); //一直遗漏了这种情况，唉分类讨论很重要， fg=0; } if (fg&&m==1&&s<10 printf="" d="" d="" n="" s="" s="" fg="0;" if="" fg="" s="=0||s">9*m) { printf("%d %d\n",-1,-1); fg=0; } if(fg&&s<9 m="">1&&s>0) { s1[0]=s; s2[0]=1; for(int i=1;i<m;i++) { s1[i]=0; s2[i]=0; } s2[m-1]=s-1; for(int i=0;i<m;i++) printf("%d",s2[i]); printf(" "); for(int i=0;i<m;i++) printf("%d",s1[i]); printf("\n"); fg=0; ff(m); } if(fg) { int k=s; for(int i=0;i<m;i++) { s1[i]=9; s=s-s1[i]; if(s<=9) { s1[i+1]=s; break; } } s=k; for(int i=m-1;i>=0;i--) { s2[i]=9; s=s-s2[i]; if(s<9) { s2[i-1]=s; break; } } for(int i=0;i<m i="" if="" s2="" 0="">0)break; if(s2[i]>0&&i>0) { s2[i]=s2[i]-1; s2[0]=1; } } for(int i=0;i<m;i++) printf("%d",s2[i]); printf(" "); for(int i=0;i<m;i++) printf("%d",s1[i]); printf("\n"); ff(m); } fg=1; } return 0; } </m></9></10></cstring></cstdio></iostream>

自己要走的路还有好久额，明天快乐