Timeline for Project Euler problem #112
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 7, 2019 at 8:29 | vote | accept | Stokolos Ilya | ||
Sep 7, 2019 at 7:49 | comment | added | sanyassh | @AlexV yeah, my mistake :) 2178 non-bouncy and 19602 bouncy. | |
Sep 7, 2019 at 7:36 | comment | added | AlexV | @sanyash: That would be 10% then. The task states that exactly 90% are bouncy numbers below 21780, which would be about 19,602 then. Right? | |
Sep 7, 2019 at 6:43 | comment | added | sanyassh | Actually, it is better to start from 21780 given from the problem statement that there are 2178 bouncy numbers among them. | |
Sep 6, 2019 at 15:28 | history | edited | AlexV | CC BY-SA 4.0 |
edited body
|
Sep 6, 2019 at 15:28 | comment | added | AlexV | @GZ0: you're correct. Will fix it :-) | |
Sep 6, 2019 at 15:07 | comment | added | GZ0 |
number != sorted_digits[::-1] should be digits != sorted_digits[::-1]
|
|
Sep 6, 2019 at 14:02 | history | answered | AlexV | CC BY-SA 4.0 |