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 <cstring>
using namespace std;

#define REP(i,n,m) for(int i=n;i<m;i++)
#define rep(i,n) REP(i,0,n)

int t[5000][5];

void disp(void){
	for(int i=0;i<10;i++){
		for(int j=0;j<5;j++){
			cout<<(int)t[5000-10+i][j];
		}
		cout<<endl;
	}
	cout<<"---------------------\n";
}

bool stop(int ti,int tj,int d,int p){
	if(ti == 4999) return true;

	if(d == 1) REP(j,tj,tj+p){if(t[ti+1][j] == 1) return true;}
	else if(t[ti+1][tj]==1) return true;

	return false;
}

void putBlock(int ti,int tj,int d,int p){
	if(d == 1) REP(j,tj,tj+p) t[ti][j] = 1;
	else for(int i=ti;i>ti-p;i--) t[i][tj] = 1;
}

void dropBlock(int ti){
	for(int i=ti;i>0;i--){
		int sum = 0;
		rep(j,5){
			if(t[i-1][j] == 1) sum++;
			t[i][j] = t[i-1][j];
		}
		if(sum == 0) return;
	}
}

void deleteLine(int from,int to){
	int repeat = from - to;
	int i = from;
	rep(time,repeat){
		int sum = 0;
		rep(j,5) if(t[i][j] == 1) sum++;
		if(sum == 5){
			rep(j,5) t[i][j] = 0;
			dropBlock(i);
		}
		else{
			i--;
		}
	}
}

int main(void){
	int n;
	while(cin>>n,n){
		memset(t,0,sizeof(t));
		rep(i,n){
			int d,p,q;
			cin>>d>>p>>q;
			q--;
			int row;
			for(row=0;!stop(row,q,d,p);row++);
			putBlock(row,q,d,p);
			//disp();
			deleteLine(row,d==1?row-1:row-p);

			//disp();
		}

		int ans = 0;
		rep(i,5000) rep(j,5) if(t[i][j]==1) ans++;
		cout<<ans<<endl;
	}

	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<list>

using namespace std;

#define int long long

list<bool*> fld;

list<bool*>::iterator GetHeight(int l, int r)
{
	list<bool*>::iterator itr = fld.begin();
	for (; itr != fld.end(); itr++)
	{
		bool isAble = true;
		for (int j = l; j < r; j++)
		{
			if ((*itr)[j] == true) isAble = false;
		}
		if (!isAble) return --itr;
	}
	return --itr;
}

bool IsFull(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == false) return false;
	}
	return true;
}

bool IsEmpty(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == true) return false;
	}
	return true;
}

void Drop(int d, int p, int q)
{
	int l = q - 1, r = (d == 1) ? l + p : l + 1;
	list<bool*>::iterator itr = GetHeight(l, r);

	int h = (d == 1) ? 1 : p;
	for (int i = 0; i < h; i++)
	{
		if (itr == fld.begin()) fld.push_front((bool*)new bool[5]{});
		for (int j = l; j < r; j++)
		{
			(*itr)[j] = true;
		}
		if (IsFull(itr))
		{
			delete *itr;
			itr = fld.erase(itr);
		}
		itr--;
	}

	if (!IsEmpty(fld.begin())) fld.push_front((bool*)new bool[5]{});
}

signed main()
{
	int N;
	while (cin >> N, N)
	{
		fld.clear();
		fld.push_back((bool*)new bool[5]{});
		for (int i = 0; i < N; i++)
		{
			int d, p, q;
			cin >> d >> p >> q;
			Drop(d, p, q);
		}
		int ans = 0;
		for (list<bool*>::iterator itr = fld.begin(); itr != fld.end(); itr++)
		{
			for (int i = 0; i < 5; i++)
			{
				ans += ((*itr)[i] == true);
			}
		}
		printf("%d\n", ans);
	}
	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==2&&q-1+p>5)
				abort();

			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 = 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 = 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++) {
			for(int j = 0; j < 5; j++) {
				ans += board[i][j];
			}
		}

		/*
		   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;
	}
}