• + 1 comment

    I think this is the best solution.

    • + 0 comments

      i don't really know, for example, we have 800, the square root is 28.3, we can take int 28, it means each number square higher than 28 results higher than 800, so, we can only take numbers <28, i don't think that we can find 561 combinations of unique square numbers between 1 and 28.