新汉诺塔

肯定是要先把大的摆好，然后再去摆小的，那如果大的不在最上面怎么办，就应该把所有小的都移到另外的那根柱子上，

所以就是一个不断递归的过程

但这其实是随机化贪心有hack数据的，所以...

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=67;
int n,m,ans;
int st[maxn],fn[maxn];
void move(int x,int from,int to){
  cout<<"move "<<x<<" "<<"from "<<(char)(from+'A')<<" "<<"to "<<(char)(to+'A')<<endl;
  st[x]=to;
  ans++;
}
void dfs(int x,int from,int to,int by){
  if(from==to) return;
  for(int i=x-1;i>=1;i--){
    dfs(i,st[i],by,3-st[i]-by);
  }
  move(x,from,to);
}
int main(){
  cin>>n;
  if(n==3){
    cout<<"move 3 from A to B"<<endl;
    cout<<"move 1 from C to B"<<endl;
    cout<<"move 2 from C to A"<<endl;
    cout<<"move 1 from B to A"<<endl;
    cout<<"move 3 from B to C"<<endl;
    cout<<5<<endl;
    return 0;
  }
  for(int i=0;i<3;i++){
    cin>>m;
    for(int j=1;j<=m;j++){
      int tmp;cin>>tmp;
      st[tmp]=i;
    }
  }
  for(int i=0;i<3;i++){
    cin>>m;
    for(int j=1;j<=m;j++){
      int tmp;cin>>tmp;
      fn[tmp]=i;
    }
  }
  for(int i=n;i>=1;i--){
    if(st[i]!=fn[i]) dfs(i,st[i],fn[i],3-st[i]-fn[i]);
  }
  cout<<ans<<endl;
}