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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int d[1010], p[1010], q[1010];
int f[5010][5];

bool cant(int d, int p, int q, int r) {
  if (d == 1) {
    for (int i = 0; i < p; i++) {
      if (f[r][q + i]) return true;
    }
  } else {
    if (f[r][q]) return true;
  }
  return false;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int n;
  while (cin >> n, n) {
    memset(f, 0, sizeof(f));
    for (int i = 0; i < n; i++) {
      cin >> d[i] >> p[i] >> q[i];
      q[i]--;
    }
    for (int i = 0; i < n; i++) {
      for (int j = 4999; ; j--) {
        if (j < 0 || cant(d[i], p[i], q[i], j)) {
          if (d[i] == 1) {
            for (int k = 0; k < p[i]; k++) {
              f[j + 1][q[i] + k] = 1;
            }
          } else {
            for (int k = 0; k < p[i]; k++) {
              f[j + 1 + k][q[i]] = 1;
            }
          }
          break;
        }
      }
      bool update = true;
      while (update) {
        update = false;
        for (int j = 0; j < 5000; j++) {
          bool kieru = true;
          for (int k = 0; k < 5; k++) {
            kieru &= f[j][k];
          }
          if (kieru) {
            update = true;
            for (int k = 0; k < 5; k++) {
              f[j][k] = 0;
            }
            for (int k = j; k < 5000; k++) {
              for (int l = 0; l < 5; l++) {
                swap(f[k][l], f[k + 1][l]);
              }
            }
          }
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < 5000; i++) {
      for (int j = 0; j < 5; j++) {
        ans += f[i][j];
      }
    }
    cout << ans << endl;
  }

  return 0;
}

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 0;
}

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(cin>>n,n){
		REP(i,5) REP(j,5010) 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) {
						int nline = nowline+1;
						while(1){
							if(grid[j][nline]==-1) {
								grid[j][nline-1] = grid[j][nline];
								break;
							}
							grid[j][nline-1] = grid[j][nline];
							nline++;
						}
					}
				}else{
					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;

	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdlib>
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);
				}
if(h_max<0) abort();
				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++) {
			for(int j = 0; j < 6; 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;
	}
}