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 <cstring>

#define rep(i,n) for(int i=0;i<(n);i++)
#define YOKO 1
#define TATE 2

using namespace std;

struct B{
	int d;	// ubNÌü«@(1: ¡ü« 2: cü« )
	int p;	// ubNÌ·³  (1  d  5 )
	int q;	// ubNÌÊu@(1  p  5 ¡ü«ÌêÍ¶[ÌR}ª¿éÊu )
};

const int Hight = 5001;
const int Width = 5;

bool f[Hight][Width];

// cÁ½ubNðJEg
int count_block (void )
{
	int res = 0;

	for (int i = 0; i < Hight; i++ ){
		for (int j = 0; j < Width; j++ ){
			if (f[i][j] )
				res++;
		} // end for
	} // end for

	return res;
}

// ubNªlÜÁÄ¢éCðÁ·
void del_block (int n )
{
	for (int i = n + 1; i < Hight; i++ ){
		for (int j = 0; j < Width; j++ ){
			f[i-1][j] = f[i][j];
		} // end for
	} // end for
}

void is_all_row (void ) // ·×ÄubNªÜÁÄ¢éCðÁ·
{
	bool found = false;
	do{
		found = false;
		for (int i = 0; i < Hight; i++ ){
			int sum = 0;
			for (int j = 0; j < Width; j++ ){
				if (f[i][j] ){
					++sum;
				} // end if
			} // end for
			if (sum == Width ){
				del_block (i );
				found = true;
				break;			
			} // end if
		} // end for
	}while (found );
}

// row,colÌêÌãÌÊuªJ¢Ä¢é©Ç¤©Ì`FbN
bool check_tate (int row, int col )
{
	for (int i = row; i < Hight; i++ ){
		if (f[i][col] )
			return false;
	} // end for

	return true;
}

int main()
{
	int n;

	while (cin >> n && n ){
		memset (f, false, sizeof(f ) );
		vector <B> b (n );
		for (int i = 0; i < n; i++ ){
			cin >> b[i].d >> b[i].p >> b[i].q;
			b[i].q--;
		}// end for
	
		for (int i = 0; i < n; i++ ){
			int curr = 0;
			bool found = false; // »ÌÊuÉæqª é©Ç¤©
			do{
				found = false;	
				for (int j = b[i].q; j < b[i].q + b[i].p; j++ ){
					if (!check_tate (curr, j ) ){
						found = true;
						break;
					} // end if
					if (!f[curr][j] ){
						if (b[i].d == TATE ){	// cü«ÌêAê¾¯ÅOK
							break;
						}else{ 
							continue;
						} // end if
					}else{
						found = true;
						break;
					} // end if
				} // end for
				if (!found ){
					if (b[i].d == YOKO ){	// ¡ü«Ìê
						for (int j = b[i].q; j < b[i].q + b[i].p; j++ ){
							f[curr][j] = true;
						} // end for
					}else{					// cü«Ìê
						for (int j = 0; j < b[i].p; j++ ){
							f[curr+j][b[i].q] = true;
						} // end for 						
					} // end if
				}else{
					curr++;	// ²¸·ésðâ·
				} // end if
			}while (found );
			is_all_row ();	// ·×ÄÌCªlÜÁÄ¢é©`FbN
		} // end for

		int res = count_block();
		cout << res << endl;
	} // end loop
		
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int board[6000][6];

int main() {
	int n;
	while(cin >> n, n) {
		int top[8];

		for(int i = 0; i < 6000; i++)
			for(int j = 0; j < 6; j++)
				board[i][j] = 0;
		for(int i = 0; i < 8; i++)
			top[i] = 0;

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

			if(d == 1) {
				int h_max = -1;
				for(int j = 0; j < p; j++) {
					h_max = max(top[q - 1 + j], h_max);
				}
				for(int j = 0; j < p; j++) {
					board[h_max][q - 1 + j] = 1;
					top[q - 1 + j] = h_max + 1;
				}

				bool flg = true;
				for(int j = 0; j < 5; j++)
					flg &= board[h_max][j];
				if(flg) {
					for(int j = 0; j < 5; j++) {
						for(int k = h_max; k < top[j]; k++) {
							board[k][j] = board[k + 1][j];
						}
					}

					for(int j = 0; j < 5; j++) {
						int tmp = top[j];
						top[j] = 0;
						for(int k = tmp; k >= 0; k--) {
							if(board[k][j]) {
								top[j] = k + 1;
								break;
							}
						}
					}
				}
			}

			else {
				for(int j = 0; j < p; j++) {
					board[top[q - 1] + j][q - 1] = 1;
				}

				int h = top[q - 1];
				top[q - 1] += p;
				int del = 0;
				for(int j = 0; j < p; j++) {
					bool flg = true;
					for(int k = 0; k < 5; k++) {
						flg &= board[h + j][k];
					}
					if(flg) {
						for(int k = 0; k < 5; k++) {
							board[h + j - del][k] = board[h + j + 1][k];
						}
						del++;
					}
				}
				for(int j = 0; j < 5; j++) {
					for(int k = h + p - del; k < top[j] + 10; k++) {
						board[k][j] = board[k + del][j];
					}
				}
				for(int j = 0; j < 5; j++) {
					int tmp = top[j];
					top[j] = 0;
					for(int k = tmp; k >= 0; k--) {
						if(board[k][j]) {
							top[j] = k + 1;
							break;
						}
					}
				}
			}
		}

		int ans = 0;
		for(int i = 0; i < 6000; i++) {
bool flg = true;
			for(int j = 0; j < 5; j++) {
				ans += board[i][j];
flg &= board[i][j];
			}
if(flg) ans -= 5;
		}

		/*
		for(int i = 10; i >= 0; i--) {
			for(int j = 0; j < 5; j++) {
				cout << (board[i][j] ? '*' : '.');
			}
			cout << endl;
		}
		cout << endl;
		// */
		/*
		for(int i = 0; i < 5; i++)
			cout << top[i] << " ";
		cout << endl;
		// */
		cout << ans << endl;
	}
}