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 = 5500;
const int Width = 5;
char field[Height][Width];
int top;
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 = Height-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 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] = '1';
    h += dy[d];
    w += dx[d];
  }
}

void count(){


  int sum = 0;
  
  for(int i = 0; i < Height; i++){
    int tmp = 0;
    for(int j = 0; j < Width; j++){
      if(field[i][j] != '?') tmp++;
    }
    if(tmp != 5) sum += tmp;
  }
  cout << sum << endl;
}

int main(){

  int n;
  while(cin >> n && n){
    memset(field,'?',sizeof(field));
    top = 0;

    while(n--){
      int d, len, pos;
      cin >> d >> len >> pos;
      put(d-1,len,pos-1);
    }
    count();
    //    print(10,5);
  }
  return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int ban[5010][5];
int d,p,q;

void clear(int h){
	int i,j;
	bool no;
	for(i=0;i<(d==1?1:p);i++){
		no=true;
		for(j=0;j<5;j++){
			if(ban[h+i][j]==0)no=false;
		}
		if(no){
			int k;
			for(k=h+i+1;k<5010;k++){
				for(j=0;j<5;j++){
					ban[k-1][j]=ban[k][j];
				}
			}
			i--;
		}
	}
}

int fall(){
	int i,j;
	if(d==2){
		for(i=5005;i>=0;i--){
			if(ban[i][q])break;
		}
		i++;
		for(j=0;j<p;j++){
			ban[i+j][q]=1;
		}
	}else{
		for(i=5005;i>=0;i--){
			for(j=0;j<p;j++){
				if(ban[i][q+j])goto aaa;
			}
		}
		aaa:;
		i++;
		for(j=0;j<p;j++){
			ban[i][q+j]=1;
		}		
	}
	return i;
}

int main() {
	int n;
	while(n=in()){
		memset(ban,0,sizeof(ban));
		int i;
		for(i=0;i<n;i++){
			cin>>d>>p>>q;
			q--;
			clear(fall());
//			int x,y;
//			for(y=10;y>=0;y--){
//				for(x=0;x<5;x++){
//					cout<<ban[y][x];
//				}
//				cout<<endl;
//			}
//			cout<<endl;
		}
		int j;
		int res=0;
		for(i=0;i<5010;i++){
			for(j=0;j<5;j++){
				if(ban[i][j])res++;
			}
		}
		cout<<res<<endl;
	}
	return 0;
}

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;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;
	u[j]--;
      }
    }
  }
 
  /*
      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<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[H][j]=t[i][j];
	if(H!=i)t[i][j]=false;
      }
      H++;
    }
  }
}

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

int main()
{
  int n;
  while (cin >> n) {
    if (n == 0)
      break;

    vector<int> board(6000, 0);
    board[0] = (1 << 5) - 1; // sentinel
    while (n--) {
      int d, p, q;
      cin >> d >> p >> q;

      --q;
      for (int i = 6000-1; i > 0; --i) {
	if (d == 1) {
	  // hor
	  int block = 0;
	  for (int j = 0; j < p; ++j)
	    block |= (1 << (q+j));
	  
	  if (board[i-1] & block) {
	    board[i] |= block;
	    break;
	  }
	} else {
	  // ver
	  if (board[i-1] & (1 << q)) {
	    for (int j = 0; j < p; ++j)
	      board[i+j] |= (1 << q);
	    break;
	  }
	}
      }

      int vanish = 0;
      for (int i = 1; i < 6000; ++i) {
	if (board[i] == (1 << 5) -1) {
	  ++vanish;
	} else if (vanish > 0) {
	    board[i-vanish] = board[i];
	    board[i] = 0;
	}
      }
    }

    int ans = 0;
    for (unsigned int i = 1; i < board.size(); ++i)
      ans += __builtin_popcount(board[i]);
    cout << ans << endl;
  }
  return 0;
}