*问题描述:汉诺塔问题
*输入描述:盘子数目n
*/
#include
#define discCount 32
long long move(long long, char, char,char);
int main()
{
long long count;
count=move(discCount,'A','B','C');
printf("%d个盘子需要移动%I64d次\n", discCount, count);
return 0;
}
long long move(long long n, char A, char B,char C)
{
long long c1,c2;
if(n==1)
return 1;
else
{
c1=move(n-1,A,C,B);
c2=move(n-1,B,A,C);
return c1+c2+1;
}
}