4147:汉诺塔问题(Tower of Hanoi)

#include<stdio.h>
void move(int tail,char now,char tool,char end,int n){//以nown为低,共 n个
    if(n <=0) return;
    move(tail-1,now,end,tool,n-1);
    printf("%d:%c->%c\n",tail,now,end);
    move(tail-1,tool,now,end,n-1);
}

int main(){
    int n;
    char a,b,c;
    scanf("%d %c %c %c",&n,&a,&b,&c);
    move(n,a,b,c,n);
}

结果：