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<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

int main() {
	int p[10][5], sum = 0, y, x, cnt = 2;
	bool f[10][5] = {};
	for (int h; cin >> h&&h;) {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> p[i][j];
			}
		}
		while (1) {
			y = 0;
			for (int i = 0; i < h; i++) {
				x = 0;
				for (int j = 2; j < 5; j++) {
					if (p[i][j] == p[i][j - 1] && p[i][j - 1] == p[i][j - 2] && p[i][j]) {
						x = p[i][j];
						cnt++;
						f[i][j - 2] = 1;
						f[i][j - 1] = 1;
						f[i][j] = 1;
						y = 1;
					}
				}
				sum += x*cnt;
				cnt = 2;
				for (int k = 0; k < 5; k++)if (f[i][k])p[i][k] = 0;
				/*
				putchar('\n');
				for (int i = 0; i < h; i++) {
					for (int j = 0; j < 5; j++) {
						cout << p[i][j] << ' ';
					}
					putchar('\n');

				}
				putchar('\n');


				putchar('\n');
				for (int i = 0; i < h; i++) {
					for (int j = 0; j < 5; j++) {
						cout << f[i][j] << ' ';
					}
					putchar('\n');

				}
				putchar('\n');
				*/

			}
			if (!y)break;
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					if (f[i][j]) {
						f[i][j] = 0;
						for (int k = i; k > 0; k--) {
							swap(p[k][j], p[k - 1][j]);
						}
					}
				}
			}
			/*
			putchar('\n');
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					cout << p[i][j] << ' ';
				}
				putchar('\n');

			}
			putchar('\n');




			putchar('\n');
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < 5; j++) {
					cout << f[i][j] << ' ';
				}
				putchar('\n');

			}
			putchar('\n');
			*/

		}
		cout << sum << endl;;
		sum = 0;

	}
	return 0;
}

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

using namespace std;

int main(void) {
	int H;
	cin >> H;
	while (H != 0) {
		vector< vector<int> > puzz(H,vector<int>(5));
		int drop[5] = {0,0,0,0,0};
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < 5; ++j) {
				cin >> puzz[i][j];
			}
		}

		bool seq = true;
		int point = 0;
		int s,e;
		int len = 1;
		while (seq) {
			seq = false;
			for (int i = 0; i < H; ++i) {
				len = 1;
				s = -1;
				e = -1;
				for (int j = 0; j < 4; ++j) {
					if (puzz[i][j] > 0 && puzz[i][j] == puzz[i][j+1]) {
						++len;
						if (len > 2) {
							s = (j + 1) - len + 1;
							e = j + 1;
						}
					}
					else {
						len = 1;
					}
				}
				if (e > 0) {
					point += (e+1-s)*puzz[i][s];
					for (int j = s; j < e + 1; ++j) {
						puzz[i][j] = -1;
					}
					seq = true;
				}
			}
			for (int i = H - 1; i > 0 ; --i) {
				for (int j = 0; j < 5; ++j) {
					if (puzz[i][j] == -1) {
						int temp = i - 1;
						while (temp >= 1 && puzz[temp][j] == -1) {
							--temp;
						}
						swap(puzz[i][j],puzz[temp][j]);
					}
				}
			}
		}
		cout << point << endl;
		cin >> H;
	}
	return 0;
}

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

int main() {

    while(1){

        int h;

        cin >> h;

        if(h == 0) break;

        int puzzle[h][5];

        for(int i=h-1; i>=0; i--){
            for(int j=0; j<5; j++){
                cin >> puzzle[i][j];
            }
        }

        int score = 0;

        while(1){

            bool deleted = false;

            for(int i=0; i<h; i++){

                for(int j=0; j<3; j++){
                    int matchnum = 1;
                    int index = -1;
                    for(int k=j; k<4; k++){
                        if(puzzle[i][k] == puzzle[i][k+1] && puzzle[i][k] != 0){
                            matchnum++;
                        }
                        else{
                            index = k;
                            break;
                        }
                    }
                    if(matchnum >= 3){

                        deleted = true;
                        if(index==-1){
                            index = 4;
                        }

                        score += matchnum * puzzle[i][index];

                        for(int k=0; k<matchnum; k++){
                            puzzle[i][index-k] = 0;
                        }

                        break;

                    }
                }

            }


            for(int g=0; g<h-1;g++) { //複数行同時に消えた時のため
                for (int j = 0; j < h - 1; j++) {
                    for (int k = 0; k < 5; k++) {
                        if (puzzle[j][k] == 0 && puzzle[j + 1][k]) {
                            swap(puzzle[j][k], puzzle[j + 1][k]);
                        }
                    }
                }
            }


            if(!deleted) break;

        }

        cout << score << endl;

    }

    return 0;
}