@Leo When I changed the string decompression, I, for some reason, changed the way the file was accessed. You should revert that change. Currently decompression doesn't work on TIO

@H.PWiz Done, thank you :)

@H.PWiz Probably in Zgarb's first experiments with the TNum type ;)

Does Husk have any built-in to retrieve every nth element from a list? Or do I have to cut the list into chunks of length n and then retrieve the first element form each chunk?

@MartinEnder like modular in Jelly or [::A] syntax in Python? (Eg: [1,2,3,4,5,6,7], 2 -> [2, 4, 6])?

actually, [1,2,3,4,5,6,7] --> [1,3,5,7], so like CJam's or GolfScript's %

@MartinEnder oh so every Nth element starting with the first one?

yes

Um, i don't think there's any built-in for that

@Mr.Xcoder btw [::A] doesn't work like that, it would need to be [A-1::A]

@EriktheOutgolfer I know. The example wasn't working like the [::A] syntax.

(or even better: [A-(A>0)::A])

@MartinEnder om←C is a 4-byter for it for positive (takes the number first)

@MartinEnder I found a 15 byte to that binary challenge that doesn't use İ□.

@H.PWiz looks like an angry comic book character trying not to swear at someone

@MartinEnder not to someone, to mods

haha, didn't even see that

Here's one with fewer Ns: moḋz!NSC§C´ṘṁḋN

@MartinEnder seems like the voice of new users thinking mods are evil people who destroy their contributions

and the latter looks like some police stuff to me for some reason

@H.PWiz the CNCṘNNṁḋN is really neat :)

but you can compute İ□ in three bytes anyway, so my solution would also be (or actually was also) 15 bytes without using the built-in sequence.

@EriktheOutgolfer btw, that's essentially what I used

@MartinEnder posted