Here's the question you clicked on:
liliy
using dynamic programming. how would i find the least amount of perfect squares that go into a number? ie: input: 60,000 output: 3. [136^2 + 140^2 + 148^2 ]
i can tell u on C language or c++ .. u can get idea from there.. if ok the tell me