Timeline for Is this a valid Shakashaka solution?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2020 at 17:37 | comment | added | The Fifth Marshal | You appear to have gotten my technique to work, anyway, though, with some of your own modifications, so I at least provided an idea. (I'm deleting my own comments as they get responded to so the comment section doesn't get too cluttered) | |
| Jun 23, 2020 at 17:34 | comment | added | fireflame241 |
@pppery Yep, that's the power of using all the testcases. The problem with the 473-byte code was that it modified a within the function, though it did deal with v and n properly
|
|
| Jun 23, 2020 at 17:30 | history | edited | fireflame241 | CC BY-SA 4.0 |
-a few bytes
|
| Jun 23, 2020 at 17:02 | history | edited | fireflame241 | CC BY-SA 4.0 |
-55 bytes
|
| Jun 23, 2020 at 8:03 | comment | added | ovs | All combined: Try it online!. | |
| Jun 23, 2020 at 7:59 | comment | added | ovs |
And replace the last part of F with [(c>>a&1)*(a+y)*(3-a+x)and F(x+a%2*(2-a),y+(a-1&~a),1<<(a^2))for a in(0,1,2,3)] for another -4 bytes. Then you can move the check for x and y to the front.
|
|
| Jun 23, 2020 at 6:23 | comment | added | ovs |
You can wrap the entire F function in try/except and return by throwing an error: Try it online!.
|
|
| Jun 23, 2020 at 0:57 | history | edited | fireflame241 | CC BY-SA 4.0 |
-28 bytes
|
| Jun 22, 2020 at 23:03 | history | edited | fireflame241 | CC BY-SA 4.0 |
-113 bytes
|
| Jun 22, 2020 at 22:48 | history | edited | fireflame241 | CC BY-SA 4.0 |
Add commented, ungolfed
|
| Jun 22, 2020 at 21:51 | history | answered | fireflame241 | CC BY-SA 4.0 |