(July 3, 2016 at 10:24 pm)SteelCurtain Wrote: Well, after my code for #12 ran for about 3 hours on my monster machine, I got the right answer...
Not exactly efficient, but it worked... :S
If this is still on an online IDE, this must be a good one. 3 hours is very impressive.
Since you solved the triangle number problem, did you just count all the factors less than sqrt(n), where n represents each triangle number checked? And multipled by two for non-perfect squares, and additionally added a 1 for perfect squares?