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 <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <random>
#include <complex>
#include <assert.h>

using namespace std;
typedef long long ll;
#define endl '\n'

template<typename T>
inline bool chmin(T& x, T a) {
	if (x >= a) { x = a; return true; }
	return false;
}

template<typename T>
inline bool chmax(T& x, T a) {
	if (x <= a) { x = a; return true; }
	return false;
}

int score;
int stone[10][5];
bool flag[10][5];

int main() {
	ios::sync_with_stdio(false);
	std::cin.tie(0);

	while (1) {
		int H; cin >> H;
		if (H == 0) { break; }
		
		score = 0;
		for (int i = 0; i < 10; i++) {
			for (int j = 0; j < 5; j++) {
				stone[i][j] = 0;
			}
		}
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				int k; cin >> k;
				stone[H - 1 - i][j] = k;
			}
		}

		bool f;
		while(1){
			f = false;
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < 5; j++) {
					flag[i][j] = false;
				}
			}
			for (int i = 0; i < H; i++) {// 隣り合うものにチェック
				for (int j = 1; j < 4; j++) {
					if (stone[i][j - 1] == stone[i][j] && stone[i][j] == stone[i][j + 1] && stone[i][j] != 0) {
						f = true;
						flag[i][j - 1] = true;
						flag[i][j] = true;
						flag[i][j + 1] = true;
					}
				}
			}
			for (int j = 0; j < 5; j++) {// 消去
				for (int i = 0; i < H; i++) {
					if (flag[i][j] == true) {
						score += stone[i][j];
						stone[i][j] = 0;
					}
				}
			}
			for (int j = 0; j < 5; j++) {// 消去
				for (int i = 0; i < H; i++) {
					if (stone[i][j] != 0) {
						int k = i;
						while (k > 0 && stone[k - 1][j] == 0) {
							stone[k - 1][j] = stone[k][j];
							stone[k][j] = 0;
							k--;
						}
					}
				}
			}
			if (f == false) {
				break;
			}
		}
		cout << score << endl;
	}

	return 0;
}

C++: #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
const int MOD=1e9+7;
const int INF=2e9;


int main() {
    ios_base::sync_with_stdio(false);

    while (1) {
        int h;
        cin >> h;
        if (h==0) break;
        vector<vector<int>> t(h,vector<int>(6));
        rep(i,h) {
            rep(j,5) cin >> t[i][j];
        }
        int ans=0,dans=1;
        while (dans>0) {
            dans=0;
            rep(i,h) {
                int cnt=1;
                rep(j,5) {
                    if (t[i][j+1]==t[i][j]) ++cnt;
                    else {
                        if (cnt>=3) {
                            dans+=t[i][j]*cnt;
                            rep(k,cnt) t[i][j-k]=0;
                        }
                        cnt=1;
                    }
                }
            }
            rep(j,5) {
                vector<int> a;
                rep(i,h) {
                    if (t[i][j]!=0) a.push_back(t[i][j]);
                }
                rep(i,h-a.size()) t[i][j]=0;
                rep(i,a.size()) t[i+h-a.size()][j]=a[i];
            }
            ans+=dans;
        }
        cout << ans << endl;
    }
    
    

    return 0;   
}

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

using namespace std;

int main()
{
	int H;

	while (true)
	{
		scanf("%d", &H);

		if (H == 0) { break; }

		vector<vector<int> > M(H, vector<int>(5));

		for (int i = 0; i < H; i++)
		{
			for (int j = 0; j < 5; j++)
			{
				scanf("%d", &M[i][j]);
			}
		}

		int ret = 0;

		while (true)
		{
			for (int i = 0; i < H; i++)
			{
				for (int j = 5; j >= 3; j++)
				{
					for (int k = 0; k <= 5 - j; k++)
					{
						bool ok = (M[i][k] != 0);

						for (int l = k + 1; l < k + j; l++)
						{
							if (M[i][l - 1] != M[i][l] || M[i][l] == 0)
							{
								ok = false;
							}
						}

						if (ok)
						{
							ret += M[i][k] * j;

							for (int l = k; l < k + j; l++)
							{
								M[i][l] = 0;
							}
						}
					}
				}
			}

			bool ok = false;

			for (int i = H - 1; i >= 1; i--)
			{
				for (int j = 0; j < 5; j++)
				{
					if (M[i][j] == 0)
					{
						M[i][j] = M[i - 1][j]; M[i - 1][j] = 0; ok = true;
					}
				}
			}

			if (!ok) { break; }
		}

		printf("%d\n", ret);
	}

	return 0;
}