Write two code fragments, which we will call s_zero and s_one.
Program (l, n) consists of l copies of s_zero and s_one corresponding with the digits of n in binary, padded with s_zero on the left.
For example, if s_zero =
foo and s_one =
Program (4, 0) =
Program (4, 1) =
Program (4, 2) =
Program (l, n) must print the source of Program (l, (n + 1) mod (2^l)) to standard out. In the example above,
foobarfoofoo must print
foobarfoobar when executed.
Your score is the sum of the lengths of fragments s_zero and s_one