Consider the 74 characters from the 2016 time capsule string (note the leading space):
Your task is to write as many programs as possible (in the same language) using these characters. The output of each program must be nonempty. When all of the programs and their outputs are considered, it must only use each of the 74 above characters no more than once.
Your score is determined by the number of programs you have written, with the total length of the programs being a tie-breaker (greatest length wins).
Some more rules:
- Each program must terminate.
- Each program must be a full program and output in a reasonable format.
- All output to STDERR is ignored.
- You may not run your program with any flags, except those required to run the program. (E.g., a
-eflag that executes program source.)
- If the program has output that cannot be suppressed, you may ignore when considering the output. (E.g., you may ignore trailing newlines.)
- Each program should be able to be executed with empty stdin.
If I had programs
T1~ that outputted
9 respectively, they would, when considered together, be:
Which can be seen to be a subset of the capsule string. However, if I had programs
|e+ that outputted
f respectively, they would be:
And, since there are 3
4s, it is not a subset.