习题3.10 汉诺塔的非递归实现

#include<stdio.h>
int main(){
    char a[3]={'a','c','b'};
    int b,c=2,d,n=1,m;
    scanf("%d",&b);
    if(b%2){
        a[1]='b';
        a[2]='c';
    }
    for(;n<b;n++){
        c*=2;
    }
    for(n=1;n<c;n++){
        b=n%4;
        if(b){
            d=n/4%3;
            printf("%c -> %c\n",a[(d+2*(b==3))%3],a[(d+1+(b==1))%3]);
        }else{
            for(m=n;!(m%4);m/=4);
            b=m%4;
            d=m/4%3;
            printf("%c -> %c\n",a[(d+2*(b==3))%3],a[(d+1+(b==1))%3]);
        }
    }
}