Please look at problem here. I figured out how to do it: 1. I will check among all possible quasibinary numbers which provides me least numbers of such numbers whose sum is equal to n(the given number) 2. I memoize the solution. Basic DP stuff. 3. In all my tests I got correct answer for number of numbers but I can't construct the solution i.e actual numbers which form the solution. Can you help me with this.
I have submitted my solution here
Save curr in an array and then trace back the numbers that you chose. Something like
int cur = n;
while(cur){
ans.push_back(saved[cur]);
cur -= saved[cur];
}
Do smth like that
int powten = 1;
Then output cnt then newline and array ans