"Fundamentals of program design" Chapter 10 function and program structure 7-2 Hanoi Tower problem (20 points)

There is a Vatican Pagoda in an ancient temple , There is... In the tower 3 Seats A、B and C, seat A On top of it 64 Disks of different sizes , The market is under , Small in . There is a monk who wants to 64 A disc from the seat A Move to seat B, But you can only move one plate at a time , The moving disc is only allowed to be placed on the other two seats , And the market cannot be pressed on the small market . Now it is required to simulate the process with a program , Enter a positive integer n, Represents the number of plates , Write function

void hanoi(int n,char a,char b,char c)

among ,n Count the plates , from a Seat to b seat ,c The seat serves as an intermediate transition , The function of this function is to output the path of moving the plate .

Input format :

Enter... On one line 1 A positive integer n.

Output format :

Output moving plate path .

sample input :

3

No blank lines at the end

sample output :

a-->b
a-->c
b-->c
a-->b
c-->a
c-->b
a-->b

No blank lines at the end

#include<stdio.h>
#include<stdlib.h>
void hanio(int n,char a,char b,char c);

int main()
{
    int n=0;
    scanf("%d",&n);
    hanio(n,'a','b','c');
    return 0;
}
void hanio(int n,char a,char b,char c)
{
    if(n==1)
        printf("%c-->%c\n",a,b);
    else{
        hanio(n-1,a,c,b);
        printf("%c-->%c\n",a,b);
        hanio(n-1,c,b,a);
        }  
}