文件名称:hannuota
介绍说明--下载内容均来自于网络,请自行研究使用
1. 跟汉诺塔相关问题:如果有n个盘子,总共需要移动多少次?教士们传说当64个盘子全部搬完时,世界末日就要来临了。如果一个教士每秒钟可以移动一次盘子,他的子子孙孙(如果有的话)继承他的事业,需要多少年才可以搬完64个盘。(假设每年都以365天记)。-1 associated with the Tower of Hanoi problem: If there are n plates, a total of how many times you need to move? When the 64 priests legend plates all move those, the end of the world is coming. If a priest can move once per second plate, his children and grandchildren (if any) to inherit his career, how many years before they can move those 64 disks. (Assuming 365 days each year to remember).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hannuota\hannuota.cpp
hannuota