Timeline for Project Euler Problem 11: largest product of 4 adjacent numbers
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 5, 2016 at 1:02 | history | edited | 200_success | CC BY-SA 3.0 |
grammar, spelling, and language
|
| Jun 4, 2016 at 23:11 | history | edited | Julien Palard | CC BY-SA 3.0 |
deleted 35 characters in body
|
| Jun 4, 2016 at 23:11 | comment | added | Julien Palard |
Oh you're completly right about my unnecessary conversion, I added it only to check if everything was right (added a print) ! And kept it by error. I fixed it in my answer, thanks! BTW I prefer my way which is far more readable than the reduce way. In fact, reduce has been dropped because for loops are more readable.
|
|
| Jun 4, 2016 at 21:49 | comment | added | Julien Palard | See docs.python.org/3/library/contextlib.html#contextlib.suppress it's just a short way to skip an ugly/empty try-except. | |
| Jun 4, 2016 at 21:46 | comment | added | Jamerack | Thank you very much for this! I don't know exactly what happened with the weird indentations on numberSequence, it's normal on my code. I have one questions about the suppress function you use, how exactly does that work? I'm guessing its name is pretty true to its function? | |
| Jun 4, 2016 at 21:36 | history | answered | Julien Palard | CC BY-SA 3.0 |