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.

Full Solution

lib/config.php:156: Notice: Undefined variable: accept

lib/DbaDatabase.php:134: Warning: dba_replace() [<a href='function.dba-replace'>function.dba-replace</a>]: You cannot perform a modification to a database without proper access