Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		h := io.NextInt()
		if h == 0 {
			break
		}
		p := make([][]int, h)
		for i := 0; i < h; i++ {
			p[i] = make([]int, 5)
			for j := 0; j < 5; j++ {
				p[i][j] = io.NextInt()
			}
		}
		ans := 0
		for {
			sc := puyo(p, h)
			if sc == 0 {
				break
			}
			fall(p, h)
			ans += sc
		}
		io.Println(ans)
	}
}

func puyo(p [][]int, h int) int {
	sc := 0
	for i := 0; i < h; i++ {
		for j := 0; j < 3; j++ {
			var cnt int
			for cnt = 1; j+cnt < 5; cnt++ {
				if p[i][j] != p[i][j+cnt] {
					break
				}
			}
			if cnt > 2 {
				sc += p[i][j]*cnt
				for k := 0; k < cnt; k++ {
					p[i][j+k] = 0
				}
			}
		}
	}
	return sc
}

func fall(p [][]int, h int) {
	for j := 0; j < 5; j++ {
		for k := 1; k < h; k++ {
			for i := h - 1; i >= k; i-- {
				if p[i][j] == 0 {
					p[i][j] = p[i-1][j]
					p[i-1][j] = 0
				}
			}
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

int h;
int map[11][6];

int main(){
  int num = 1;

  while(cin>>h){
    if(h == 0)
      break;
    // cout<<"--------------------"<<num<<"-----------------------"<<endl;
    //num++;
    memset(map,0,sizeof(map));
    for(int i = 10-h+1;i<11;i++){
      for(int j = 0;j<5;j++){
	cin>>map[i][j];
      }
    }

    int point = 0;
    bool update = true;
    /*
    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
    }
    */
    while(update){
      update = false;
      for(int i = 10-h+1;i <= 10;i++){
	int tmp = 1;
	for(int j = 1;j<6;j++){
	  if(j != 5 && map[i][j] == 0)
	    continue;
	  if(map[i][j] == map[i][j-1]){
	    tmp++;
	  }else if(tmp >= 3){
	    point += tmp * map[i][j-1];

	    update = true;
	    for(int k = j-tmp;k<j;k++){
	      for(int l = i;l >= 0;l--){
		map[l][k] = map[l-1][k];
	      }
	    }
	    tmp = 0;
	  }else{
	    tmp = 1;
	  }

	}
      }
      /*
      cout<<"--------------------------"<<endl;

    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
      }

      */
    }
    cout<<point<<endl;
  }
    
	
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

void fill_stone(vector<int> stone[5]){
    for(int i=0;i<5;++i){
        vector<int>::iterator it=stone[i].begin();
        while(it!=stone[i].end()){
            if(*it==0){
                stone[i].erase(it);
                it = stone[i].begin();
            }else ++it;
        }
    }
    for(int i=0;i<5;++i){
        for(int j=0;j<10-stone[i].size();++j){
            stone[i].push_back(0);
        }
    }
}
int erase_stone(vector<int> stone[5]){
    int score=0;
    for(int i=0;i<10;++i){
        int chain=1;
        int before=-1;
        for(int j=0;j<5;++j){
            if(stone[j][i]==before) ++chain;
            else{
                if(chain>=3){
                    score+=before*chain;
                    for(int k=j-1;k>j-chain-1;--k){
                        stone[k][i] = 0;
                    }
                }
                before = stone[j][i];
                chain = 1;
            }
        }
        if(chain>=3){
            score+=before*chain;
            for(int k=4;k>4-chain;--k){
                stone[k][i] = 0;
            }
        }
    }
    fill_stone(stone);
    return score;
}

int main(){
    while(true){
        int h;
        vector<int> stone[5];
        int cnt=0;
        int score=0;
        cin >> h;
        for(int i=h-1;i>=0;--i){
            for(int j=0;j<5;++j){
                int k;
                cin >> k;
                stone[j].insert(stone[j].begin(),k);
            }
        }
        for(int i=h;i<10;++i){
            for(int j=0;j<5;++j){
                stone[j].push_back(0);
            }
        }
        while(true){
            score = erase_stone(stone);
            if(score > 0) cnt += score;
            else break;
        }
        cout << cnt << endl;
    }
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>

using namespace std;

#define INF 999999999
#define REP(i,n) for(int i=0; i<(int)(n); i++)

int main(){
	int H;
	vector <int> p[5];
	int ans, ins;
	
	while(1){
		cin >> H;
		if(!H) break;
		ans = 0;
		REP(i,5) p[i].clear();
		REP(i,H){
			REP(j,5){
				cin >> ins;
				p[j].insert(p[j].begin(), 1, ins);
			}
		}
		int flag=1;
		while(flag){
			flag = 0;
			for(int i=p[2].size()-1;i>=0;i--){
				if(p[2][i]==p[0][i]&&p[2][i]==p[1][i]&&p[2][i]==p[3][i]&&p[2][i]==p[4][i]){
					flag++;
					ans += p[2][i] * 5;
					for(int j=0;j<5;j++)p[j].erase(p[j].begin()+i);
				}
				else if(p[2][i]==p[1][i]&&p[2][i]==p[3][i]&&p[2][i]==p[4][i]){
					flag++;
					ans += p[2][i] * 4;
					for(int j=1;j<5;j++)p[j].erase(p[j].begin()+i);
				}
				else if(p[2][i]==p[0][i]&&p[2][i]==p[1][i]&&p[2][i]==p[3][i]){
					flag++;
					ans += p[2][i] * 4;
					for(int j=0;j<4;j++)p[j].erase(p[j].begin()+i);
				}
				else if(p[2][i]==p[0][i]&&p[2][i]==p[1][i]){
					flag++;
					ans += p[2][i] * 3;
					for(int j=0;j<3;j++)p[j].erase(p[j].begin()+i);
				}
				else if(p[2][i]==p[1][i]&&p[2][i]==p[3][i]){
					flag++;
					ans += p[2][i] * 3;
					for(int j=1;j<4;j++)p[j].erase(p[j].begin()+i);
				}
				else if(p[2][i]==p[3][i]&&p[2][i]==p[4][i]){
					flag++;
					ans += p[2][i] * 3;
					for(int j=2;j<5;j++)p[j].erase(p[j].begin()+i);
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}