木块问题

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>

using namespace std;

const int maxs = 30;
int n;
vector<int> pile[maxs];

void find_block(int a, int&p, int& h)//找到木块位置
{
    for (p= 0; p< n; p++)
        for (h = 0; h< pile[p].size(); h++)
            if (pile[p][h] == a)
                return;
}

void clear_block(int p, int h)//使第p堆h以上的木块全部归位
{
    for (int i = h + 1; i < pile[p].size(); i++)
    {
        int b = pile[p][i];
        pile[b].push_back(b);
    }
    pile[p].resize(h + 1);
}

void put_onto(int p, int h, int p2)//将第p堆h包括h的木块移到p2上去
{
    for (int i = h; i < pile[p].size(); i++)
        pile[p2].push_back(pile[p][i]);
    pile[p].resize(h);
}

void print()
{
    for (int i = 0; i < n; i++)
    {
        printf("%d:", i);
        for (int j = 0; j < pile[i].size(); j++)
            printf(" %d", pile[i][j]);
        printf("\n");
    }
}


int main()
{
    cin >> n;
    string s1, s2;
    int a, b;
    for (int i = 0; i < n; i++)
        pile[i].push_back(i);
    while (cin >> s1)
    {
        int pa, pb, ha, hb;
        if (s1 == "quit")
            break;
        cin >> a >> s2 >> b;
        find_block(a, pa, ha);
        find_block(b, pb, hb);
        if (pa == pb)
            continue;
        if (s1 == "move")
            clear_block(pa, ha);
        if(s2=="onto")
            clear_block(pb, hb);
        put_onto(pa, ha, pb);
    }
    print();
    return 0;
}