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 iiisssfff...
