Challenge
Write two programs that:
- run in two different programming languages.
- These may not be two versions of one language.
- when one program is run, it outputs the second program, and vice versa.
- The two programs must be different (no polyglots).
Here's the catch though:
- The programs must be radiation hardened.
- This means that when any set of \$n\$ (defined below) characters is removed from either of the two programs, their functionality is unaffected.
- \$n\$ is defined as the number of characters that may be omitted with your program's functionality unaffected.
- \$n\$ must be at least \$1\$.
Rules
- Standard loopholes are disallowed.
- Your programs must be proper cyclic quines. They may not read their own source code.
- Scoring is performed as follows:
- Your score is \$\frac{S_1+S_2}n\$…
- where \$S_1\$ and \$S_2\$ are the size of your first and second programs respectively…
- and \$n\$ is as defined above.
- This is a code-challenge, lowest score wins.
Reward
As this challenge is difficult to answer, I will be giving a bounty to the first person to answer.