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 <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 = 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++) {
			bool flg = true;
			for(int j = 0; j < 5; j++) {
				ans += board[i][j];
				flg = flg && (board[i][j] == 1);
			}
			if(flg)
				abort();
		}

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

C++: #define _USE_MATH_DEFINES
#define MAX_N 1000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;

static const double eps = 1e-8;

int gStage[6000][5];

void putBlock(int dir,int len,int pos){
	if(dir == 1){
		for(int i=6000-1;i>=0;i--){
			bool isok=true;
			for(int j=pos;j<pos+len;j++){
				if(gStage[i][j]==1) isok=false;
			}
			
			if(!isok){
				for(int j=pos;j<pos+len;j++){
					gStage[i+1][j] = 1;
				}
				return;
			}

			else if(isok && i==0){
				for(int j=pos;j<pos+len;j++){
					gStage[i][j] = 1;
				}
				return;
			}
		}
	}
	else{
		for(int i=6000-1;i>=0;i--){
			bool isok=true;
			if(gStage[i][pos]==1) isok=false;

			if(!isok){
				for(int j=i+1;j<i+1+len;j++){
					gStage[j][pos] = 1;
				}
				return;
			}

			else if(isok && i==0){
				for(int j=i;j<i+len;j++){
					gStage[j][pos] = 1;
				}
				return;
			}
		}
	}
}

int countBlock(){
	int res=0;
	for(int i=0;i<6000;i++){
		for(int j=0;j<5;j++){
			res += gStage[i][j];
		}
	}

	return res;
}

void eraseBlock(){
	for(int i=0;i<6000;i++){
		bool isok=true;
		for(int j=0;j<5;j++){
			if(gStage[i][j]==0) isok = false;
		}

		if(isok){
			for(int j=i;j+1<6000;j++){
				for(int k=0;k<5;k++){
					gStage[j][k] = gStage[j+1][k];
				}
			}
			i--;
		}
	}
}

void printBlock(){
	for(int i=0;i<50;i++){
		for(int j=0;j<5;j++){
			printf("%d",gStage[i][j]);
		}
		printf("\n");
	}
	printf("\n");
}

int main(){
	int n;
	while(~scanf("%d",&n)){
		if(n==0) break;

		memset(gStage,0,sizeof(gStage));
		for(int i=0;i<n;i++){
			int dir,len,pos;
			scanf("%d %d %d",&dir,&len,&pos);
			pos-=1;
			putBlock(dir,len,pos);
			//printBlock();
			eraseBlock();
			//printBlock();
		}

		printf("%d\n",countBlock());
	}
}

C++: include <iostream>
#include <math.h>

using namespace std;

int main() {
	int i,j,n,a,b,c,d,e,f,g,m[10000];
	while(cin >> n) {
		if (n==0) break;
		for (j=0;j<10000;j++) m[j]=0; d=0;
		for (i=0;i<n;i++) {
			cin >> a >> b >> c;
			f=a >1 ? 1 << (c-1) : ((1 << b)-1)  << (c-1);  
			for (j=d;j>=0;j--) if ( m[j]+f != (m[j] | f)) break;
			e=g=j+1;
			if (a==1) { m[e]+=f; d++;}  else for (j=0;j<b;j++) { m[e+j]+=f; d+=b;}
			for (j=g; j<g+d+1; j++) if (m[j]<31) m[e++]=m[j];
		}
		f=0;
		for (i=0;i<5000;i++) for (j=0;j<5;j++) f+=(m[i] & ( 1 << j))>0;
		cout << f << endl;
	}
	return 0;
}