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;

int board[6000][6];

int main() {
	int n;
	while(cin >> n, n) {
		int top[8];

		for(int i = 0; i < 6000; i++)
			for(int j = 0; j < 6; j++)
				board[i][j] = 0;
		for(int i = 0; i < 8; i++)
			top[i] = 0;

		for(int i = 0; i < n; i++) {
			int d, p, q;
			cin >> d >> p >> q;

			if(d == 1) {
				int h_max = -1;
				for(int j = 0; j < p; j++) {
					h_max = max(top[q - 1 + j], h_max);
				}
				for(int j = 0; j < p; j++) {
					board[h_max][q - 1 + j] = 1;
					top[q - 1 + j] = h_max + 1;
				}

				bool flg = true;
				for(int j = 0; j < 5; j++)
					flg &= board[h_max][j];
				if(flg) {
					for(int j = 0; j < 5; j++) {
						for(int k = h_max; k < top[j]; k++) {
							board[k][j] = board[k + 1][j];
						}
					}

					for(int j = 0; j < 5; j++) {
						int tmp = top[j];
						top[j] = 0;
						for(int k = tmp; k >= 0; k--) {
							if(board[k][j]) {
								top[j] = k + 1;
								break;
							}
						}
					}
				}
			}

			else {
				for(int j = 0; j < p; j++) {
					board[top[q - 1] + j][q - 1] = 1;
				}

				int h = top[q - 1];
				top[q - 1] += p;
				int del = 0;
				for(int j = 0; j < p; j++) {
					bool flg = true;
					for(int k = 0; k < 5; k++) {
						flg &= board[h + j][k];
					}
					if(flg) {
						for(int k = 0; k < 5; k++) {
							board[h + j - del][k] = board[h + j + 1][k];
						}
						del++;
					}
				}
				for(int j = 0; j < 5; j++) {
					for(int k = h + p - del; k < top[j] + 10; k++) {
						board[k][j] = board[k + del][j];
					}
				}
				for(int j = 0; j < 5; j++) {
					int tmp = top[j];
					top[j] = 0;
					for(int k = tmp; k >= 0; k--) {
						if(board[k][j]) {
							top[j] = k + 1;
							break;
						}
					}
				}
			}
		}

		int ans = 0;
		for(int i = 0; i < 6000; i++) {
bool flg = true;
			for(int j = 0; j < 5; j++) {
				ans += board[i][j];
flg &= board[i][j];
			}
if(flg) abort();
		}

		/*
		for(int i = 10; i >= 0; i--) {
			for(int j = 0; j < 5; j++) {
				cout << (board[i][j] ? '*' : '.');
			}
			cout << endl;
		}
		cout << endl;
		// */
		/*
		for(int i = 0; i < 5; i++)
			cout << top[i] << " ";
		cout << endl;
		// */
		cout << ans << endl;
	}
}

C++: #include<cstdio>
#include<vector>

#define	pb	push_back

using namespace std;

typedef	vector<int>	vi;

char field[5050];

bool vanish(int u,int l){
	vi rem;
	for(int i=l;i>=u;i--){
		if(field[i]!=31)	rem.pb(i);
	}

	int rnum=rem.size(),h=l-u+1;
	if(rnum!=l){
		for(int i=0;i<rnum;i++)	field[l-i]=field[rem[i]];
		for(int i=u-1;i>=0;i--)	field[h-rnum+i]=field[i];
		for(int i=0;i<rnum;i++)	field[i]=0;
	}
}

int main(){
	for(int n;scanf("%d",&n),n;){
		for(int i=0;i<5050;i++)	field[i]=0;
		for(int t=0;t<n;t++){
			int type,len,p;	scanf("%d%d%d",&type,&len,&p);
			p--;

			char blk;
			if(type==1)	blk=((1<<len)-1)<<(5-p-len);
			else		blk=1<<(4-p);

			for(int i=0;i<=5050;i++){
				if(i==5050 || (field[i]&blk)!=0){
					if(type==1){
						field[i-1]|=blk;
						vanish(i-1,i-1);
					}
					else{
						for(int j=1;j<=len;j++)	field[i-j]|=blk;
						vanish(i-len,i-1);
					}
					break;
				}
			}
		}

		int cnt=0;
		for(int i=0;i<5050;i++){
			for(int j=0;j<5;j++)	if(field[i]&(1<<j))	cnt++;
		}
		printf("%d\n",cnt);
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int mp[10000000][5];
//d<muki p<nagasa q<basyo
int d,p,q;
int ktflg = 0,th;
int kesuflg =0;

void deb() {
  /*for(int i=0;i<10;i++) {
    for(int j=0;j<5;j++)
      cout << mp[i][j] << " ";
    cout << endl;
  }
  cout << "----------------------------" <<endl; */

}


void tumeru() { 
  
  int c = 0;
  for(int i=0;i<th;i++) {
    int zero = 0;
    for(int j=0;j<5;j++) if(mp[i][j] == 0) zero++;
    
    if(zero == 5) continue;
    for(int j=0;j<5;j++) mp[c][j] = mp[i][j];
    c++;
  }

  for(int i=c;i<th;i++) 
    for(int j=0;j<5;j++) 
      mp[i][j] = 0;


}

void kesu() {
  kesuflg = 0;
     int h = 0;
  while(1) {
    int flg =0;
    for(int i=0;i<5;i++) {
      if(mp[h][i] !=0) break;
      if(i == 4) flg = 1;
    }
    if(flg == 1) break;
    h++;
  }
  th = h;

  h = 0;
  while(1) {
    int zero = 0;
    int count = 0;
    for(int i=0;i<5;i++) {
      if(mp[h][i] == 0) zero++;
      else count++;
    }

    if(zero == 5) break;
    if(count == 5)
      for(int i=0;i<5;i++)
	mp[h][i] = 0;
    h++;
    kesuflg = 1;
  }
  
  
}
       

void add(int c) {

  int h = 0;
  while(1) {
    int flg =0;
    for(int i=0;i<5;i++) {
      if(mp[h][i] !=0) break;
      if(i == 4) flg = 1;
    }
    if(flg == 1) break;
    h++;
  }
  
  if(d == 1) {
    while(1) {
      if(h <= 0)break;
      int flg = 0;
      for(int i=0;i<p;i++)
	if(mp[h-1][i+q-1] != 0) break;
	else if(i == p-1) h-- ,flg = 1;
      if(flg == 0) break;
    }
  
  
    for(int i=0;i<p;i++)
      mp[h][i+q-1] = c;
  }
  
  if(d == 2) {

    int t=1;
    while(1) {
      if(h-t >= 0 && mp[h-t][q-1] == 0){
	h--;
	continue;
      }
      break;
    }
    for(int i=0;i<p;i++)mp[h+i][q-1] = c;
  }

  deb();
}
  


int main() {

  int ques;
  while(1) {
  cin >> ques;
  if(ques == 0) break;
  for(int i=0;i<50000;i++)
    for(int j=0;j<5;j++)
      mp[i][j] = 0;
  
  int c = 1;
  for(int i=0;i<ques;i++) {
    cin >> d >> p >>q;
    //cout << d <<" " << p <<" "<<q<<endl;
    add(c);
    kesu();
    tumeru();
    c++;
  }



    
  int h=0;
  int ans = 0;
  while(1) {
    int zero = 0;
    for(int i=0;i<5;i++){
      if(mp[h][i] == 0) zero++;
      else ans++;
    }
    if(zero == 5) break;
    h++;
  }
  cout << ans << endl;

  }
    return 0;
  
}