Hanoi Tower Problem

Hanoi Tower problem is a purely recursive problem, it should be relatively simple

When you're done with n plates, it's OK to just n-1 a plate.
First N-1 a plate through the left side of the plate in the middle of the plate, put the nth plate in the past, and finally put the n-1 plate on the leftmost one is OK.

#include <stdio.h>void Move (char A,char C) {    printf ("%c---%c\n", a,c);} void Han (char a,char b,char c,int N) {    if (n==1)        move (a,c);    else    {        han (a,c,b,n-1);        Move (a,c);        Han (b,a,c,n-1);}    } int main () {    int n;    scanf ("%d", &n);    Han (' A ', ' B ', ' C ', n);    return 0;}

　　

Hanoi Tower Problem