摘要:
In the classic problem of the Towers of Hanoi, you have 3 towers and Ndisks of different sizes which can slide onto any tower.The puzzle starts with d... 阅读全文
posted @ 2014-07-09 20:23
中二病程序猿
阅读(162)
评论(0)
推荐(0)
浙公网安备 33010602011771号