递归_百炼 2803 碎纸机

#define _CRT_SECURE_NO_WARNINGS  
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <iostream>
#include <ctype.h>
#include <string.h>
#include <set>
#include <stack>
#include<functional>
using namespace std;
#define Size 10
#define maxn  1<<30
#define minn  1e-6
int ans[Size];
int temp[Size];
int a[Size];
int targetNum;
char str[Size];
int numLen;
int optimum;
int ansLen;
int reject = 0;
void  solve(int total, int aPos, int tempPos){
    if (total > targetNum) return;
    if (aPos == numLen){
        if (total == optimum) reject++;
        if (total > optimum){
            optimum = total;
            reject = 0;
            for (int i = 0; i < tempPos; i++){
                ans[i] = temp[i];
            }
            ansLen = tempPos;
        }
        return;
    }
    
    int assemble = 0;
    for (int i = aPos; i < numLen; i++){
        assemble *= 10;
        assemble += a[i];
        temp[tempPos] = assemble;
        solve(total + assemble, i + 1, tempPos + 1);
    }
}
void init(){
    optimum = 0;
}
int main(){
    while (cin >> targetNum ){
        if (targetNum == 0) break;
        init();
        cin >> str;
        int str2num = 0;
        numLen = strlen(str);
        int total = 0;
        for (int i = 0; i < numLen; i++){
            str2num *= 10;
            str2num += str[i] - '0';
            a[i] = str[i] - '0';
            total += a[i];
        }
        if (str2num == targetNum) {
            cout << str2num << " " << str2num << endl;
            continue;
        }
        if (total > targetNum) {
            cout << "error" << endl;
            continue;
        }
        solve(0, 0, 0);
        if (reject){
            cout << "rejected" << endl;
            continue;
        }
        cout << optimum;
        for (int i = 0; i < ansLen; i++)
            cout << " " << ans[i];
        cout << endl;
    }
    return 0;
}