1.汉诺塔
将A上的移到C上
(1) 将n-1个当成一个整体,移到辅助塔B上(操作这n-1个时,又运用大三步,递归)
(2) 将最下面一个移到C上
(3) 将那n-1个移到C上
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, cnt = 0;
void fun(int n, char a, char b, char c){
if(n == 1){
cnt ++;
printf("No.%lld disk: %c->%c\n", n, a, c);//从塔a移到塔c
return;
}
fun(n - 1, a, c, b);
cnt ++;//将最下面一个从a移到c
printf("No.%lld disk: %c->%c\n", n, a, c);
fun(n - 1, b, a, c);
}
signed main()
{
char a = 'a', b = 'b', c = 'c';
cin >> n;
fun(n, a, b, c);
cout << cnt;
return 0;
}