Please look at problem [here](http://codeforces.com/problemset/problem/538/B). I figured out how to do it:↵
1. I will check among all possible quasibinary numbers which provides me least numbers odf such numbers whose sum is equal to n(the given number)↵
2. I memoize the solution. BasicdpDP 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](http://codeforces.com/contest/538/submission/23388905)↵
1. I will check among all possible quasibinary numbers which provides me least numbers o
2. I memoize the solution. Basic
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](http://codeforces.com/contest/538/submission/23388905)↵