Do not repeat yourself 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), where y is the number of correct programs it outputs, and x is the sum of the lengths of all of the correct programs it outputs and x &gt; 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.
CJam, 3165 / 10³ = 3.165

{
"Do not repeat yourself"]sX/z_&amp;
6)H7+G0+B8+H7+E8+G0+D8+9)C8+9)A7+E8+G0+B9+H7+K7+D8+J7+9)A8+I6+]{c}/
"Do not repeat yourself"]sZ/z_&amp;

"Do not repeat yourself"]s3D&amp;3D&amp;3D&amp;3D&amp;3D&amp;/z_&amp;

"Do not repeat yourself"]s1F&amp;1F&amp;1F&amp;1F&amp;1F&amp;1F&amp;1F&amp;/z_&amp;



"Do not repeat yourself"]sB/z_&amp;

"Do not repeat yourself"]sD/z_&amp;

"Do not repeat yourself"]sF/z_&amp;

"Do not repeat yourself"]sH/z_&amp;

"Do not repeat yourself"]sJ/z_&amp;
}`1&gt;W&lt;N/
e# Uncomment this line to count total length:
e# ee{~,*}%:+p [L]
ri\1$=f*


Works for inputs 1, 2, 3, 5, 7, 11, 13, 15, 17, 19.

Total length is 3165.

The program for input 2 is from here, credits to Super Chafouin.

Example: output for 11

"""""""""""DDDDDDDDDDDooooooooooo           nnnnnnnnnnnooooooooooottttttttttt           rrrrrrrrrrreeeeeeeeeeepppppppppppeeeeeeeeeeeaaaaaaaaaaattttttttttt           yyyyyyyyyyyooooooooooouuuuuuuuuuurrrrrrrrrrrssssssssssseeeeeeeeeeelllllllllllfffffffffff"""""""""""]]]]]]]]]]]sssssssssssBBBBBBBBBBB///////////zzzzzzzzzzz___________&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;


Explanation:

"""""""""""..."""""""""""    Push five empty strings, a long string,
                                and five more empty strings.
]]]]]]]]]]]sssssssssss       Collect them all in a list. Put that list in
                             10 more layers of list, for good measure.
                             Convert this to a string, to just get the long one.
BBBBBBBBBBB///////////       Split into chunks of size
                                11/(11/(.../(11/(11/11))))) = 11.
                             This gets us:
                                ["DDDDDDDDDDD" "ooooooooooo" ...]
zzzzzzzzzzz                  Transpose eleven times, i.e. once. We now have:
                                ["Do not..." "Do not..." ... "Do not..."]
___________&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;&amp;       Push eleven more copies, and get the unique elements.
                             This gets us:
                                ["Do not..."]