Timeline for Generalized Project Euler #4: Largest palindrome from product of two n-digit numbers in Python
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot | Commonmark migration | |
| Oct 28, 2016 at 0:20 | history | edited | 200_success | CC BY-SA 3.0 | edited title |
| Oct 27, 2016 at 21:20 | answer | added | gnasher729 | timeline score: 1 | |
| Oct 27, 2016 at 19:30 | history | edited | Jamal | CC BY-SA 3.0 | added 13 characters in body; edited title |
| Oct 27, 2016 at 18:33 | vote | accept | Amey Dahale | ||
| Oct 27, 2016 at 14:43 | history | tweeted | twitter.com/StackCodeReview/status/791651482445766657 | ||
| Oct 27, 2016 at 14:02 | comment | added | njzk2 | int(("9" * (digits+1))[:digits]); makes little sense. Use the same method as for the previous value: (10**digits)-1 | |
| Oct 27, 2016 at 12:39 | answer | added | Peilonrayz♦ | timeline score: 4 | |
| Oct 27, 2016 at 12:00 | answer | added | Peter Taylor | timeline score: 3 | |
| Oct 27, 2016 at 10:23 | answer | added | Tomasz Jakub Rup | timeline score: 7 | |
| Oct 27, 2016 at 10:16 | answer | added | Graipher | timeline score: 1 | |
| Oct 27, 2016 at 10:15 | comment | added | Grajdeanu Alex | Have in mind that whenever a product or combination or permutation is mentioned, you first check itertools which is pretty optimized for that kind of operations. | |
| Oct 27, 2016 at 10:13 | answer | added | Dair | timeline score: 1 | |
| Oct 27, 2016 at 8:20 | history | edited | Amey Dahale | CC BY-SA 3.0 | Result for 5 digit multipliers added. |
| Oct 27, 2016 at 7:24 | review | First posts | |||
| Oct 27, 2016 at 8:19 | |||||
| Oct 27, 2016 at 7:21 | history | asked | Amey Dahale | CC BY-SA 3.0 |