All Combinations of perfect Squares in a number

Find all combinations of perfect squares and give the one with the least amount of numbers
Index representing (i+1)^2

13 could be represented as:

[0,1,1] // 1+1=2 LEAST

[4,0,1] // 4+1 =5

[1,3] //3+1=4

[5,2] // 5+2=7

[9,1] // 9+1 = 10

I can't tell if this is a spam thread or not.

Incase it is not. Ok? Do you want something? Do you want someone to make the program for you? Please post in the job section and say how much you are willing to pay. Do you need help with something? Then perhaps you should ask a question.

http://www.cplusplus.com/forum/beginner/1/
Last edited on
Topic archived. No new replies allowed.