汉诺塔（递归）

[c]代码库

int main(){
   void hanoi(int n, char one, char two, char three);
   int m;
   scanf("%d", &m);
   hanoi(m, 'A', 'B', 'C');
   return 0;
}

void hanoi(int n, char one, char two, char three){
    void move(char x, char y);
    if(n > 1){
        hanoi(n-1, one, three, two);
        move(one, three);
        hanoi(n-1, two, one, three);
    }
    else
        move(one, three);
}

void move(char x, char y){
    printf("%c->%c\n", x, y);
}