poj1416

#include<iostream>
using namespace std;

int target,datanum;
int road[],temproad[];
int N,flag,maxsum;
int data[],datatemp[];
int tail;

void cun(int n)
{
    tail=;

    while(n/)
    {
        int m=n%;
        n=n/;
        datatemp[tail++]=m;
    }
    datatemp[tail++]=n%;
    for(int i=;i<tail;i++)
        data[i]=datatemp[tail-i-];
    return;
}

void dfs(int n, int step, int sum, int tobe)
{
    if(sum>target)
        return;

    if(n==N-)
    {
        sum=sum+tobe*+data[N-];
        temproad[step]=tobe*+data[N-];
        if(sum>target)
            return;
        if(sum==maxsum)
            flag=;
        else if(sum>maxsum)
        {
            for(int i=;i<;i++)
                road[i]=-;
            flag=;
            maxsum=sum;
            for(int i=;i<=step;i++)
                road[i]=temproad[i];
        }
        return;
    }

    temproad[step]=tobe*+data[n];
    dfs(n+,step+,sum+tobe*+data[n],);//切
    temproad[step]=-;

    dfs(n+,step,sum,tobe*+data[n]);
}

int main()
{
    //freopen("input.txt","r",stdin);
    while()
    {
        cin>>target>>datanum;
        //cout<<target<<alldata<<endl;
        if(target==&&datanum==)
            break;
        if(target==datanum)
        {
            cout<<target<<' '<<target<<endl;
            continue;
        }
        for(int i=;i<;i++)
            data[i]=-;
        cun(datanum);
        N=tail;

        maxsum=-;
        flag=;
        for(int i=;i<;i++)
        {
            road[i]=-;
            temproad[i]=-;
        }
        dfs(,,,);
        if(maxsum==-)
            cout<<"error"<<endl;
        else if(flag==)
            cout<<"rejected"<<endl;
        else
        {
            cout<<maxsum<<' ';
            for(int i=;i<;i++)
            {
                if(road[i]!=-)
                    cout<<road[i]<<' ';
            }
             cout<<endl;
        }
    }
    return ;
}