What's the shortest contiguous subset of ASCII you need to output the rest?
Unary, N=1

4132527913354820031118363262102424570092493175835499123283719 (4.1325279e+60) bytes

Source code in unary is obviously too large to post here. It can be easily reproduced by typing out (or generating) a file filled with "0"s of the same length as the number of bytes above.

Here is the binary representation:

1010010010010110011000010010010010010010010010001111000000010010010010010110011000010010010010010010010010010010010010010010010010010010010001111000110011001010001100010000000111001110011001011100000111


And the equivalent Brainf**k code (linebreaks for clarity):

++++[-&gt;++++++++&lt;]&gt;&gt;
+++++[-&gt;+++++++++++++++++++&lt;]&gt;
[-&lt;+&lt;.+&gt;&gt;]&lt;
[-&lt;-.&gt;]


Output:

 !"#$%&amp;'()*+,-./0123456789:;&lt;=&gt;?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~~}|{zyxwvutsrqponmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?&gt;=&lt;;:9876543210/.-,+*)('&amp;%$#"! 


EDIT: Golfed out 9.097887e+87 unnecessary characters.