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 "bits/stdc++.h"
using namespace std;

int fall(vector<vector<int>>&field, vector<vector<int>>&pino,int l) {
	int y = 0;
	for ( y = 0; y < field.size() - pino.size(); ++y) {
		bool ok = true;
		for (int i = 0; i < pino.size(); ++i) {
			for (int j = 0; j < pino[i].size(); ++j) {
				if (pino[i][j]) {
					if (field[y + i+1][l + j])ok = false;
				}
			}
		}
		if (!ok) {
			break;
		}
	}
	for (int i = 0; i < pino.size(); ++i) {
		for (int j = 0; j < pino[i].size(); ++j) {
			if (pino[i][j]) {
				assert(!field[y + i][l + j]);
				field[y + i][l + j] = true;
			}
		}
	}
	int delline = 0;
	for (int i = y + pino.size() - 1; i >= y; --i) {
		while (all_of(field[i].begin(), field[i].end(), [](const int a) {return a == 1; })) {
			transform(field[i].begin(), field[i].end(), field[i].begin(), [](const int a) {return false; });
			for (int j = i- 1; j >= 0; --j) {
				swap(field[j], field[j + 1]);
			}
			delline += 1;
		}
	}
	return delline;
}

int main() {
	int N;
	while (cin>>N,N) {
		int sum = 0;
		vector<vector<int>>field(5*N, vector<int>(5));
		while(N--){
			int d, p, q; cin >> d >> p >> q; q--;
			sum += p;
			vector<vector<int>>pino(d == 1 ? 1 : p, vector<int>(d == 2 ? 1 : p, 1));
			sum -= fall(field, pino, q) * 5;
		}
		cout << sum << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int main(){
	int n, d, p, q;
	while(cin >> n, n) {
		bool b[5010][5] = {};
		int up = 0;
		rep(i,n) {
			cin >> d >> p >> q;
			--q;
			bool f = 1;
			if(d == 1) {
				for(int j=up-1;j>=0;--j) {
					rep2(i,q,p+q) {				
						if(b[j][i]) {
							rep2(k,q,p+q) {
								b[j+1][k] = 1;
							}
							up = j == up-1 ? up+1 : up;
							f = 0;
							break;
						}
					}
					if(!f) break;
				}
				if(f) {
					rep2(i,q,p+q) {
						b[0][i] = 1;
					}
					up = up == 0 ? 1 : up;
				}
			} else {
				for(int j=up-1;j>=0;--j) {
					if(b[j][q]) {
						rep2(i,1,p+1) {
							b[j+i][q] = 1;
						}
						up = up <= j+p+1 ? j+p+1 : up;
						f = 0;
						break;
					}
				}
				if(f) {
					rep(i,p) {
						b[i][q] = 1;
					}
					up = up < p ? p : up;
				}
			}
			int cnt = 0;
			rep(i,up) {
				bool c = 1;
				rep(j,5) {
					if(!b[i][j]) {
						c = 0;
						break;
					}
				}
				if(c) {
					rep2(j,i,up) {
						rep(k,5) {
							b[j][k] = b[j+1][k];
						}
					}
					i--;
					cnt++;
				}
			}
			up -= cnt;
		}
		int ret = 0;
		rep(i,up) {
			rep(j,5) {
				if(b[i][j]) ret++;
			}
		}
		cout << ret << endl;
	}
	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) {

    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] = -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);
    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;
  
}