The most recent question was closed as a duplicate. This is a mistake - the two challenges are very, very different. Counting the number of permanent-zero matrices, out of a very large number of matricies, is not efficiently performed by using solutions to the other challenge, which just required computing a single permanent. Can people please vote to reopen?
I Shift the Source Code, You Shift the Input!
A spin-off of a rip-off of a rip-off of a rip-off of a rip-off. Go upvote those!
Your task, if you accept it, is to write a program/function that outputs/returns its input/argument. The tricky part is that if I left shift your source code, the outp...
I recently created a simple little language that transpiles Brainfuck into a format that is half the size of its input. It can be used to compress and decompress Brainfuck programs.
Provided I include a link to the transpiler, am I allowed to use this transpiler language as a submission, or is t...
I Shift the Source Code, You Shift the Input!
A spin-off of a rip-off of a rip-off of a rip-off of a rip-off. Go upvote those!
Your task, if you accept it, is to write a program/function that outputs/returns its input/argument. The tricky part is that if I left shift your source code, the outp...
