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 <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define Whole(xs) xs.begin(), xs.end()

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    if (vs.empty()) return os << "[]";
    os << "[" << vs[0];
    for (int i = 0; i < vs.size(); i++) os << " " << vs[i];
    return os << "]";
}
ostream& operator<<(ostream& os, const vector<int>& vs) {
    if (vs.empty()) return os << "[]";
    bool flag = false;
    os << "[";
    for (int i = 0; i < vs.size(); i++) {
        if (flag) {
            os << " ";
        } else {
            flag = true;
        }
        for (int j = 0; j < 5; j++) {
            os << ( (vs[i] & (1 << j)) > 0 );
        }
    }
    return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int N;
vector<int> F;
bool Input() {
    cin >> N;
    F.clear();
    return N != 0;
}

void WSet(int Q, int P) {
    int R = 0;
    for (int i = Q; i < Q + P; i++) {
        R ^= (1 << i);
    }
    if (F.empty()) {
        F.push_back(R);
    } else{
        if ((F.back() & R) == 0) {
            F.back() ^= R;
        } else {
            F.push_back(R);
        }
    }
}

void HSet(int Q, int P) {   
    if (F.empty()) {
        for (int i = 0; i < P; i++) {
            F.push_back(1 << Q);
        }
        return;
    }
    int Rem = P;
    for (int i = F.size() - 1; i >= -1; i--) {
        if (i < 0 || F[i] & (1 << Q)) {
            for (int j = i + 1, c = 0; c < P && j < F.size(); c++, j++) {
                Rem--;
                F[j] ^= (1 << Q);
            }
            break;
        }
    }
    for (int i = 0; i < Rem; i++) {
        F.push_back(1 << Q);
    }
}

void Fall() {
    vector<int> nF;
    for (int i = 0; i < F.size(); i++) {
        if (F[i] != (1 << 5) - 1) {
            nF.push_back(F[i]);
        }
    }
    F = nF;
}

void Solve() {
    for (int n = 0; n < N; n++) {
        int D, P, Q; cin >> D >> P >> Q;
        Q--;
        if (D == 1) {
            WSet(Q, P);
        } else {
            HSet(Q, P);
        }
        //cout << F << endl;
        Fall();
    }
    //cout << F << endl;
    int Ans = 0;
    for (int i = 0; i < F.size(); i++) {
        for (int j = 0; j < 5; j++) {
            if (F[i] & (1 << j)) {
                Ans++;
            }
        }
    }
    cout << Ans << endl;
}

int main() {
    while (Input()) {
        Solve();
    }
    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(1){
		cin >> n;
		if(n==0) break;
		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) {
						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;
}