给你m,s,分别代表构成数字的长度和值。
例如m=2,s=15,这样可以构成69 , 78,87,96..等等数字。我们只用求出最小的这种数和最大的这种数就行了。
样例则输出69 96
首先判断给定的m,s能否满足结果的输出,也就是 s<=m*9 ,以及当s = 0 的时候,m的情况。
然后如果满足条件,直接贪心就可以了,从首位开始输出,分别尽量取小,尽量取大就行了。注意去最小的时候注意处理前导0;
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#define PI acos(-1.0)
#define maxn (20000 + 50)
#define MOD 1000000009
#define INF 0x3f3f3f3f
#define Lowbit(x) (x & (-x))
#define mem(a,x) memset(a,x,sizeof(a))
#define Read() freopen("in.txt", "r", stdin);
#define Write() freopen("out.txt", "w", stdout);
#define bitnum(a) __builtin_popcount(a)
using namespace std;
typedef long long int ll;
inline int in()
{
int res=0;char c;int f=1;
while((c=getchar())<'0' || c>'9')if(c=='-')f=-1;
while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
return res*f;
}
int main()
{
char ans[111];
int m = in();
int s = in();
if(s == 0){
if(m == 1)
printf("0 0\n");
else
printf("-1 -1\n");
}
else if(s > m *9){
printf("-1 -1\n");
}
else{
int M = s;
for(int i=0;i<m;i++){
int tmp = M - (m-i-1)*9; //假设后面的位数都取9,
int c;
if(tmp < 0)
c = 0;
else
c = tmp;
if(c == 0 && i == 0) //前导0<span style="display: none; width: 0px; height: 0px;" id="transmark"></span>
c = 1;
M -= c;
ans[i] = c + '0';
//cout<<c<<" "<<i<<endl;
}
ans[m] = '\0';
printf("%s ",ans);
M = s;
for(int i=0;i<m;i++){
int c;
if(M > 9)
c = 9;
else
c = M;
M-=c;
ans[i] = c + '0';
}
ans[m] = '\0';
printf("%s\n",ans);
}
return 0;
}