BeNew's blog

By BeNew, history, 3 years ago, In English

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 Link: Problem description : how many ways to get the number 1<=n<=1000000 by the sum of 2's power.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it