Timeline for Counting primes in a range whose digits are all prime
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2019 at 6:00 | history | tweeted | twitter.com/StackCodeReview/status/1098824808131952641 | ||
| Feb 21, 2019 at 19:47 | comment | added | Matthieu M. |
Note: once you have determined low, high cannot possibly be before it... therefore only searching primes[low:] could be faster!
|
|
| Feb 21, 2019 at 15:12 | vote | accept | Tobi Alafin | ||
| Feb 21, 2019 at 14:40 | history | edited | 200_success | CC BY-SA 4.0 |
added 145 characters in body; edited title
|
| Feb 21, 2019 at 14:39 | answer | added | 301_Moved_Permanently | timeline score: 10 | |
| Feb 21, 2019 at 14:24 | comment | added | 301_Moved_Permanently | You can answer it, there are more to improve than a change in comparison operator. | |
| Feb 21, 2019 at 13:52 | comment | added | Tobi Alafin |
I figured out the problem with this question. It was literally a missing token (well I checked for > instead of >= in my upper bounds check because I thought it was an inclusive upper bound while it was in reality exclusive. Should I delete my question or answer it.
|
|
| Feb 21, 2019 at 13:27 | history | asked | Tobi Alafin | CC BY-SA 4.0 |