Hanoi problem

The first 1 Turn off ： Hanoi (Hanoi) The recursive algorithm of

Our mission ： Hanoi (Hanoi) The recursive algorithm of .

It's said that in the ancient temple of India , There is one called the Hanoi Tower (Hanoi) The game of . The game is on a copper device , There are three rods ( Number A、B、C), stay A From the bottom up 、 Place in order from large to small 64 A gold plate ( Here's the picture ). The goal of the game ： hold A All the gold plates on the pole are moved to C On the pole , And still keep the original order . Operating rules ： Only one plate can be moved at a time , And keep the big plate down all the time during the moving process , Small in , The plate can be placed during the operation A、B、C On any pole

#include <stdio.h> 
#include <stdlib.h> 
void Hanoi(int n,char