How to solve the problem sumset on poj?
Difference between en1 and en2, changed 23 character(s)
I tried to solve the problem sumset by the idea of coin change. But i am getting Run time error.I know there's an another way to solve the problem. As I am new to dp i am facing difficulties to think how to approach this problem.↵
sorry for bad english↵

Problem description : how many ways to get the number 1<=n<=1000000 by the sum of 2's power.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English BeNew 2020-03-30 19:36:42 49
en2 English BeNew 2020-03-30 19:31:15 23 Tiny change: 'problem.\n\nProble' -> 'problem.\nsorry for bad english\n\nProble'
en1 English BeNew 2020-03-30 18:08:57 364 Initial revision (published)