汉诺塔 从任意状态移动M步后的状态

#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 64;
__int64 step[N] ={0};

void cal_step()
{
    for(int i = 1; i < N; ++i)
        step[i] = step[i -1] << 1 | 1;
}
vector< pair<int,int> >h;
vector< int > han[3];
__int64 m;
void dfs(int k,int t)
{
    if(k < 0 || m == 0)
        return ;
    else if(h[k].second == t)
        dfs(k-1,t);
    else
    {
        int s = 3 - t - h[k].second;
        dfs(k-1,s);
        if(m)
        {
            h[k].second = t;
            --m;
        }
        if(step[k] > m)
            dfs(k-1,t);
        else
        {
            m -= step[k];
            for(int i = 0; i