Activity for wizzwizz4
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #296646 |
Post edited: Restored attribution, elaborated slightly. |
— | 7 days ago |
| Edit | Post #296646 |
Post edited: Saved 16 bytes by changing the hash function and rewriting to a lambda expression. |
— | 7 days ago |
| Edit | Post #296646 | Initial revision | — | 7 days ago |
| Answer | — |
A: Net or not? [Python 3], 189 173 bytes lambda s:(f:=lambda i,a,b,c,d:l[i]&1 and(exec('l[i]=0')or a/b+b/c+c/d+d/a+f(i-7,c,a,d,b)+f(i-1,d,c,a,b)+f(i+1,c,d,b,a)+f(i+7,b,d,a,c)))((l:=3s).index(35,41),4,8,63,72)==111 Try it online! (test harness adapted from this answer) Input is given as an ASCII-enco... (more) |
— | 7 days ago |
| Comment | Post #296063 |
@#117749 Do we have to provide the input numbers in the output, or are we allowed to reference them indirectly? i.e., for the input `1346`, could we output something like `4th / (1st - (2nd / 3rd))`? (more) |
— | 4 months ago |
| Comment | Post #295806 |
If you did change the scoring mechanism, I'd suggest adding the efficiency (here, improving the number that's 4; although in other challenges, it might be possible to get sub-linear behaviour) as a tie-breaker if an infinite family of solutions is found. (more) |
— | 6 months ago |
| Comment | Post #295290 |
The source code for the hash you want us to break should be included in the question. (more) |
— | 6 months ago |
| Comment | Post #279722 |
Why not go up to 3999? (more) |
— | 6 months ago |
| Edit | Post #295791 |
Post edited: Changed I/O strategy to shave off four bytes. |
— | 6 months ago |
| Edit | Post #295791 | Initial revision | — | 6 months ago |
| Answer | — |
A: Coat of Many Colours Python 3, 120 116 bytes a=b"F99%T / 9#mQ 9 %>^/%O/#c 4bJLlHIgwY[NXrEdSsheZ]"3 def f(l):l.sort(key=lambda s:a.find(len(s)+a[s[0]]+a[s[1]])) Takes input as a `list` of `bytes`, representing lower-case colour names encoded in UTF-8 (or ASCII). Mutates the list by sorting it in-place. Tr... (more) |
— | 6 months ago |