Timeline for Partition into increasing subsequences
Current License: CC BY-SA 3.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 7, 2015 at 21:33 | answer | added | Jakube | timeline score: 1 | |
Dec 7, 2015 at 20:32 | answer | added | nimi | timeline score: 3 | |
Dec 7, 2015 at 18:40 | history | reopened |
Zgarb feersum daniero Blue Peter Taylor |
||
Dec 7, 2015 at 15:54 | review | Reopen votes | |||
Dec 7, 2015 at 18:40 | |||||
Dec 7, 2015 at 15:39 | comment | added | Zgarb |
@feersum That wasn't intentional, good catch. I've rewritten the conditions for B , hopefully they're clearer now.
|
|
Dec 7, 2015 at 15:38 | history | edited | Zgarb | CC BY-SA 3.0 |
Made a better definition.
|
Dec 7, 2015 at 9:45 | history | closed |
Peter Taylor Martin Ender |
Needs details or clarity | |
Dec 7, 2015 at 9:33 | review | Close votes | |||
Dec 7, 2015 at 9:48 | |||||
Dec 7, 2015 at 8:38 | history | tweeted | twitter.com/StackCodeGolf/status/673783749054767104 | ||
Dec 7, 2015 at 5:28 | comment | added | feersum |
The rules seem to allow solutions like [0,5,2,0] -> [[0,5],[0,2]] (i.e., recycling the first zero instead of using each of them once). Is that intentional?
|
|
Dec 7, 2015 at 5:20 | history | edited | Zgarb | CC BY-SA 3.0 |
deleted 9 characters in body
|
Dec 7, 2015 at 4:49 | history | asked | Zgarb | CC BY-SA 3.0 |