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<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<list>

using namespace std;

#define int long long

list<bool*> fld;

list<bool*>::iterator GetHeight(int l, int r)
{
	list<bool*>::iterator itr = fld.begin();
	itr++;
	for (; itr != fld.end(); itr++)
	{
		for (int j = l; j < r; j++)
		{
			if ((*itr)[j] == true) return --itr;
		}
	}
	return --itr;
}

bool IsFull(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == false) return false;
	}
	return true;
}

bool IsEmpty(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == true) return false;
	}
	return true;
}

void Drop(int d, int p, int q)
{
	if (!IsEmpty(fld.begin())) fld.push_front((bool*)new bool[5]{});
	int l = q - 1, r = (d == 1) ? l + p : l + 1;
	list<bool*>::iterator itr = GetHeight(l, r);

	int h = (d == 1) ? 1 : p;
	for (int i = 0; i < h; i++)
	{
		if (itr == fld.begin()) fld.push_front((bool*)new bool[5]{});
		for (int j = l; j < r; j++)
		{
			(*itr)[j] = true;
		}
		if (IsFull(itr))
		{
			delete *itr;
			itr = fld.erase(itr);
		}
		itr--;
	}
}

signed main()
{
	int N;
	while (cin >> N, N)
	{
		fld.clear();
		fld.push_back((bool*)new bool[5]{});
		for (int i = 0; i < N; i++)
		{
			int d, p, q;
			cin >> d >> p >> q;
			Drop(d, p, q);
		}
		int ans = 0;
		for (list<bool*>::iterator itr = fld.begin(); itr != fld.end(); itr++)
		{
			for (int i = 0; i < 5; i++)
			{
				ans += ((*itr)[i] == true);
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)

int n, hmax;
bool maps[6000][5];

int serch(int x, int l) {
	for (int i = hmax; i >= 0; i--) {
		REP(j, l) if (maps[i][x + j]) return i + 1;
	}
	return 0;
}

int check(int y, int l) {
	FOR(i, y, hmax) {
		bool flag = true;
		REP(j, 5) if (!maps[i][j]) flag = false;
		if (flag) return i;
	}
	return -1;
}

void bset(int d, int p, int q) {
	int hl = d == 1 ? p : 1;
	int hpos = serch(q - 1, hl);
	
	if (d == 1) REP(i, p) maps[hpos][q + i - 1] = true;
	else REP(i, p) maps[hpos + i][q - 1] = true;
	hmax += max(hmax, hpos + hl);
	
	int tmp;
	while ((tmp = check(hpos, hl)) != -1) {
		REP(i, 5) maps[tmp][i] = false;
		FOR(i, tmp, hmax) {
			REP(j, 5) swap(maps[i][j], maps[i + 1][j]);
		}
		hmax--;
	}
}

int main() {
	while (cin >> n, n) {
		memset(maps, 0, sizeof(maps));
		hmax = 0;
		
		while (n--) {
			int d, p, q;
			scanf("%d %d %d", &d, &p, &q);
			bset(d, p, q);
			
			cout << count(maps[0], maps[6000], true) << endl;
		}
	}
	return 0;
}

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

class TETORIS {
public:
    int N;
    vector<vector<int> > bd;
    TETORIS() : N(0) {}
    void put(int len, int pos) {
        int k;
        for (k=bd.size()-1; k>=0; --k) {
            for (int i=0; i<len; ++i) {
                if (bd[k][pos+i]) goto brk;
            }
        } brk:;
        ++k;
        if ((int)bd.size() == k) bd.push_back(vector<int>(5, 0));
        for (int i=0; i<len; ++i) {
            bd[k][pos+i] = 1;
        }
        N += len;
    }
    void update() {
        for (int i=bd.size()-1; i>=0; --i) {
            if (bd[i][0] && bd[i][1] && bd[i][2] && bd[i][3] && bd[i][4]) {
                bd.erase(bd.begin()+i);
                N -= 5;
            }
        }
    }
};

int main() {
    int n;
    while (cin >> n) {
        TETORIS tet;
        int d, p, q;
        for (int i=0; i<n; ++i) {
            cin >> d >> p >> q;
            --q;
            if (d == 1) {
                tet.put(p, q);
                tet.update();
            } else {
                for (int j=0; j<p; ++j) tet.put(1, q);
                tet.update();
            }
        }
        cout << tet.N << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<cstring>
 
using namespace std;
 
const int Height = 5500;
const int Width = 5;
char field[Height][Width];
int top,ans;
int dx[] = {1,0};
int dy[] = {0,-1};
 
 
void print(int h, int w){
 
  for(int i = 0; i < h; i++){
    for(int j = 0; j < w; j++) cout << field[i][j];
    cout << endl;
  }
  cout << endl;
     
}
bool isInside(int h, int w){return 0<=h&&h<Height&&0<=w&&w<Width;}
 
int getH(int d, int len, int pos){
  for(int i = top+1; i>=0; i--){
    int h = i;
    int w = pos;
    for(int j = 0; j < len; j++){
      if(field[h][w] != '?' || !isInside(h,w)) return i+1;
      h += dy[d];
      w += dx[d];
    }
  }
}

void down(int n){

  for(int i = n; i <= top+5; i++)
    for(int j = 0; j < Width; j++) field[i][j] = field[i+1][j];

}

void erase(){

  for(int i = 0; i <= top; i++){
    bool f = true;
    for(int j = 0; j < Width; j++) if(field[i][j] == '?') f = false;
    if(f){
      for(int j = 0; j < Width; j++) field[i][j] = '?';
      ans -= 5;
      down(i--);
    }
  }
}
 
void put(int d, int len, int pos){
 
  int nex = getH(d,len,pos);
  top = max(top,nex);
 
  int h = nex;
  int w = pos;
 
  for(int i = 0; i < len; i++){
    field[h][w] = '.';
    h += dy[d];
    w += dx[d];
  }
}
 
int main(){
 
  int n;
  while(cin >> n && n){
    memset(field,'?',sizeof(field));
    ans = top = 0;
    
    while(n--){
      int d, len, pos;
      cin >> d >> len >> pos;
      ans += len;
      put(d-1,len,pos-1);
      erase();
    }
    cout << ans << endl;
    print(10,5);
  }
  return 0;
}