I personally love quines, but they all seem to be so... static. So why not create a quine that can do more.
Challenge
The challenge here is to create a quine that without any sort of input is a normal quine. Then if it receives a different input, it outputs a different quine in a different language. (basically like a polyglot, but it doesn't have to return to the original source code)
EX:
Starting program:
James
Given no input or 0 as input, the code above outputs:
James
Given 1 as input, the code outputs:
Kendra
Given 2 as input, the code outputs:
Alexander
And so on...
Requirements
Like with any other quine challenge, no examining source code directly!
Inputs are either nothing, or a positive integer.
Each quine must not be less than \$\lceil(n/4)\rceil\$ levenshtein distance from all other quines, where \$n\$ is the length of the original quine. Look at this example program:
Bobb //original quine
Bobby //output (when given an input), we'll name him bobby
Bob //output (when given a different input), we'll name him bob
The above is not valid, because Bob is only one levenshtein distance from Bobb.
However, this one is valid:
Bob //original quine
Alice //bob's output when given 1 as input
Geronimo //bob's output when given 2 as an input
Because \$ ceil(len(bob)/4)=1 \$, and Alice, Geronimo, and Bob are all at more than one levenshtein distance away from each other.
There has to be a minimum of one extra quine to be outputted.
The quine must output itself when given no input or 0, and output a different quine if given a different integer input!
Points
Points are based on this equation (courtesy of Luis felipe De jesus Munoz) $${\frac{100}{\text{bytes}} \cdot 2^{\text{extra quines} - 1}}$$
(100 divided by the number of bytes multiplied by 2 to the power of every different quine that your program can output, minus one to make sure the program at least outputs one different quine)
