关于汉诺塔的递归，记住一个结论是，转移n个盘子至少需要2^n-1步 #include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<string>using namespace std;int two[100005],pos[100005];int m