1 #include <iostream>
  2 #include <cstdio>
  3 #include <string>
  4 #include <vector>
  5 #include <cstdlib>
  6
  7 using namespace std;
  8
  9 int max_sum;
 10
 11 int res_sum;
 12 vector<int> res_path;
 13 int count;
 14
 15 int sum;
 16 vector<int> path;
 17
 18
 19 void dfs(string str)
 20 {
 21     //for(int v_i = 0; v_i < path.size(); ++v_i) cout << path[v_i] << " "; cout << "(" << str << ")(" << sum << ")";cout << endl;
 22     if(str.size() == 0)
 23     {
 24
 25         if(sum <= max_sum && sum == res_sum)
 26         {
 27             ++count;
 28             //res_path.clear();
 29             //for(int v_i = 0; v_i < path.size(); ++v_i) res_path.push_back(path[v_i]);
 30             //for(int v_i = 0; v_i < path.size(); ++v_i) cout << path[v_i] << " "; cout << "(" << str << ")(" << sum << ")";cout << endl;
 31             res_path = path;
 32         }
 33         else if(sum <= max_sum && sum > res_sum)
 34         {
 35             res_sum = sum;
 36             count = 1;
 37             //for(int v_i = 0; v_i < path.size(); ++v_i) cout << path[v_i] << " "; cout << "(" << str << ")(" << sum << ")";cout << endl;
 38             res_path = path;
 39             //res_path.clear();
 40             //for(int v_i = 0; v_i < path.size(); ++v_i) res_path.push_back(path[v_i]);
 41         }
 42         return;
 43     }
 44
 45     for(int i = str.size() - 1; i >= 0; --i)
 46     {
 47         string str_left = str.substr(0,i);
 48         string str_right = str.substr(i);
 49
 50         int left = atoi(str_left.c_str());
 51         int right = atoi(str_right.c_str());
 52
 53         //剪枝
 54         if(sum + right > max_sum) continue;
 55
 56         //剪枝二
 57         if(res_sum == max_sum && count > 1) break;
 58
 59         sum += right;
 60         path.push_back(right);
 61
 62         dfs(str_left);
 63
 64         sum -= right;
 65         path.pop_back();
 66     }
 67
 68     return;
 69 }
 70
 71 int main()
 72 {
 73     //freopen("C://input.txt","r",stdin);
 74
 75     string str;
 76     cin >> max_sum >> str;
 77
 78     while(max_sum != 0 || str.size() != 1 || str[0] != '0')
 79     {
 80         int num = atoi(str.c_str());
 81         if(num <= max_sum)
 82         {
 83             cout << num << " " << num << endl;
 84         }
 85         else
 86         {
 87             sum = 0;
 88             path.clear();
 89
 90             res_sum = -1;
 91
 92             dfs(str);
 93
 94             if(res_sum == -1) cout << "error" << endl;
 95             else if(count > 1) cout << "rejected" << endl;
 96             else
 97             {
 98                 cout << res_sum;
 99                 for(int i = res_path.size() - 1; i >= 0; --i) cout << " " << res_path[i];
100                 cout << endl;
101             }
102         }
103
104
105
106         cin >> max_sum >> str;
107     }
108
109     return 0;
110 }