Vitsy, 10 27 bytes
'rddd++&"rdd8++a[v}v1-D);].
Si :
se permitiera, podría acortar esto a 11 bytes. :(
Explicación:
'rddd++&"rdd8++a[v}v1-D);].
' Capture all instructions as a string until encountering
' again, looping if necessary.
r Reverse the current stack (output is top-down).
ddd++ Push char literal ' to the stack.
& Push a new stack to the stack stack.
" Same as ', but " specific.
r Reverse the current stack.
dd8++ Push char literal " to the stack.
a Push 10 to the stack.
[ ] Loop forever.
v Capture the top value as a variable.
} Take the bottom item of the stack and put it on the top.
v Dump the variable to the stack.
1- Subtract 1.
D Duplicate the top item.
); Pop n; if n is 0, exit the loop.
a[v v1-D);] This is a makeshift for loop with 10 iterations.
. Pop the top stack as n, and the second stack as o.
Write a file called "n" with the contents of "o".
Las dos pilas serán idénticas al final. En algunas versiones de Java, esto puede FileNotFoundException
deberse a diferentes implementaciones de la FileInputStream
clase.
Respuesta anterior antes de editar:
&'rddd++}.
Explicación:
& Push a new stack to the stack stack.
'rddd++ Modified standard quine.
} Move the ' to the right place.
. Pop the top stack as n, and the second stack as o. Write a file called
"n" with the contents of "o". (Quine name, no content)
Porque también podría hacerlo, aquí hay un diagrama de los pasos que ocurren dentro de las pilas (cada pila está representada por []
):
Initial state: [[]]
& [[], []]
Push a new stack to the stack stack.
' [[], ["r", "d", "d", "d", "+", "+", "}", ".", "&"]]
This stack state occurs because ' will loop around the line
until finding the next '.
r [[], ["&", ".", "}", "+", "+", "d", "d", "d", "r"]]
Reverses the top (last) stack.
ddd [[], ["&", ".", "}", "+", "+", "d", "d", "d", "r", 13, 13, 13]
Push thirteen thrice.
++ [[], ["&", ".", "}", "+", "+", "d", "d", "d", "r", "'"]
Because char ' is 39 = 13 + 13 + 13.
} [[], [".", "}", "+", "+", "d", "d", "d", "r", "'", "&"]]
Takes the bottom item, then puts it on the top.
. []
Writes a file with content from the second-to-top stack and the
name as the concatenation of all elements in the top stack,
with top member priority (backwards from my representation).
En realidad no estoy seguro de cómo funciona esto bien; cambios mínimos hacen que esto se rompa. Por ejemplo, colocar el &
en varias otras ubicaciones debería funcionar igual de bien, pero causa ClassCastException
s, IOException
sy ArrayOutOfBoundsException
s dependiendo de dónde lo coloque. Puede que tenga que hacer algunas correcciones de errores.