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;
bool t[5001][5];
int u[5];
void init();
void make_table();
int n;
int d,p,q,cnt;
int main(){

  while(cin>>n&&n!=0){
    init();
    for(int i=0;i<n;i++){

      cin>>d>>p>>q;
      q--;
      make_table();



    }
    cnt=0;
    for(int i=0;i<5000;i++)for(int j=0;j<5;j++)if(t[i][j])cnt++;
    
    cout<<cnt<<endl;
  }  
  return 0;
}

void init(){
  for(int i=0;i<=5000;i++){
    for(int j=0;j<5;j++){
      t[i][j]=false;
    }
  }
  for(int i=0;i<5;i++)u[i]=0;
}

void make_table(){
  int h;
  if(d==1){
    h=0;
    for(int j=q;j<q+p;j++)h=max(h,u[j]);
    for(int j=q;j<q+p;j++){t[h][j]=true;u[j]=h+1;}
  }else{
    h=u[q];
    for(int i=h;i<h+p;i++)t[i][q]=true;
    u[q]+=p;
  }






  h=0;
  for(int j=0;j<5;j++)h=max(h,u[j]);

  for(int i=0;i<h+1;i++){
    if(t[i][0]&&t[i][1]&&t[i][2]&&t[i][3]&&t[i][4]){
      for(int j=0;j<5;j++){
	t[i][j]=false;
      }
    }
  }
 
  /*
      for(int I=7;I>=0;I--){
	for(int j=0;j<5;j++){
	  cout<<(int)t[I][j];
	}
	cout<<endl;
      }
      cout<<endl;

  */
  int H=0;
  for(int i=0;i<=5000;i++){
    if(t[i][0]||t[i][1]||t[i][2]||t[i][3]||t[i][4]){
      for(int j=0;j<5;j++){
	t[H][j]=t[i][j];
	if(H!=i)t[i][j]=false;
      }
      H++;
    }
  }

  for(int j=0;j<5;j++){
    for(int i=4999;i>=0;i--){
      if(t[i][j]){
	u[j]=i+1;
	break;
      }
    }
  }

}

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

bool m[5000][5];
int h[5];
int sum;

bool check(int a) {
  int i, j;
  for (i=0; i<5; i++) {
    if (!m[a][i]) break;
  }
  if (i != 5) return false;
  for (i=0; i<5; i++) {
    j = a;
    while (j < h[i]) {
      m[j][i] = m[j+1][i];
      ++j;
    }
    j = h[i]-1;
    while (j>=0 && !m[j][i]) {
      --j;
    }
    h[i] = j+1;
  }
  return true;
}

int main() {
  int n, d, p, q, mh;
  while (1) {
    cin >> n;
    if (!n) break;
    sum = 0;
    for (int i=0; i<5*n; i++) {
      for (int j=0; j<5; j++) {
        m[i][j] = false;
      }
    }
    for (int i=0; i<5; i++) {
      h[i] = 0;
    }
    for (int i=0; i<n; i++) {
      cin >> d >> p >> q;
      --q;
      sum += p;
      if (d == 1) {
        mh = 0;
        for (int j=0; j<p; j++) {
          if (mh < h[j+q]) {
            mh = h[j+q];
          }
        }
        for (int j=0; j<p; j++) {
          m[mh][j+q] = true;
          h[j+q] = mh+1;
        }
        if (check(mh)) sum -= 5;
      } else {
        mh = h[q];
        for (int j=0; j<p; j++) {
          m[j+mh][q] = true;
        }
        h[q] += p;
        for (int j=p-1; j>=0; j--) {
          if (check(j+mh)) sum -= 5;
        }
      }
    }
    cout << sum << endl;
  }
  return 0;
}

C++: #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <queue>
#define MAX 200
using namespace std;

int main(void){
	int i,j,k,n,ans;
	bool f[5][MAX];
	while(1){
		cin >> n;
		if(n == 0) break;
		for(i=0;i<5;i++){
			for(j=0;j<MAX;j++) f[i][j] = false;
		}
		ans = 0;
		for(i=0;i<n;i++){
			int d,p,q;
			cin >> d >> p >> q;
			q--;
			ans += p;
			if(d == 2){
				for(j=MAX-1;j>=0;j--){
					if(j == 0 || f[q][j-1] == true){
						for(k=j;k<j+p;k++) f[q][k] = true;
						break;
					}
				}
			}
			else{
				for(j=MAX-1;j>=0;j--){
					k=5;
					if(j != 0){
						for(k=q;k<q+p;k++) if(f[k][j-1] == true) break;
					}
					if(j == 0 || k != q+p){
						for(k=q;k<q+p;k++) f[k][j] = true;
						break;
					}
				}
			}
			for(j=0;j<MAX;j++){
				for(k=0;k<5;k++) if(f[k][j] == false) break;
				if(k == 5){
					ans -= 5;
					for(k=0;k<5;k++){
						for(int t=j;t<MAX-1;t++) f[k][t] = f[k][t+1];
						f[k][MAX-1] = false;
					}
					j--;
				}
			}
		//			cout << endl;
		//		for(int ii=7;ii>=0;ii--){
		//	for(j=0;j<5;j++) cout << f[j][ii] << " ";
		//	cout << endl;
		//}
		//cout << endl;
		}
		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][6000];
int n,d,p,q;
ll int ans = 0;

int GetBottom(int x){
	REP(i,6000){
		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,6000) 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++;
						}
					}
					nowline = 0;
				}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;
}