Solution to the problem of Hanoi Tower

Hanoi tower problem Moving N plates can be converted to first move the N-1 plate to B, then the last plate to move to C, and finally the N-1 plate on the B to move to C; N-1 plates move and move N-1 plates the same way, just change C to B, the last plate to move to C , N-1 a plate and moving from B to B.

#include <stdio.h>
#include <stdlib.h>
Hanoi Tower Problem
void Hanoi (int n,char A,char B,char c)
{
if (n==1)
printf ("%c->%c\n", a,c);
Else
{
Hanoi (N-1,A,C,B);
printf ("%c->%c\n", a,c);
Hanoi (N-1,B,A,C);
}
}
int main ()
{
int m;

printf ("Please enter the number of plates: \ n");
scanf ("%d", &m);
printf ("The process of plate movement is: \ n");
Hanoi (M, ' a ', ' B ', ' C ');
System ("pause");
return 0;
}

does not show full

Solution to the problem of Hanoi Tower