Given a positive integer, n, return a, b, c and d, such that
1. n = a*sqrt(b)+c*sqrt(d)
2. a, b, c and d are all positive integers greater than 1
If a solution does not exist, set all four output variables to zero.
Example 1:
n = 41
a = 5
b = 16
c = 7
d = 9
Example 2:
n = 6
a = 0
b = 0
c = 0
d = 0
4845 Solvers
794 Solvers
Return unique values without sorting
488 Solvers
68 Solvers
Generate a string like abbcccddddeeeee
155 Solvers
Solution 882238
Heh...a 24 point increase in Cody Size is what I get for doing the loops efficiently. :-)