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>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int grid[5][5010];
int n,d,p,q;
ll int ans = 0;

int GetBottom(int x){
	REP(i,5000){
		if(grid[x][i]==-1) return i;
	}
	return -1;
}

bool isallclear(int x){
	REP(i,5){
		if(grid[i][x]!=-1) return false;
	}
	return true;
}

bool isallblock(int x){
	REP(i,5){
		if(grid[i][x]!=1) return false;
	}
	return true;
}

int main(){
	while(1){
		cin >> n;
		REP(i,5) REP(j,5000) grid[i][j] = -1;
		REP(i,n){
			cin >> d >> p >> q;
			if(d==2){
				int tmp = GetBottom(q-1);
				FOR(j,tmp,tmp+p) grid[q-1][j] = 1;
			}else{
				int tmp = -1;
				FOR(j,q-1,q-1+p){
					tmp = max(tmp,GetBottom(j));
				}
				FOR(j,q-1,q-1+p) {
					grid[j][tmp] = 1;
					REP(k,tmp) if(grid[j][k]==-1) grid[j][k] = 0;
				}
			}
			int nowline = 0;
			while(1){
				if(isallclear(nowline)) break;
				if(isallblock(nowline)){
					REP(j,5) grid[j][nowline] = 0;
				}
				nowline++;

			}
		}
		ans = 0;
		int line = 0;
		while(1){
			if(isallclear(line)) break;
			REP(i,5){
				if(grid[i][line]==1) ans++;
			}
			line++;
		}
		cout << ans << endl;
	}
}

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

int main(){
  int n,d,p,q;

  for(;;){
    cin >> n;
    if(!n)break;

    vector<string> board;
    for(int z=0;z<n;z++){
      cin >> d >> p >> q;

      int x,y;
      if(d==1){
	x = p;
	y = 1;
      }else{
	x = 1;
	y = p;
      }

      int tmp = -1;
      for(int i=0;i<x;i++){
	for(int j=(int)board.size()-1;j>=0;j--){
	  if(board[j][q+i-1]=='#'){
	    tmp = max(tmp,j);
	    break;
	  }
	}
      }
      for(int i=tmp+1;i<(int)board.size();i++){
	for(int j=0;j<x;j++)board[i][q+j-1] = '#';
	y--;
	if(!y)break;
      }

      string block;
      for(int i=0;i<q-1;i++)block.push_back('.');
      for(int i=0;i<x;i++)block.push_back('#');
      while(block.size()<5)block.push_back('.');
      while(y--)board.push_back(block);

      for(int i=0;i<(int)board.size();i++){
	bool f = true;
	for(int j=0;j<5;j++)
	  if(board[i][j] == '.')f = false;
	if(f){
	  board.erase(board.begin()+i);
	  i--;
	}
      }
      /*
      for(int i=0;i<(int)board.size();i++)cout << board[i] << endl;
      cout << endl;
      */
    }
    int ans = 0;
    for(int i=0;i<(int)board.size();i++)
      for(int j=0;j<5;j++)
	if(board[i][j] == '#')ans++;
    cout << ans << endl;
  }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)

const int N = 6000;
bool block[N][5];

void all_fall(int y){
  rep(j,5)block[y][j]=false;
  REP(i,y,N-1){
    rep(j,5)block[i][j]=block[i+1][j];
  }
  rep(j,5)block[N-1][j]=false;
}

int getmax(int l,int r){
  int ret=0;
  REP(j,l,r){    
    int tmp = N-1;
    for(int i=N-1;i>=0;i--){
      if (block[i][j])break;
      tmp=i;
    }
    ret=max(ret,tmp);
  }
  return ret;
}

void fall(){
  rep(i,N){
    if (block[i][0]&block[i][1]&block[i][2]&block[i][3]&block[i][4]){
      all_fall(i);
      i--;
    }
  }
}

main(){
  int n;
  while(cin>>n && n){
    rep(i,N)rep(j,5)block[i][j]=false;
    rep(i,n){
      int d,p,q;
      int wid=1,hei=1,pos;
      cin>>d>>p>>q;
      q--;
      if (d == 1){//yoko
	pos = getmax(q,q+p);	
	wid=p;
      }else if (d == 2){//tate
	pos = getmax(q,q+1);
	hei=p;
      }

      rep(i,hei){
	rep(j,wid){
	  block[pos+i][q+j]=true;
	}
      }
      fall();
    }

    cout << count(&block[0][0],&block[N][0],true) << endl;
  }
}

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

using namespace std;

int MapData[5001][6];
int N;


void solveHori(int len, int pos) {
	bool findFirstSquare;

	for (int row = 5000; row > -1; --row) {
		findFirstSquare = false;
		for (int j = 0; j < len; ++j) {
			if (MapData[row][pos+j] == 1) {
				findFirstSquare = true;
				break;
			}
		}
		if (!findFirstSquare) {
			continue;
		}
		for (int j = 0; j < len; ++j) {
			MapData[row+1][pos + j] = 1;
		}
		return;
	}
	for (int j = 0; j < len; ++j) {
		MapData[0][pos + j] = 1;
	}
}

void solveVert(int len, int pos) {
	bool findFirstSquare;

	for (int row = 5000; row > -1; --row) {
		findFirstSquare = false;
		if (MapData[row][pos] == 1) {
			findFirstSquare = true;
		}
		if (!findFirstSquare) {
			continue;
		}
		for (int j = 0; j < len; ++j) {
			MapData[row + 1 + j][pos] = 1;
		}
		return;
	}
	for (int j = 0; j < len; ++j) {
		MapData[j][pos] = 1;
	}
}

void modifyMapData(int row) {

	for (int i = row; i < 5000; i++) {
		for (int j = 1; j < 6; j++) {
			MapData[i][j] = MapData[i + 1][j];
		}
	}
	
}

void earseMapdata() {
	int cntZero, cntOne;
	
	for (int row = 0; row < 5001; ++row) {
		cntZero = cntOne = 0;
		for (int col = 1; col < 6; ++col) {
			if (MapData[row][col] == 1) {
				++cntOne;
			}
			else {
				++cntZero;
			}
		}
		if (cntZero == 5) {
			return;
		}
		if (cntOne == 5) {
			modifyMapData(row);
			--row;
		}
	}
}

int main() {
	int d, p, q, cnt;

	while (cin >> N, N) {
		memset(MapData, 0, sizeof(MapData));
		for (int i = 0; i < N; ++i) {
			cin >> d >> p >> q;

			if (d == 1) {
				//横向き
				solveHori(p, q);
			}
			else if (d == 2) {
				//縦向き
				solveVert(p, q);
			}
			earseMapdata();
		}
		cnt = 0;
		for (int row = 0; row < 5000; ++row) {
			for (int col = 1; col < 6; ++col) {
				if (MapData[row][col] == 1) {
					++cnt;
				}
			}
		}
		cout<<cnt<<endl;
	}

	return 0;
}