Timeline for Optimizing solution for Project Euler Problem #23 (non-abundant sums)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2014 at 19:49 | vote | accept | Mohammad Areeb Siddiqui | ||
| Aug 24, 2014 at 19:48 | comment | added | Mohammad Areeb Siddiqui |
you could've just added a check to yield n / i only if i < n / i :)
|
|
| Aug 24, 2014 at 19:44 | comment | added | amon |
@MohammadAreebSiddiqui Thanks for pointing that out. It seems I was too distracted by interesting number theory to write a correct divisors() implementation. That's kind of embarrassing. Anyway, it's fixed now and passed the projecteuler.net test.
|
|
| Aug 24, 2014 at 19:41 | history | edited | amon | CC BY-SA 3.0 |
tested & fixed code
|
| Aug 24, 2014 at 18:25 | comment | added | Mohammad Areeb Siddiqui | Your code is not working. | |
| Jan 24, 2014 at 11:01 | vote | accept | Mohammad Areeb Siddiqui | ||
| Aug 24, 2014 at 18:24 | |||||
| Jan 24, 2014 at 10:42 | history | answered | amon | CC BY-SA 3.0 |