汉诺塔——已知步数，求状态

#include<iostream>
#include<vector>
using namespace std;

int n, step;
vector<int> d;

void init(int n) {
    d.resize(n + 1);
    d[1] = 1;
    for(int i = 2; i <= n; ++i)
        d[i] = 2*d[i-1] + 1;
}

void f(int num, int step, string from, string other, string to) {
    if(step == 0) {
        // 不动
        for(int i = 1; i <= num; ++i)
            cout << "NO." << i << " is on the pet " << from << endl;
    } else if(step >= d[num]) {
        // 到目的地了
        for(int i = 1; i <= num; ++i)
            cout << "NO." << i << " is on the pet " << to << endl;
    } else if(step == d[num-1] + 1) {
        // n-1在other， n到目的地
        f(num - 1, step - 1, from, to, other);
        cout << "NO." << num << " is on the pet " << to << endl;
    } else if(step <= d[num-1]) {
        // n在from上，n-1在挪的过程
        f(num - 1, step, from, to, other);
        cout << "NO." << num << " is on the pet " << from << endl;
    } else {
        // n到目的地，正在把n-1从other挪到to上
        f(num - 1, step - d[num-1] - 1, other, from, to);
        cout << "NO." << num << " is on the pet " << to << endl;
    }
}

int main()
{
    cin >> n;
    init(n);
    while(cin >> step)
        f(n, step, "A", "B", "C");
    return 0;
}