1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int stoa(string s) {
int ret = 0, t = 1;
for(int i = s.size()-1; i >= 0; i--) {
ret += (s[i] - '0') * t;
t *= 10;
}
return ret;
}
int n;
string s;
int vmin = INF, vmax = 0, ans = 0, cnt = 0;
vector<int> res;
void dfs(int i, int sum, vector<int> v) {
if(i == s.size()) {
vmin = min(vmin, sum);
vmax = max(vmax, sum);
if(sum <= n) {
if(ans < sum) {
ans = sum;
cnt = 1;
res.clear();
rep(i, v.size()) res.push_back(v[i]);
} else if(ans == sum) {
cnt++;
}
}
return;
}
REP(j, 1, s.size() + 1) {
if(i + j <= s.size() ) {
vector<int> t(v.begin(), v.end());
t.push_back(stoa(s.substr(i, j)));
dfs(i + j, sum + stoa(s.substr(i, j)), t);
} else return;
}
}
int main() {
while(cin >> n >> s) {
if(n == 0 && s == "0") break;
vmin = INF, vmax = 0, ans = 0, cnt = 0;
res.clear();
vector<int> v;
dfs(0, 0, v);
if(vmin > n) {
cout << "error" << endl;
} else if(cnt >= 2) {
cout << "rejected" << endl;
} else {
cout << ans;
rep(i, res.size()) {
cout << " " << res[i];
}
cout << endl;
}
}
return 0;
}
|