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>
using namespace std;

int main() {
	int i,j,n,a,b,c,d,e,f,g,m[5050];
	while(cin >> n) {
		if (n==0) break;
		for (j=0;j<5050;j++) m[j]=0; d=1;
		for (i=0;i<n;i++) {
			cin >> a >> b >> c;
			f=a >1 ? 1 << (c-1) : ((1 << b)-1)  << (c-1);  
			for (j=d;j>=0;j--) if ( m[j]+f != (m[j] | f)) break;
			e=g=j+1; 
			if (a==1) { m[e]+=f; d++;}  else for (j=0;j<b;j++) { m[e+j]+=f; d++;}
			for (j=g; j<d+5; j++) if (m[j]<31) m[e++]=m[j]; 
		}
		f=0;
		for (i=0;i<5050;i++) for (j=0;j<5;j++) f+=(m[i] & ( 1 << j))>0;
		for (i=10;i>=0;i--) {
			for (j=4;j>=0;j--) if ((m[i] & (1 << j))>0) cout << '1'; else cout << '0';
			cout << endl;
		}
		cout << f << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod 1e9+7

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

int main() {
  int n;
  while(cin >> n) {
    if(!n) return 0;
    int m[5][5005] = {};
    int gou = 0;
    rep(i, 0, n) {
      int d, p, q;
      cin >> d >> p >> q;
      gou += p;
      if(d == 1) {
        dep(j, 4998, 0) {
          int f = 0;
          rep(k, q - 1, p) {
            if(m[k][j]) {
              rep(l, q - 1, p) {
                m[l][j + 1] = 1;
              }
              f = 1;
              break;
            }
          }
          if(f) break;
          if(j == 0) {
            rep(l, q - 1, p) {
              m[l][j] = 1;
            }
            break;
          }
        }
      }else {
        dep(j, 4998, 0) {
          int f = 0;
          if(m[q - 1][j - (p - 1)]) {
            rep(k, 0, p) {
              m[q - 1][j + k] = 1;
              f = 1;
              break;
            }
          }
          if(f) break;
          if(j == 0) {
            rep(l, 0, p) {
              m[q - 1][j + l] = 1;
            }
            break;
          }
        }
      }
    }

    rep(i, 0, 5005) {
      int f = 0;
      rep(j, 0, 5) {
        if(!m[j][i]) {
          f = 1;
          break;
        }
      }
      if(!f) gou -= 5;
    }

    rep(i, 0, 10) {
      rep(j, 0, 5) {
        cout << m[j][i];
      }
      cout << endl;
    }

    cout << gou << endl;
  }
}

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        int n;
        cin >> n;
        if(n == 0)
            return 0;

        list<bitset<5> > board(1, (1<<5)-1);
        while(--n >= 0){
            int d, p, q;
            cin >> d >> p >> q;
            bitset<5> bs;
            if(d == 1){
                for(int i=q-1; i<q-1+p; ++i)
                    bs[i] = true;
                p = 1;
            }else{
                bs[q-1] = true;
            }

            list<bitset<5> >::iterator it = board.begin();
            while(((*it) & bs).none())
                ++ it;

            while(--p >= 0){
                if(it == board.begin())
                    board.push_front(0);
                -- it;
                (*it) |= bs;
                if((*it) == (1<<5)-1)
                    it = board.erase(it);
            }
        }

        int ret = -5;
        list<bitset<5> >::iterator it;
        for(it=board.begin(); it!=board.end(); ++it)
            ret += it->count();
        cout << ret << endl;
    }
}

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++) {
						board[h_max][j] = 0;
						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;
						}
					}
				}
			}
			/*
			for(int i = 10; i >= 0; i--) {
				for(int j = 0; j < 5; j++) {
					cout << (board[i][j] ? '*' : '.');
				}
				cout << endl;
			}
			cout << endl;
			// */
		}

		int ans = 0;
		for(int i = 0; i < 6000; i++) {
			for(int j = 0; j < 6; j++) {
				ans += board[i][j];
			}
		}

		/*
		for(int i = 0; i < 5; i++)
			cout << top[i] << " ";
		cout << endl;
		// */
		cout << ans << endl;
	}
}