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<cstring>
 
using namespace std;
 
const int Height = 5010;
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; 
}
 
int getH(int d, int len, int pos){
  for(int i = top+6; i>=0; i--){
    int h = i;
    int w = pos;
    for(int j = 0; j < len; j++){
      if(field[h][w] != '?') return i+1;
      h += dy[d];
      w += dx[d];
    }
  }
}

void down(int n){
 
  for(int i = n; i <= top+6; i++)
    for(int j = 0; j < Width; j++) field[i][j] = field[i+1][j];
  // top--;
}

void erase(){

  for(int i = 0; i <= top+6; i++){
    bool f = true;
    for(int j = 0; j < Width; j++) if(field[i][j] == '?') f = false;
    if(f){
      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;
}

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

int bit(int bits) {
  bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
  bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
  bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
  bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
  return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}


int main(){
	int n,a,b,c,mask,ret;
	while(cin >> n && n){
		vector<int> data(5001,0);
		data[5000] = 63;
		ret = 0;
		while(n--){
			cin >> a >> b >> c;
			c--;
			if(a==1){
				mask  =  ( (1<<b)-1 ) << c;
				for(int i=0;i+1<data.size();i++){
					if(data[i+1] & mask){
						data[i] += mask;
						break;
					}
				}
			}else{
				mask  = 1 << c;
				for(int i=0;i+1<data.size();i++){
					if(data[i+1] & mask){
						for(int j=0;j<b;j++)
							data[i-j]+=mask;
						break;
					}
				}		
			}
			vector<int>::iterator it = data.begin();
			while(it != data.end()){
				if((*it) == 31){
					it = data.erase(it);
					it--;
				}
				it++;
			}
		}
		for(int i=0;i<data.size()-1;i++){
			ret += bit( data[i] );
		}
		cout << ret << endl;
	}
}

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

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30
#define UNDER 10000

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int t[UNDER + 10][5], n;

int count() {
	int res = 0;
	rep(i, UNDER)
		rep(j, 5)
			if (t[i][j] == 1)
				res++;
	return res;
}

void deleteblock() {
	for (int y = UNDER - 1; y >= 0; y--) {
		int f = 0;
		rep(i, 5)
			if (t[y][i] == 0) {
				f = 1;
				break;
			}
		if (f)
			continue;
		rep(i, 5)
		{
			for (int c = y; c > 0; c--) {
				t[c][i] = t[c - 1][i];
			}
		}
		t[0][0] = t[0][1] = t[0][2] = t[0][3] = t[0][4] = 0;
		y++;
	}
	return;
}

int main() {
	while (scanf("%d", &n) && n) {
		int d, p, q;
		memset(t, 0, sizeof(t));
		rep(i, 5)
			t[UNDER][i] = 1;

		rep(i, n)
		{
			scanf("%d%d%d", &d, &p, &q);
			q--;
			if (d == 1) {
				REP(y, 1, UNDER+1)
				{
					int f = 0;
					REP(x, q, q+p)
						if (t[y][x] == 1)
							f = 1;
					if (!f)
						continue;
					REP(x, q, q+p)
						t[y - 1][x] = 1;
					break;
				}
			} else {
				rep(y, UNDER+1)
				{
					if (!t[y][q])
						continue;
					for (int c = y - 1; c > y - p - 1; c--)
						t[c][q] = 1;
					break;
				}
			}
			deleteblock();
			/*      REP(i, 990, UNDER+1){
			 rep(j, 5) printf("%d ", t[i][j]); puts("");
			 }*/
		}

		printf("%d\n", count());
	}
	return 0;
}

C++: #include<iostream>
#include<cstring>
  
using namespace std;
  
const int Height = 5100;
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+10; 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+6; i++)
    for(int j = 0; j < Width; j++) field[i][j] = field[i+1][j];
  // top--;
}
 
void erase(){
 
  for(int i = 0; i <= top+10; i++){
    bool f = true;
    for(int j = 0; j < Width; j++) if(field[i][j] == '?') f = false;
    if(f){
      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;
}