Post History
Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$. If I remove the $n$th byte from your program to get program $q$, then either $q$ outpu...
Question
radiation-hardening
#2: Post edited
- Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$.
- If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else.
Your score is the number of times removing a byte results in a program that does something else, or is a quine. With a lower score being the goal. Ties will be broken by code golf.
- Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$.
- If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else.
- Your score is the number of ways a single byte being removed from $p$ results in a program that does "something else", or is a quine. With a lower score being the goal. Ties will be broken by code golf.
#1: Initial revision
I irradiate your source code, you irradiate your output
Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$. If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else. Your score is the number of times removing a byte results in a program that does something else, or is a quine. With a lower score being the goal. Ties will be broken by code golf.