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>
using namespace std;
int a[5000][5];
int main() {
	int n;
	while (cin >> n&&n != 0) {
		long long sum = 0;
		int h = 0;
		for (int i = 0; i < 5000; i++)
			fill(a[i], a[i] + 5, 0);
		for (int i = 0; i < n; i++) {
			int d, p, q;
			cin >> d >> p >> q;
			q--;
			if (d == 1) {
				int k = h;
				for (int j = h; j >= 0; j--) {
					bool b = true;
					for (int z = q; z < (p + q); z++) {
						if (a[j][z] == 1) b = false;
					}
					if (b)
						k = j;
					else
						break;
				}
				for (int z = q; z < (p + q); z++) {
					a[k][z] = 1;
				}
				if (k >= h) h = k+1;
				sum += p;
			}
			else {
				int k = h;
				for (int j = h; j >= 0; j--) {
					bool b = true;
					for (int z = 0; z < p; z++) {
						if (a[j + z][q] == 1) b = false;
					}
					if (b)
						k = j;
					else
						break;
				}
				for (int z = 0; z < p; z++) {
					a[k + z][q] = 1;
				}
				if (k + p > h) h = k + p;
				sum += p;
			}
			for (int i = h; i >= 0; i--) {
				bool b = true;
				for (int j = 0; j < 5; j++) {
					if (a[i][j] == 0) b = false;
				}
				if (b) {
					for (int j = i; j <= h+1; j++) {
						for (int z = 0; z < 5; z++) {
							a[i][z] = a[i + 1][z];
						}
					}
					h--;
					sum -= 5;
				}
			}
		}
		for (int i = 0; i < h; i++) {
			if (a[i][0] == 1 && a[i][1] == 1 && a[i][2] == 1 && a[i][3] == 1 && a[i][4] == 1)
				sum -= 5;
		}
		cout << sum << endl;
	}
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
#include <map>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<30;

int main() {
  int n;
  while(cin >> n, n) {
    int height[5] = {}; // ツ各ツ療アツづ可堕カツ催敖つキツづゥツブツδ債ッツクツづ個暗ェツ氾板湘」ツづ個暗ェツ古つ湘」
    bool ba[5][5010] = {};

    while(n--) {
      int d, p, q;
      cin >> d >> p >> q;
      q--;
      if (d == 1) {
        int ma = 0;
        for (int i=q; i<p+q; ++i) {
          ma = max(ma, height[i]);
        }
        for (int i=q; i<p+q; ++i) {
          ba[i][ma] = 1;
          height[i] = ma + 1;
        }
        bool f = 1;
        REP(i,5)
          if (!ba[i][ma])
            f = 0;
        if (f) {
          REP(i,5) {
            for (int j=ma+1; j<height[i]; ++j)
              if (j>0)
                ba[i][j-1] = ba[i][j];
            ba[i][height[i]-1] = 0;
            while(height[i] > 0 && !ba[i][height[i]-1])
              height[i]--;
          }
        }
      } else {
        REP(i,p) {
          ba[q][height[q]+i] = 1;
        }
        height[q] += p;
        for (int k=height[q]-p; k<height[q]; ++k) {
          bool f = 1;
          REP(i,5)
            if (!ba[i][k])
              f = 0;
          //    cout << k << " " << f << endl;
          if (f) {
            REP(i,5) {
              for (int j=k+1; j<height[j]; ++j) {
                if (j > 0)
                  ba[i][j-1] = ba[i][j];
              }
              ba[i][height[i]-1] = 0;
              while(height[i] > 0 && !ba[i][height[i]-1])
                height[i]--;
            }
            // REP(i,10) {
            //   REP(j,5) {
            //     cout << ba[j][9-i];
            //   }
            //   cout << endl;
            // }
            // cout << endl;
            k--;
          }
        }
      }
      // REP(i,10) {
      //   REP(j,5) {
      //     cout << ba[j][9-i];
      //   }
      //   cout << endl;
      // }
      // REP(i,5)
      //   cout << height[i] << " ";
      // cout << endl << endl;;
    }
    int ans = 0;
    REP(i,5)
      REP(j,5010)
        if (ba[i][j])
          ans++;
    cout << ans << endl;
  }
}

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++) {
						board[h_max][j] = 0;
						for(int k = h_max + 1; k < top[j]+10; k++) {
							board[k - 1][j] = board[k][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]; 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;
						}
					}
				}
			}
			/*
			for(int i = 10; i >= 0; i--) {
				for(int j = 0; j < 5; j++) {
					cout << (board[i][j] ? '*' : '.');
				}
				cout << endl;
			}
			cout << endl;
			// */
		}

		int ans = 0;
		for(int i = 0; i < 6000; i++) {
			for(int j = 0; j < 6; j++) {
				ans += board[i][j];
			}
		}

		cout << ans << endl;
	}
}