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;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<=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=u[j]+1;i>=0;i--){
      if(t[i][j]){
	u[j]=i+1;
	break;
      }
    }
  }

}

C++: #include<iostream>
#define N 10020
using namespace std;
int main(){
  while(true){
    int n;
    int ans=0;
    scanf("%d",&n);

    if(n==0)break;
    int row[N]={0,};
    int h[5]={0,};
    for(int i = 0; i < n; ++i){
      int mh = 0;
      int d,p,q;
      scanf("%d%d%d", &d, &p, &q);
      --q;
      
      if(d==1){
	int maxh = 0;
	for(int j = q; j < q + p; ++j){
	  maxh = max( maxh, h[j] );
	}
	for(int j = q; j < q + p; ++j){
	  h[j] = maxh + 1;
	}
	row[maxh]+=p;
      }else{
	for(int j = h[q]; j < p + h[q]; ++j){
	  row[ j ]++;
	}
	h[q]+=p;
      }

      // cout << " DROPPED : " << i << endl;
      for(int j = 0; j < 5; ++j){
	mh = max( mh , h[j] );
      }

      for(int j = 0; j < mh; ++j){
	// cout << " row["<<j<<"] = " << row[j] << endl;
	if( row[j] == 5 ){
	  for(int k = 0; k < 5; ++k){
	    --h[k];
	  }
	  for(int k = j; k < mh+2; ++k){
	    row[k] = row[k + 1];
	  }
	  j = -1;
	  continue;
	}
      }
    }
    for(int i = 0; i < N; ++i){
      ans += row[i];
    }
    printf("%d\n",ans);
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<cassert>
#include<sstream>
#include<numeric>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()

using namespace std;

typedef unsigned int uint;
typedef long long ll;

#define MAX 100100

int b[25000][5];

int main(){
  int n;
  while(scanf("%d",&n), n){
    int h[5] = {0};
    REP(cc,n){
      int d,p,q;
      scanf("%d%d%d",&d,&p,&q);
      //printf("%d: d=%d, p=%d, q=%d\n",cc,d,p,q);
      --q;
      if(d == 1){
	int pos = *max_element(h+q, h+q+p);
	REP(i,p){
	  b[pos][q+i] = 1;
	  h[i] = pos+1;
	}
	if(accumulate(b[pos], b[pos]+5, 0) == 5){
	  REP(i,5) b[pos][i] = 0;
	}
      }else{
	int pos = h[q];
	REP(i,p) b[pos + i][q] = 1;
	h[q] += p;
	REP(i,p) if(accumulate(b[pos+i], b[pos+i]+5, 0) == 5)
	  REP(j,5) b[pos+i][j] = 0;
	int mx =*max_element(h, h+5);
	//printf("pos = %d\n",pos);
	for(int i=pos; i<mx-1; i++) if(accumulate(b[i], b[i]+5, 0) == 0){
	    int t = 0;
	    while(i+t < mx && accumulate(b[i+t], b[i+t]+5, 0) == 0)
	      ++t;
	    for(int j=i; j<mx; j++)
	      REP(k,5){
		b[j][k] = b[j+t][k];
		b[j+t][k] = 0;
	      }
	    --mx;
	    REP(k,5) --h[k];
	  }
      }
      REP(i,5){
	while(h[i] > 0 && b[h[i]-1][i] == 0)
	  h[i]--;
      }
      /*
      int mx = *max_element(h, h+5);
      for(int i=mx-1; i>=0; i--) { REP(j,5) printf("%d ",b[i][j]); puts(""); }
      printf("----------\n");
      REP(i,5) printf("%d ",h[i]); puts("");puts("");
      */
    }
    int mx = *max_element(h, h+5);
    int ans = 0;
    REP(i,mx) REP(j,5) if(b[i][j] == 1){
      b[i][j] = 0;
      ++ans;
    }
    printf("%d\n",ans);
  }
  return 0;
}

C++: #include<stdio.h>
#include<bitset>
#include<list>
typedef std::list<std::bitset<5> >L;
typedef L::iterator I;
void V(L&l,int p,int q)
{
	l.insert(l.begin(),p,0);
	I i;
	for(i=l.begin();i!=l.end();++i)
		if((*i)[q])
			break;
	int k;
	for(k=0;k<p;++k)
		(*--i)[q]=1;
	for(k=0;k<p;++k)
	{
		if(i->count()==5)i=l.erase(i);
		else++i;
	}
}
void H(L&l,int p,int q)
{
	l.insert(l.begin(),1,0);
	I i;
	int k;
	for(i=l.begin();i!=l.end();++i)
		for(k=0;k<p;++k)
			if((*i)[k+q])
				goto E;
E:;
	for(--i,k=0;k<p;++k)
		(*i)[k+q]=1;
	if(i->count()==5)l.erase(i);
}
int main()
{
	int n,d,p,q;
	L l;
	while(scanf("%d",&n),n)
	{
		l.clear();
		while(n--)
		{
			scanf("%d%d%d",&d,&p,&q);
			if(d>1)V(l,p,q-1);
			else H(l,p,q-1);
	while(!l.empty()&&l.begin()->count()==0)l.pop_front();
		}
		int r=0;
		for(I i=l.begin();i!=l.end();++i)r+=i->count();
		printf("%d\n",r);
	}
	return 0;
}