Codeforces Round #277.5 (Div. 2)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int a[105],b[105];

int main()
{
int m,n,i,j,c;
scanf("%d %d",&m,&n);
c=n;
if((m>1&&n==0)||(n>9*m)) printf("-1 -1\n");
else
{
for(i=m-1;i>=0;i--)
{
if(n>=9) a[i]=9;
else a[i]=n%9;
n=n-a[i];
}
n=c-1;
for(i=0;i<m;i++)
{
if(n>=9) b[i]=9;
else b[i]=n%9;
n=n-b[i];
}

b[m-1]=b[m-1]+1;

for(i=m-1;i>=0;i--)
printf("%d",b[i]);
printf(" ");
for(i=m-1;i>=0;i--)
printf("%d",a[i]);
printf("\n");
}
}