==> combinatorics/full.p <==
Consider a string that contains all substrings of length n.  For example,
for binary strings with n=2, a shortest string is 00110 -- it contains 00,
01, 10 and 11 as substrings.  Find the shortest such strings for all n.