http://codeforces.com/problemset/problem/489/C Given Length and Sum of Digits...

深搜搞一下就好，小的数自然高位要取尽量小的，大的数高位取尽量大的。

#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#define MAX 105
#define INF 0x3f3f3f3f
using namespace std;
int m, s, a1[105],a2[105], l, r, p;
bool f1, f2;
void dfs1(int i,int t) {
    if (t < 0) return;
    if (t > (m - i + 1) * 9)return;
    if (i == m + 1) {
        if(t == 0) f1 = true;
        return;
    }
    for (int k = l; k <= r; k += p) {
        a1[i] = k;
        dfs1(i + 1, t - k);
        if (f1) return;
    }
}
void dfs2(int i, int t) {
    if (t < 0) return;
    if (t > (m - i + 1) * 9)return;
    if (i == m + 1) {
        if (t == 0) f2 = true;
        return;
    }
    for (int k = l; k >= r; k += p) {
        a2[i] = k;
        dfs2(i + 1, t - k);
        if (f2) return;
    }
}
int main() {
    freopen("a.txt", "r", stdin);
    freopen("b.txt", "w", stdout);
    cin >> m >> s;
    if (m == 1 && s == 0) {
        cout << "0 0";
        return 0;
    }
    l = 0, r = 9, p = 1;
    for(int i = 1;i <= 9;++i){
        a1[1] = i;
        dfs1(2, s - i);
        if (f1) break;
    }
    if (!f1) {
        cout << "-1 -1" << endl;
        return 0;
    }
    l = 9, r = 0, p = -1;
    for (int i = 9; i >= 1; --i) {
        a2[1] = i;
        dfs2(2, s - i);
        if (f2) break;
    }
    if (!f2) {
        cout << "-1 -1" << endl;
        return 0;
    }
    for (int i = 1; i <= m; ++i) {
        printf("%d", a1[i]);
    }
    putchar(' ');
    for (int i = 1; i <= m; ++i) {
        printf("%d", a2[i]);
    }
    return 0;
}