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 <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = a; i >= b; i--)

int h, in, c, n;
int main(void){
    while(cin >> h) {
        if(h==0) break;
        int ans = 0;
        vector<vector<int> > b;
        rep(i, 0, h) {
            vector<int> r;
            rep(i, 0, 5) {
                cin >> in;
                r.push_back(in);
            }
            b.push_back(r);
        }
        bool combo;
        do {
            combo = false;
            rep(i, 0, h) {
                c = 0;
                n = 0;
                rep(j, 0, 3) {
                    if(b[i][j]!=0 && b[i][j]==b[i][j+1] && b[i][j+1]==b[i][j+2]) {
                        c = b[i][j];
                        n = 3;
                        b[i][j] = b[i][j+1] = b[i][j+2] = 0;
                        rep(k, j+3, 5) {
                            if(b[i][k]==c) {
                                n++;
                                b[i][k] = 0;
                            } else break;
                        }
                    } 
                }
                ans += n * c;
                if(c>0) combo = true;
            }
            if(combo) {
                rep(i, 0, 5) {
                    vector<int> nz;
                    rrep(j, h-1, 0) {
                        if(b[j][i]!=0) nz.push_back(b[j][i]);
                    }
                    int nzs = nz.size();
                    rrep(j, h-1, 0) {
                        if(nzs>0) {
                            b[j][i] = nz[h-1-j];
                            nzs--;
                        } else b[j][i] = 0;
                    }
                }
            }
        } while(combo);
        cout << ans << endl;
    }
}

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

const int MAX_H = 15;
const int W = 5;
int H;
int Pazzle[MAX_H][W];

// row行目について、ランレングス圧縮？みたいなことをして、resに格納
// (first , second) := (石の数字, 並んでいる数)
void Parse(int row, vector<pair<int, int>> &res)
{
    auto &p = Pazzle[row];
    res.push_back({p[0], 1});
    for (int i = 1; i < W; ++i)
    {
        if (res.back().first != p[i])
        {
            res.push_back({p[i], 1});
        }
        else
        {
            ++res.back().second;
        }
    }
}

// 落とせる石を一マスだけ落とす
// 落とす石がなかったらfalseを返す
bool fall()
{
    bool flg = false;
    for (int i = 0; i < H - 1; ++i)
    {
        for (int j = 0; j < W; ++j)
        {
            // インデックスが増える方向に石が落ちていく
            if (Pazzle[i + 1][j] == -1 && Pazzle[i][j] != -1)
            {
                swap(Pazzle[i][j], Pazzle[i + 1][j]);
                flg = true;
            }
        }
    }
    return flg;
}

// 消せるぷよぷよを全て消す(-1にする)
// 戻り値: 消した数
int check()
{
    int res = 0;
    for (int row = 0; row < H; ++row)
    {
        vector<pair<int, int>> L;
        Parse(row, L);
        int cur = 0;
        for (auto &p : L)
        {
            if (p.first == -1 || p.second < 3)
            {
                cur += p.second;
                continue;
            }
            // -1に塗りつぶし
            for (int i = cur; i < cur + p.second; ++i)
            {
                res += Pazzle[row][i]; // スコア
                Pazzle[row][i] = -1;
            }
            cur += p.second;
        }
    }

    // デバッグ
    /*
    for (int i = 0; i < H; ++i)
    {
        for (int j = 0; j < W; ++j)
        {
            printf("%d%c", Pazzle[i][j], j == W - 1 ? '\n' : '\t');
        }
    }
    printf("\n");
    */
    // 石を落とす
    while (fall())
    {
    }
    /*
    for (int i = 0; i < H; ++i)
    {
        for (int j = 0; j < W; ++j)
        {
            printf("%d%c", Pazzle[i][j], j == W - 1 ? '\n' : '\t');
        }
    }
    printf("\n");
    */
    return res;
}

bool solve()
{
    cin >> H;
    if (H == 0)
        return false;

    for (int i = 0; i < H; ++i)
    {
        for (int j = 0; j < W; ++j)
        {
            cin >> Pazzle[i][j];
        }
    }

    int res = 0;
    int add = 0;
    while ((add = check()) > 0)
        res += add;
    cout << res << endl;

    return true;
}

int main()
{
    while (solve())
        ;
    return 0;
}

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

int main(){
	while(true){
		int H;
		cin>>H;
		
		if(H==0)
			break;
		
		int S[10][5];
		for(int y=0;y<H;y++)
			for(int x=0;x<5;x++)
				cin>>S[y][x];
		
		int sco=0;
		
		while(true){
			bool flg =false;
		
			for(int y=0;y<H;y++){
				int m=S[y][2];
				if(m==0)
					continue;

				if(S[y][0]==m && S[y][1]==m){
					sco += m*3;
					S[y][0]=S[y][1]=S[y][2]=0;
					flg=true;
					if(S[y][3]==m){
					sco += m;
					S[y][3]=0;
					if(S[y][4]==m){
					sco += m;
					S[y][4]=0;
					}
					}
				}
				else if(S[y][1]==m&&S[y][3]==m){
					sco += m*3;
					S[y][1]=S[y][2]=S[y][3]=0;
					flg=true;
					if(S[y][4]==m){
					sco += m;
					S[y][4]=0;
					}
				}
				else if(S[y][4]==m&&S[y][3]==m){
					sco += m*3;
					S[y][2]=S[y][3]=S[y][4]=0;
					flg=true;
					}
				}
				if(!flg)
					break;
	
				for(int x=0;x<5;x++){
					for(int y=H-1;y>=0;y--){
						if(S[y][x]!=0)
							continue;
		
						for(int y2=y-1;y2>=0;y2--){
							if(S[y2][x]!=0){
								S[y][x]=S[y2][x];
								S[y2][x]=0;
								break;
							}
						}
					}
				}

			}

			cout<<sco<<endl;
			}
		return 0;
	}