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;

char stage[2][5000][5];

int main()
{
    int n;
    
    while (scanf("%d", &n) && n){
        int height[5] = {0};
        int turn = 0;
        int ct = 0;
        memset(stage, 0, sizeof(stage));
        for (int rep = 0; rep < n; rep++){
            int d, p, q;
            scanf("%d %d %d", &d, &p, &q); --q;
            if (d == 1){
                int mh = *max_element(height + q, height + p + q);
                for (int j = q; j < p + q; j++){
                    stage[turn][mh][j] = 1;
                    height[j] = mh + 1;
                }
            }
            else {
                for (int j = 0; j < p; j++){
                    stage[turn][height[q]++][q] = 1;
                }
            }
            
            int look = *max_element(height, height + 5);
            memset(stage[1 - turn], 0, sizeof(stage[1 - turn]));
            memset(height, 0, sizeof(height));
            ct = 0;
            int nh = 0;
            for (int i = 0; i < look; i++){
                bool ok = true;
                for (int j = 0; j < 5; j++){
                    if (stage[turn][i][j] == 0) ok = false;
                }
                if (!ok){
                    for (int j = 0; j < 5; j++){
                        stage[1 - turn][nh][j] = stage[turn][i][j];
                        if (stage[1 - turn][nh][j]){
                            height[j] = nh + 1;
                            ct++;
                        }
                    }
                    nh++;
                }
            }
            turn = 1 - turn;
        }
        
        printf("%d\n", ct);
    }
    
    return (0);
}

C++: #include <iostream>
#include <algorithm>
#define H_MAX 10001
using namespace std;

void breakLine(int data[H_MAX][5], int y) {
  for(int i = y; i+1 < H_MAX; i++) {
    for(int j = 0; j < 5; j++) {
      data[i][j] = data[i+1][j];
    }
  }
}

void search(int data[H_MAX][5], int sy, int ey) {
  for(int i = sy; i <= ey; i++) {
    bool flag = true;
    for(int j = 0; j < 5; j++) {
      if(data[i][j] != 1) {
	flag = false;
	break;
      }
    }
    if(flag) {
      breakLine(data, i);
      i--;
    }
  }
}

int main() {
  while(1) {
    int n;
    cin >> n;
    if(n == 0) break;

    int data[H_MAX][5];

    for(int i = 0; i < H_MAX; i++) {
      for(int j = 0; j < 5; j++) {
	if(i == 0) data[i][j] = 1;
	else      data[i][j] = 0;
      }
    }

    for(int i = 0; i < n; i++) {
      int d, p, q, qy;
      cin >> d >> p >> q;
      q--;
      for(int y = H_MAX-1; y >= 0; y--) {
	bool put = false;
	switch(d) {
	case 1:
	  for(int j = 0; j < p; j++) {
	    if(data[y][q+j] == 1) {
	      put = true;
	      y++;
	      qy = y;
	      for(int k = 0; k < p; k++) {
		data[y][q+k] = 1;
	      }
	      break;
	    }
	  }
	  break;
	case 2:
	  if(data[y][q] == 1) {
	    put = true;
	    y++;
	    qy = y;
	    for(int j = 0; j < p; j++) {
	      data[y+j][q] = 1;
	    }
	  }
	  break;
	}
	if(put) {
	  break;
	}
      }

      switch(d) {
      case 1: search(data, qy, qy); break;
      case 2: search(data, qy, qy+p-1); break;
      }
    }

    int count = 0;
    for(int i = 1; i < H_MAX; i++) {
      for(int j = 0; j < 5; j++) {
	count += data[i][j];
      }
    }
    cout << count << endl;
  }
  return 0;
}

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

			else {
				for(int j = 0; j < p; j++) {
					board[top[q - 1] + j][q - 1] = 1;
				}
				top[q - 1] += p;
			}
			/*
			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 < 6000; i++) {
			bool flg = true;
			for(int j = 0; j < 5; j++)
				flg &= board[i][j];
			if(flg)
				ans -= 5;
		}

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

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

using namespace std;

int n, d, p, q;

int main()
{
    cin >> n;
    
    vector<vector<bool> > c(5000, vector<int>(5, false));
    
    for(int i = 0; i < n; i++)
    {
        cin >> d >> p >> q;
        
        if(d == 1)
        {
            int maxh = -1;
            
            for(int j = p - 1; j < p + q - 1; j++)
            {
                int r = 5000;
                
                while(r--)
                {
                    if(c[r][j] == true)
                    {
                        break;
                    }
                }
                
                maxh = max(maxh, r + 1);
            }
            
            for(int j = p - 1; j < p + q - 1; j++)
            {
                c[maxh][j] = true;
            }
        }
        else
        {
            int r = 5000;
            
            while(r--)
            {
                if(c[r][p] == true)
                {
                    break;
                }
            }
            
            for(int j = r + 1; j < r + q + 1; j++)
            {
                c[j][p] = true;
            }
        }
    }
    
    int sum = 0;
    
    for(int i = 0; i < 5000; i++)
    {
        for(int j = 0; j < 5; j++)
        {
            sum += (c[j][p] ? 1 : 0);
        }
    }
    
    cout << sum << endl;
    
    return 0;
}