Timeline for Antsy permutations
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2016 at 0:42 | comment | added | Maltysen | ayyyyy, turning to the pyth side :D | |
| Oct 24, 2016 at 21:29 | comment | added | xnor | @jwg I'd believe it, actually. If the list count took arguments in the opposite order, you could get 6 bytes by taking two inputs implcitly. | |
| Oct 24, 2016 at 21:05 | comment | added | David Conrad | There's something hideous about using an exponential-time approach to a problem with an obvious linear-time solution even if it golfs down nicely. | |
| Oct 24, 2016 at 15:24 | comment | added | jwg | You can cut it down to 6 bytes by using... just kidding. | |
| Oct 24, 2016 at 9:29 | history | edited | xnor | CC BY-SA 3.0 | added 20 characters in body |
| Oct 24, 2016 at 9:04 | history | edited | xnor | CC BY-SA 3.0 | added 1217 characters in body |
| Oct 24, 2016 at 8:56 | history | answered | xnor | CC BY-SA 3.0 |