递归-汉诺塔

//正月点灯笼永远滴神
代码参考–b站up主.正月点灯笼

#include<stdio.h>
void hanoi(int n, char a, char b, char c)//a为起始柱 b为中间柱 c为终点柱
{
	if (n == 1) printf("%c-->%c\n", a, c);
	else
	{
		hanoi(n - 1, a, c, b);
		printf("%c-->%c\n", a, c);
		hanoi(n - 1, b, a, c);
	}
}
int main()
{
	int n;
	scanf("%d", &n);
	hanoi(n,'a','c','b');
	return 0;
}