Timeline for Connecting the Dots: Counting n²-gons in the n×n Grid
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21, 2021 at 7:27 | history | edited | Jason Smith | CC BY-SA 4.0 |
Cleaned up comments a bit
|
| May 21, 2021 at 6:34 | history | edited | Jason Smith | CC BY-SA 4.0 |
Count equivalent paths (i.e. mirroring/rotating) only once
|
| May 20, 2021 at 20:28 | history | edited | Jason Smith | CC BY-SA 4.0 |
Removed dead code
|
| May 20, 2021 at 20:09 | history | edited | Jason Smith | CC BY-SA 4.0 |
Improved wording at top of source file
|
| May 20, 2021 at 19:48 | comment | added | Jason Smith | @Anush: I don't expect a lot of difference between C and C++ since I stayed away from containers and other STL abstractions. The code is basically "C-with-classes". I added some improvement suggestions at the top of the file. | |
| May 20, 2021 at 19:44 | history | edited | Jason Smith | CC BY-SA 4.0 |
Posted work-in-progress code
|
| May 20, 2021 at 19:38 | history | edited | Jason Smith | CC BY-SA 4.0 |
Posted work-in-progress code
|
| May 20, 2021 at 17:47 | history | edited | Jason Smith | CC BY-SA 4.0 |
Show an even wilder arbitrary path example
|
| May 20, 2021 at 7:28 | comment | added | user7467 | I think C++ can be slow if you are not used to optimizing it. Could you try C? Or maybe someone else can once you post your code. | |
| May 19, 2021 at 21:56 | history | answered | Jason Smith | CC BY-SA 4.0 |