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 <cstdio>

using namespace std;

// row, column
int S[11][5];

int main() {
    for (;;) {
        int H;
        scanf("%d", &H);

        if (!H) { break; }

        for (int i = H - 1; i >= 0; i--) {
            scanf("%d%d%d%d%d", &S[i][0], &S[i][1], &S[i][2], &S[i][3], &S[i][4]);
        }

        for (int i = H; i < 11; i++) {
            S[i][0] = S[i][1] = S[i][2] = S[i][3] = S[i][4] = -2;
        }

        int p = 0;
        for (;;) {
            bool disappear = false;
            for (int i = 0; i < 10; i++) {
                for (int j = 0; j < 3; j++) {
                    if (S[i][j] < 0) { break; }

                    int k = 1;
                    for (; j + k < 5 && S[i][j + k] == S[i][j]; k++);

                    if (k >= 3) {
                        disappear = true;
                        p += S[i][j] * k;
                        for (int l = 0; l < k; l++) {
                            S[i][j + l] = -1;
                        }
                    }
                }
            }

            if (!disappear) { break; }

            for (int i = 0; i < 5; i++) {
                for (int j = 0; ; j++) {
                    if (S[j][i] == -2) { break; }
                    else if (S[j][i] == -1) {
                        int k = 1;
                        for (;; k++) {
                            if (S[j + k][i] == -2) { S[j][i] = -2; goto next_col; }
                            if (S[j + k][i] != -1) { break; }
                        }

                        for (int l = 0; ; l++) {
                            S[j + l][i] = S[j + k + l][i];
                            if (S[j + k + l][i] == -2) { break; }
                        }
                    }
                }
next_col:;
            }

#if 0
            for (int i = 10; i >= 0; i--) {
                printf("%d %d %d %d %d\n", S[i][0], S[i][1], S[i][2], S[i][3], S[i][4]);
            }
#endif
        }

        printf("%d\n", p);
    }
    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
 
int solve(int x,int p){
    return floor(p*(1+x*0.01));
}
 
int main() {
    int n;
    int a[6][10];
    memset(a,0,sizeof(a));
    while(cin >> n && n){
        for(int i=0;i<n;i++) for(int j=0;j<5;j++) cin >> a[j][i];
        int sum=0;
        int csum;
        do{
            csum=sum;
            for(int i=0;i<n;i++){
                int current=0;
                int count=0;
                int start;
                for(int j=0;j<6;j++){
                    if(current != a[j][i]){
                        if(count>=3){
                            sum+=count*current;
                            for(int k=1;k<=count;k++){
                                a[j-k][i]=0;
                            }
//                          cout << "count:" << count << endl;
//                          cout << "current:" << current << endl;
                        }
                        current = a[j][i];
                        count=1;
                    } else {
                        count++;
                    }
                }
            }
/*          for(int i=0;i<n;i++){
                for(int j=0;j<5;j++){
                    cout << a[j][i] << " ";
                }
                cout << endl;
            }*/
            for(int j=0;j<5;j++){
                for(int i=n-1;i>0;i--){
                    if(a[j][i]==0){
                        for(int k=i-1;k>=0;k--){
                            if(a[j][k]!=0){
//                              cout << j << " swap " << i << " " << k << endl;
                                swap(a[j][k],a[j][i]);
                                break;
                            }
                        }
                    }
                }
            }
        }while(csum!=sum);
        cout << sum << endl;
    }
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

#define rep(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define H_MAX 10
#define W 5
int H,score;
int pazzle[H_MAX][W];

void disp(){

	rep(i, 0, H){
		rep(j, 0, W)cout << pazzle[i][j];
		cout << endl;
	}
}

bool calc(void){
	//disp();
	int prev = score;
	rep(i, 0, H){
		bool check[W] = { false };
		int num = 0;
		int cnt = 0;
		rep(j, 1, W - 1)
		if (pazzle[i][j] == pazzle[i][j - 1] && pazzle[i][j] == pazzle[i][j + 1]){
			cnt++;
			num = pazzle[i][j];
			rep(k, j - 1, j + 2)check[k] = true;

		}
		score += (cnt + 2)*num;
		rep(j, 0, W)if (check[j])pazzle[i][j] = 0;
	}


	if (prev != score)return true;
	else return false;
}



void clear(){
	//disp();
	rep(i, -H+1, 0)
		rep(j, 0, W)if (!pazzle[-i][j]){
		rep(k, i + 1, 1)if (pazzle[-k][j]){
			int temp = pazzle[-i][j];
			pazzle[-i][j] = pazzle[-k][j];
			pazzle[-k][j] = temp;
			break;
		}
	}
	//disp();



}

int main(void){
	while (true){

		cin >> H;
		if (!H)return(0);
		score = 0;
		rep(i, 0, H)rep(j, 0, W)cin >> pazzle[i][j];
		while (calc())clear();
		cout << score << endl;
	}




}