Description: 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).
To Search:
File list (Check if you may need any files):
hannuota\hannuota.cpp
hannuota
Download