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>
#include <vector>

using namespace std;

int main()
{
	int n, d, p, q, s, t;
	
	while(cin>>n&&n){
		vector<bool> vec[5];
		
		while(n--){
			cin >> d >> p >> q;
			q--;
			if(d == 1){
				t = -1;
				for(int i = q, k = 0; k < p; i++, k++){
					for(int j = vec[i].size()-1; j >= 0; j--){
						if(vec[i][j]){
							t = max(t, j);
						}
					}
				}
				
				for(int i = q, k = 0; k < p; i++, k++){
					if(vec[i].size() <= (t+1)){
						while(vec[i].size() < (t+1)){
							vec[i].push_back(false);
						}
						vec[i].push_back(true);
					} else {
						vec[i][t+1] = true;
					}
				}
			} else {
				t = -1;
				for(int i = vec[q].size()-1; i >= 0; i--){
					if(vec[q][i]){
						t = i;
						break;
					}
				}
				s = 0;
				for(int i = t+1; i < vec[q].size() && s < p; i++, s++){
					vec[q][i] = true;
				}
				for(;s < p; s++){
					vec[q].push_back(true);
				}
			}
			t = vec[0].size();
			for(int i = 1; i < 5; i++){
				s = vec[i].size();
				t = min(s, t);
			}

			for(int i = t-1; i >= 0; i--){
				bool f = true;
				for(int j = 0; j < 5; j++){
					if(!vec[j][i]){
						f = false;
						break;
					}
				}
				
				if(f){
					for(int j = 0; j < 5; j++){
						vec[j].erase((vec[j].begin()+i));
					}
				}
			}
		}
		
		t = 0;
		for(int i = 0; i < 5; i++){
			for(int j = 0; j < vec[i].size(); j++){
				if(vec[i][j]){
					t++;
				}
			}
		}
		
		cout << t << 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 = 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 down(int n){

  for(int i = n; i < Height; 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){
      ans -= 5;
      down(i);
      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>
using namespace std;
int mp[10000000][5];
//d<muki p<nagasa q<basyo
int d,p,q;
int ktflg = 0,th;

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 t;
  for(int i=1;i<th;i++) {
    for(int j=0;j<5;j++) {
      if(mp[i][j] > 0 && ((j>0 && mp[i][j] != mp[i][j-1]) || j==0)){
	//	cout <<j<<" "<<mp[i][j]<< endl;
	int o=i;
	t = mp[i][j];
	while(1) {
	int count = 0;
	for(int k=j;k<5;k++) if(t == mp[o][k]) count++;
	int flg = 0;
	for(int k=j;k<count;k++) {
	  if(mp[o-1][k] != 0) break;
	  if(k == count-1) flg = 1;
	}
	if(flg == 1){
	  for(int k=j;k<count;k++) mp[o-1][k] = t , mp[o][k] = 0;
	  o--;
	  ktflg = 1;
	}
	if(flg == 0 || o == 0) break;
	  }
      }
      if(mp[i][j] < 0 && mp[i-1][j] == 0) {
	int t = i;
	ktflg = 1;
	while(1){
	  if(t-1 < 0 || mp[t-1][j] !=0) break;
	  mp[t-1][j] = mp[t][j],mp[t][j] = 0;
	  t--;
	}
      }
	
    }
  }
}

void kesu() {

     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++;
  }

  
}
       

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) {
    while(1) {
      int flg = 0;
    for(int i=0;i<p;i++){
      if(h-i <0 || mp[h-i][q-1] != 0) break;
      if(i == p-1)flg =1;
    }
    if(flg == 1){
      if(h-p >= 0 && mp[h-p][q-1] == 0){
	h--;
	continue;
      }
      for(int i=0;i<p;i++)mp[h-i][q-1] = -1*c;
      break;
    }
    h++;
    }
    
  }
  
}

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);
    c++;
  }
  //deb();
  ktflg = 1;
  while(1) {
    if(ktflg == 0) break;
    ktflg = 0;
    kesu();
    tumeru();
  }
  //    deb();
    
  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;
  
}