塔问题的递归实现

#include <stdio.h>
void move(int n,char out,char pass,char in)
{
if(n <= 0)
printf("error");
else
{
if(n == 1)
{
printf("\n%c-->%c",out,in);
}
else
{
move(n - 1,out,in,pass);
printf("\n%c-->%c",out,in);
move(n - 1,pass,out,in);
}
}
}
main()
{
int n;
char out,pass,in;
out = 'A',pass = 'B',in = 'C';
while(1)
{
printf("Please input n:");
scanf("%d",&n);
if(n == 0) break;
getchar();