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++: // 2011/08/10 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int n;
		cin >> n;
		if(n==0)
			break;

		int T[5000][5];
		for(int i=0; i<5000; i++)
			for(int j=0; j<5; j++)
				T[i][j] = 0;
		int I1 = 0;
		int I2 = 0;

		int N = 0;

		for(int k=0; k<n; k++){
			int d, p, q;
			cin >> d >> p >> q;

			if(d==1){
				int i;
				bool flg = true;
				for(i=I1-1; i>=I2; i--){
					for(int j=0; j<p; j++){
						if(T[i][q-1+j]!=0){
							flg = false;
							break;
						}
					}
					if(!flg)
						break;
				}
				for(int j=0; j<p; j++)
					T[i+1][q-1+j] = 1;
				if(I1<i+2)
					I1 = i+2;
			}
			else if(d==2){
				int i;
				bool flg = true;
				for(i=I1-1; i>=I2; i--){
					for(int j=0; j<p; j++){
						if(T[i+j][q-1]!=0){
							flg = false;
							break;
						}
					}
					if(!flg)
						break;
				}
				for(int j=0; j<p; j++)
					T[i+1+j][q-1] = 1;
				if(I1<i+1+p)
					I1 = i+1+p;
			}

			N += p;

			for(int i=I2; i<I1; i++)
				if(T[i][0]==1&&T[i][1]==1&&T[i][2]==1&&T[i][3]==1&&T[i][4]==1){
					N -= 5;
					I2++;
				}
				else{
					break;
				}


			for(int i=I2; i<I1; i++)
				if(T[i][0]==1&&T[i][1]==1&&T[i][2]==1&&T[i][3]==1&&T[i][4]==1){
					N -= 5;
					for(int j=i; j<I1-1; j++){
						T[j][0] = T[j+1][0];
						T[j][1] = T[j+1][1];
						T[j][2] = T[j+1][2];
						T[j][3] = T[j+1][3];
						T[j][4] = T[j+1][4];
					}
					I1--;
					i--;
				}

		}
/*
		for(int i=I2; i<I1; i++){
			for(int j=0; j<5; j++)
				cout << T[i][j];
			cout << endl;
		}				
*/
		cout << N << endl;
	}

	return 0;
}

C++: #include <cstdio>
#include <ctime>
using namespace std;

int main(){
	clock_t c1 = clock();
	int s = 0, n;
	while(scanf("%d", &n), n){
		s += n;
		for(int i = 0; i < n; ++i){
			scanf("%*d%*d%*d");
		}
	}
	
	clock_t c2 = c1 + CLOCKS_PER_SEC * (s / 1000000.0);
	while(clock() < c2);
}

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

void erase(bool(&field)[5000][5], int line){

	for (int i = line; i < 4999; i++){
		for (int j = 0; j < 5; j++){
			field[i][j] = field[i + 1][j];
		}
	}
}

int main(){

	int n;
	while (std::cin >> n, n){

		bool field[5000][5];

		for (int i = 0; i < 5000; i++){
			for (int j = 0; j < 5; j++){
				field[i][j] = 0;
			}
		}

		for (int i = 0; i < n; i++){
			int d, p, q;
			std::cin >> d >> p >> q;

			q--;

			int height = 0;

			for (int j = 4999; j >= 0; j--){
				if (d == 1){
					bool flg = true;
					for (int k = 0; k < p; k++){
						if (field[j][q + k]) flg = false;
					}
					if (!flg){
						height = j + 1;
						break;
					}
				}
				else{
					if (field[j][q]){
						height = j + 1;
						break;
					}
				}
			}


			for (int j = 0; j < p; j++){
				if (d == 1)field[height][q + j] = true;
				else field[height + j][q] = true;
			}

			for (int i = 0; i < 5000; i++){
				bool flg = true;
				for (int j = 0; j < 5; j++){
					if (!field[i][j]){
						flg = false;
						break;
					}
				}
				if (flg){
					erase(field, i);
					i--;
				}

			}
		}

		int cnt = 0;
		for (int i = 0; i < 5000; i++){
			for (int j = 0; j < 5; j++){
				if (field[i][j] == 1)cnt++;
			}
		}

		std::cout << cnt << std::endl;
	}

	return 0;
}