最短的二进制序列覆盖数月0-99 [英] The shortest Binary sequence to cover Dec numbers 0-99
本文介绍了最短的二进制序列覆盖数月0-99的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！
问题描述
考虑包含数字的二进制重新presentation 0到99这是最短的串T使得S的每个元素是T的子集串S的
Consider the set of strings S that contains the binary representation of the numbers 0 to 99. What is the shortest string T such that every element of S is a substring of T?
推荐答案
什么你要求的是非常相似的二进制文件的德布鲁因序列的。该算法的问题，它使用欧拉周期的，可以很容易地适应您解决问题。
What you're asking for is very similar to the binary De Bruijn sequence. The algorithm for that problem, which uses Eulerian cycles, can easily be adapted to solve your problem.
这篇关于最短的二进制序列覆盖数月0-99的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
查看全文
