Inspired by this challenge
Given a number m
, output a program that prints out the string Do not repeat yourself
.
Now for the challenging part: Each program the original code prints out has to have the byte at place m*n
be the same as m*n + 1
and the same as m*n + 2
.... all the way down to m*n + m - 1
.
(In case you can't tell, that means it has to be blocks of identical bytes m
long)
Example (that only demonstrates the repetition rule, not the output):
2
aassdd
3
mmmyyy nnnaaammmeee iiisssfffrrreeeddd
27
111111111111111111111111111
##Scoring:
- Your program's score is the
x / (min(y, 10)^3)
, wherey
is the number of correct programs it outputs, andx
is the sum of the lengths of all of the correct programs it outputs andy > 1
. Lowest score wins.
##Other notes:
Your code doesn't have to fulfill any such restrictions on letters repeating.
Your programs (that you output) cannot take input of any sort.
The input will always be a positive integer greater than 1.
Your code needs to work for at least one integer greater than 1.
<input>
length, e.g. for input2
something likeaabbccdd
. \$\endgroup\$