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>

using namespace std;

#define ISEQUAL(i,a,b,c) Data[a][i] == Data[b][i] && Data[b][i] == Data[c][i] && Data[a][i] != 0

int main(){
	int RowNum = 0;//行数
	int* Data[5];//数値データ[列][行]
	int Points = 0;//ポイント
	bool IsComprete = false;//ルーチン終了判定用
	bool Checker[5] = { false };//行ごと消去判定用
	bool IsFall = true;//落下判定
	int FirstZeroPos = 0;//落下判定時ゼロ位置保持用

	while(1){
		cin >> RowNum;
		if (RowNum == 0)break;
		//データ代入
		for (int i = 0; i < 5; ++i){
			Data[i] = new int[RowNum];
		}
		for (int i = 0; i < RowNum; ++i){
			for (int j = 0; j < 5; ++j){
				cin >> Data[j][i];
			}
		}

		Points = 0;
		IsComprete = false;

		//ゲームルーチン
		while (!IsComprete){
			IsComprete = true;
			for (int i = 0; i < RowNum; ++i){//上から行ごとに
				for (int j = 0; j < 5; ++j){//判定用変数初期化
					Checker[j] = false;
				}
				for (int j = 0; j < 3; ++j){//消滅判定
					if (ISEQUAL(i, j, j + 1, j + 2)){
						Checker[j] = true; Checker[j + 1] = true;
						Checker[j + 2] = true;
						IsComprete = false;//消滅判定時未終了と判断
					}
				}
				for (int j = 0; j < 5; ++j){//消滅処理
					if (Checker[j]){
						Points += Data[j][i];
						Data[j][i] = 0;
					}
				}
			}
			//落下処理
			for (int j = 0; j < 5; ++j){//列ごとに
				IsFall = true;
				while (IsFall){
					FirstZeroPos = -1; IsFall = false;
					for (int i = RowNum - 1; i >= 0; --i){//下から
						if (FirstZeroPos == -1){
							if (Data[j][i] == 0)FirstZeroPos = i;
						} else {
							if (Data[j][i] != 0){
								Data[j][FirstZeroPos] = Data[j][i];
								Data[j][i] = 0;
								IsFall = true;
								break;
							}
						}
					}
				}
			}
		}

		cout << Points << endl;

		for (int i = 0; i < 5; ++i){
			delete[] Data[i];
		}

	}
	return 0;
}

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

int x[2000][5], H;

int solve() {
	int score = 0;
	for (int i = 0; i < 1000; i++)
	{
		for (int j = 0; j < H; j++)
		{
			if (x[j][0] == x[j][1] && x[j][1] == x[j][2] && x[j][2] == x[j][3] && x[j][3] == x[j][4] && x[j][0] >= 1) {
				score += x[j][0] * 5;
				x[j][0] = 0;
				x[j][1] = 0;
				x[j][2] = 0;
				x[j][3] = 0;
				x[j][4] = 0;
			}
		}
		for (int j = 0; j < H; j++)
		{
			for (int k = 0; k < 2; k++)
			{
				if (x[j][k + 0] == x[j][k + 1] && x[j][k + 1] == x[j][k + 2] && x[j][k + 2] == x[j][k + 3] && x[j][k + 0] >= 1) {
					score += x[j][k + 0] * 4;
					x[j][k + 0] = 0;
					x[j][k + 1] = 0;
					x[j][k + 2] = 0;
					x[j][k + 3] = 0;
				}
			}
		}
		for (int j = 0; j < H; j++)
		{
			for (int k = 0; k < 3; k++)
			{
				if (x[j][k + 0] == x[j][k + 1] && x[j][k + 1] == x[j][k + 2] && x[j][k + 0] >= 1) {
					score += x[j][k + 0] * 3;
					x[j][k + 0] = 0;
					x[j][k + 1] = 0;
					x[j][k + 2] = 0;
				}
			}
		}
		for (int j = 0; j < 500; j++) {
			for (int j = 1; j < H; j++) {
				for (int k = 0; k < 5; k++) {
					if (x[j][k] == 0) {
						x[j][k] = x[j - 1][k];
						x[j - 1][k] = 0;
					}
				}
			}
		}
	}
	return score;
}

int main() {
	while (true) {
		cin >> H;
		if (H == 0) { break; }
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> x[i][j];
			}
		}
		cout << solve() << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <algorithm>

const int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};

int H, W = 5;
int map[10][5];

int main(){
    while(scanf("%d", &H), H){
        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                scanf("%d", &map[i][j]);
            }
        }

        int res = 0;
        while(true){
            bool updated = false;
            for(int i=0;i<H;i++){
                for(int j=0,k=0;j<W;){
                    while(k < W && map[i][k] == map[i][j]){k++;}
                    if(k-j >= 3 && ~map[i][j]){
                        res += (k-j) * map[i][j];
                        for(;j<k;j++){
                            map[i][j] = -1;
                        }
                        updated = true;
                    }else{
                        j = k;
                    }
                }
            }

            // for(int i=0;i<H;i++){
            //     for(int j=0;j<W;j++){
            //         printf("%3d ", map[i][j]);
            //     }
            //     puts("");
            // }
            // puts(std::string(40, '-').c_str());
        
        
            if(!updated){break;}

            for(int i=0;i<5;i++){
                for(int j=H-1,k=H-1;j>=0;j--,k--){
                    while(k >= 0 && !~map[k][i]){k--;}
                    if(k == -1){break;}
                    std::swap(map[j][i], map[k][i]);
                }
            }      
        }

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