Timeline for Project Euler #15: counting paths through a 20 × 20 grid
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2018 at 6:42 | comment | added | austingae | Another solution to this problem is to use the combination formula -> n!/k!(n-k)! Also, I think the programmer's point of view is to find the simplest solution to the problem. | |
| Jul 15, 2018 at 5:43 | answer | added | Snowhawk | timeline score: 5 | |
| Jul 14, 2018 at 17:07 | answer | added | Edward | timeline score: 4 | |
| Jul 14, 2018 at 15:53 | comment | added | MooseBoys | It's worth mentioning that the "programmer's point of view" should include mathematical simplification of algorithms. | |
| Jul 14, 2018 at 14:58 | history | tweeted | twitter.com/StackCodeReview/status/1018147673285816320 | ||
| Jul 14, 2018 at 13:45 | vote | accept | Gentlebud | ||
| Jul 14, 2018 at 13:41 | history | edited | 200_success | CC BY-SA 4.0 | edited tags; edited title |
| Jul 14, 2018 at 13:36 | vote | accept | Gentlebud | ||
| Jul 14, 2018 at 13:45 | |||||
| Jul 14, 2018 at 13:15 | answer | added | Josiah | timeline score: 8 | |
| Jul 14, 2018 at 13:14 | answer | added | indi | timeline score: 10 | |
| Jul 14, 2018 at 12:58 | history | edited | Edward | CC BY-SA 4.0 | added mathjax formatting |
| Jul 14, 2018 at 12:36 | review | First posts | |||
| Jul 14, 2018 at 14:06 | |||||
| Jul 14, 2018 at 12:30 | history | asked | Gentlebud | CC BY-SA 4.0 |