Uva 101 the block problem

可以模拟，也可以用STL容器，也是参考了其他人的思路。

//move a onto b：把木块a、b上的木块放回各自的原位，再把a放到b上；
//move a over b：把a上的木块放回各自的原位，       再把a发到含b的堆上；
//pile a onto b：把b上的木块放回各自的原位，       再把a连同a上的木块移到b上；
//pile a over b：把a连同a上木块移到含b的堆上。
#include <vector>
#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> vc[30];
void back(int m, int n)
{
    for (int i = n+1; i < vc[m].size(); i++) {
        int t = vc[m][i];
        vc[t].push_back(t); 
    }
    vc[m].resize(n+1);
}

int main()
{
	int n;
    int a, b;
    char op1[5], op2[5];
    scanf("%d", &n);
    for (int i = 0; i < n; i++) vc[i].push_back(i);
    while (cin>>op1){
    	if(op1[0] == 'q') break;
    	scanf("%d %s %d",&a, op2, &b);
		int a1 = -1, a2 = -1;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < vc[i].size(); j++) {
				if(vc[i][j] == a) {
					a1 = i;
					a2 = j;
					break;
				}
			}
			if(a1 > 0) break;
		}
		int b1 = -1, b2 = -1;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < vc[i].size(); j++) {
				if(vc[i][j] == b) {
					b1 = i;
					b2 = j;
					break;
				}
			}
			if(b1 > 0) break;
		}    	
        if (a1 == b1) continue;
        if (op1[0] == 'm') back(a1, a2);
        if (op2[1] == 'n') back(b1, b2);
	    for (int i = a2; i < vc[a1].size(); i++)
	    vc[b1].push_back(vc[a1][i]);
	    vc[a1].resize(a2);
    }
    for (int i = 0; i < n; i++) {
        printf("%d:", i);
        for (int j = 0; j < vc[i].size(); j++)
		printf(" %d", vc[i][j]);
        printf("\n");
    }
    return 0;
}