文件名称:hannuota
-
所属分类:
- 标签属性:
- 上传时间:2013-09-07
-
文件大小:585byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
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/
hannuota/
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.