杂技玩法

宏也能递归捏

#include<bits/stdc++.h>
using namespace std;

#define hanoi(n,A,C,B) \
if(n == 1){\
printf("%c --%d--> %c\n",A,n,C);\
}\
else{\
hanoi_(n-1,A,B,C);\
printf("%c --%d--> %c\n",A,n,C);\
hanoi_(n-1,B,C,A);\
}

void hanoi_(int n,char A,char C,char B){
	hanoi(n,A,C,B);
	return;
}

int main(){
	int n;
	cin >> n;
	hanoi(n,'A','C','B');
	return 0;
}