“Draft:The Haruhi Problem”的意思、由来-开放百科全书

词条

Draft:The Haruhi Problem

释义

{{AFC submission|d|nn|u=F45d23|ns=118|decliner=Theroadislong|declinets=20181027182950|ts=20181027182701}}

The Problem:

You have an n episode TV series. You want to watch the episodes in every order possible. What is the least number of episodes that you would have to watch?
Overlapping is allowed. For example, in the case of n=2, watching episode 1, then 2, then 1 again, would fit the criteria.
The orders must be continuous. For example, (1,2,1,3) does NOT contain the sequence (1,2,3)

References

http://mathsci.wikia.com/wiki/The_Haruhi_Problem

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。