Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)
var (
	dat = [5000][5]int{}
	m = [5]int{}
)

func main() {
	for scanner.Scan() {
		for i := range dat {
			for j := range dat[i] {
				dat[i][j] = 0
			}
		}
		for i := range m {
			m[i] = 0
		}
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		count := 0
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			d, _ := strconv.Atoi(buf[0])
			p, _ := strconv.Atoi(buf[1])
			q, _ := strconv.Atoi(buf[2])
			q--
			count += p
			if d == 2 {
				for j := 0; j < p; j++ {
					dat[m[q]][q] = 1
					ok := true
					for k := 0; k < 5; k++ {
						if dat[m[q]][k] == 0 {
							ok = false
						}
					}
					if ok {
						for k := 0; k < 5; k++ {
							dat[m[q]][k] = 0
							for l := m[q]; l < 4999; l++ {
								dat[l][k] = dat[l+1][k]
							}
							for l := 4999; l >= 0; l-- {
								if dat[l][k] != 0 {
									m[k] = l+1
									break
								}
								if l == 0 {
									m[k] = 0
								}
							}
						}
						count -= 5
					} else {
						m[q]++
					}
				}
			} else {
				h := 0
				for i := 0; i < p; i++ {
					h = max(h, m[i+q])
				}
				for i := 0; i < p; i++ {
					dat[h][i+q] = 1
				}
				for i := 0; i < p; i++ {
					m[i+q] = h+1
				}
				ok := true
				for j := 0; j < 5; j++ {
					if dat[h][j] == 0 {
						ok = false
					}
				}
				if ok {
					for j := 0; j < 5; j++ {
						dat[h][j] = 0
						for k := h; k < 4999; k++ {
							dat[k][j]=dat[k+1][j]
						}
						for k := 4999; k>= 0; k-- {
							if dat[k][j] != 0 {
								m[j]=k+1
								break
							}
							if k == 0 {
								m[j] = 0
							}
						}
					}
					count -= 5
				}
			}
		}
		fmt.Println(count)
	}
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){

	int n;
	while(cin>>n&&n!=0){
		char field[10][5];
		for(int i = 0; i < 10; i++)
			for(int j = 0; j < 5; j++)
				field[i][j]='0';
		int d,p,q;
		for(int i = 0; i < n; i++){
			cin>>d>>p>>q;
			if(d==1){
				int init=q-1;
				int at=10000000;
				for(int j = init; j < p+init; j++){
					for(int k = 0; k < 10; k++){
						if(field[k][j]=='1'){
							at=min(at,k-1);
							break;
						}
						else if(k==9){
							at=min(at,k);
							break;
						}
					}
				}
				// atÌÀWÌ³ÉubNð¨­
				for(int j = init; j < p+init; j++){
					field[at][j]='1';
				}
			}
			else{
				int at=10000000;
				for(int k = 0; k < 10; k++){
					if(field[k][q-1]=='1'){
						at=k-1;
						break;
					}
					else if(k==9)
						at=k;
				}
				//ubNð¨­
				for(int j = at; j!=at-p; j--){
					field[j][q-1]='1';
				}
			}
			bool er=false;
			// ubNÌÁ
			for(int j = 0; j < 10; j++){
				bool f=false;
				for(int k = 0; k < 5; k++){
					if(field[j][k]!='1'){
						f=true;
						break;
					}
				}
				if(!f){
					for(int k = 0; k < 5; k++)
						field[j][k]='0';
					// Á¦½sæèãÉ éubNðº
					for(int k = j-1; k >= 0; k--){
						for(int l = 0; l < 5; l++){
							field[k+1][l]=field[k][l];
						}
					}
				}
			}

			//for(int j = 0; j < 10; j++){
			//	for(int k = 0; k < 5; k++){
			//		cout<<field[j][k]<<flush;
			//	}
			//	cout<<endl;
			//}
			//cout<<endl;
		}
		int cnt=0;
		for(int i = 0; i < 10; i++){
			for(int j = 0; j < 5; j++){
				if(field[i][j]=='1')
					cnt++;
			}
		}
		cout<<cnt<<endl;
	}

	return 0;
}

C++: #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define Whole(xs) xs.begin(), xs.end()

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    if (vs.empty()) return os << "[]";
    os << "[" << vs[0];
    for (int i = 0; i < vs.size(); i++) os << " " << vs[i];
    return os << "]";
}
ostream& operator<<(ostream& os, const vector<int>& vs) {
    if (vs.empty()) return os << "[]";
    bool flag = false;
    os << "[";
    for (int i = 0; i < vs.size(); i++) {
        if (flag) {
            os << " ";
        } else {
            flag = true;
        }
        for (int j = 0; j < 5; j++) {
            os << ( (vs[i] & (1 << j)) > 0 );
        }
    }
    return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int N;
vector<int> F;
bool Input() {
    cin >> N;
    if (N == 0 || cin.eof()) return false;
    F.clear();
    return true;
}

void WSet(int Q, int P) {
    int R = 0;
    for (int i = Q; i < Q + P; i++) {
        R ^= (1 << i);
    }
    if (F.empty()) {
        F.push_back(R);
    } else{
        if ((F.back() & R) == 0) {
            for (int i = F.size() - 1; i >= -1; i--) {
                if ( i < 0 || (F[i] & R) > 0 ) {
                    F[i + 1] ^= R;
                    break;
                }
            }
        } else {
            F.push_back(R);
        }
    }
}

void HSet(int Q, int P) {   
    if (F.empty()) {
        for (int i = 0; i < P; i++) {
            F.push_back(1 << Q);
        }
        return;
    }
    int Rem = P;
    for (int i = F.size() - 1; i >= -1; i--) {
        if (i < 0 || F[i] & (1 << Q)) {
            for (int j = i + 1; Rem > 0 && j < F.size(); j++) {
                Rem--;
                F[j] ^= (1 << Q);
            }
            break;
        }
    }
    for (int i = 0; i < Rem; i++) {
        F.push_back(1 << Q);
    }
}

void Fall() {
    vector<int> nF;
    for (int i = 0; i < F.size(); i++) {
        if (F[i] != (1 << 5) - 1) {
            nF.push_back(F[i]);
        }
    }
    F = nF;
}

void Solve() {
    for (int n = 0; n < N; n++) {
        int D, P, Q; cin >> D >> P >> Q;
        Q--;
        if (D == 1) {
            WSet(Q, P);
        } else {
            HSet(Q, P);
        }
        Fall();
    }
    int Ans = 0;
    for (int i = 0; i < F.size(); i++) {
        for (int j = 0; j < 5; j++) {
            if (F[i] & (1 << j)) {
                Ans++;
            }
        }
    }
    cout << Ans << endl;
}

int main() {
    while (Input()) {
        Solve();
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	while (scanf("%d", &n), n){
		vector<int> board(1, (1 << 5) - 1);
		int res = 0;
		for (int i = 0; i < n; i++){
			int d, p, q;
			scanf("%d %d %d", &d, &p, &q);
			--q;
			
			int block = 0, num;
			if (d == 1){
				for (int j = 0; j < p; j++){
					block |= 1 << (q + j);
				}
				num = 1;
			}
			else {
				block = 1 << q;
				num = p;
			}
			
			for (int j = 0; j < num; j++){
				for (int h = board.size(); h > 0; h--){
					if (!(board[h - 1] & block)) continue;
					if (h == board.size()) board.push_back(0);
					board[h] |= block;
					break;
				}
			}
			
			res += p;
			for (int h = board.size() - 1; h > 0; h--){
				if (board[h] == (1 << 5) - 1){
					board.erase(board.begin() + h);
					res -= 5;
				}
			}
		}
		printf("%d\n", res);
	}
	return 0;
}