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

using namespace std;

int main() {
    while (true) {
        int h;
        cin >> h;
        if (h == 0)break;

        vector<vector<int>> ban(h, vector<int>(5));
        for (int i = 0; i < h; i++)
            for (int j = 0; j < 5; j++)cin >> ban[i][j];

        int ret = 0;
        while (true) {
            bool found = false;

            for (int i = 0; i < h; i++) {
                bool flag = true;
                for (int j = 0; flag && j < 5; j++) {
                    int x = ban[i][j];
                    for (int k = 5; k >= j + 3; k--) {
                        bool same = true;
                        for (int l = j; l < k; l++)
                            if (ban[i][l] != x || ban[i][l] < 0)same = false;

                        if (same) {
                            found = true;
                            flag = false;
                            ret += x * (k - j);
                            for (int l = j; l < k; l++)ban[i][l] = -1;
                            break;
                        }
                    }
                }
            }

            for (int i = 0; i < 5; i++) {
                vector<int> v;
                for (int j = h - 1; j >= 0; j--) if (ban[j][i] > 0)v.push_back(ban[j][i]);

                for (int j = 0; j < h; j++) {
                    if (j < v.size())ban[h - 1 - j][i] = v[j];
                    else ban[h - 1 - j][i] = -1;
                }
            }
            if (!found)break;
        }

        cout << ret << endl;
    }
    return 0;
}

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

using namespace std;

int main()
{
    int h;
    while(1){

        
        cin >> h;
        if(h == 0){
            break;
        }

        
        vector<vector<int>> stone;
        stone.resize(5);
        for(int i = 0; i < 5; i++){
            stone[i].resize(h);
        }
        for(int i = h-1; i >= 0; i--){
            for(int j = 0; j < 5; j++){
                cin >> stone[j][i];
            }
        }
        
        int old_score = 0;
        int score = 0;
        while(1){
            old_score = score;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 3; j++){
                    if(stone[j][i] == stone[j+1][i] && stone[j][i] == stone[j+2][i] && stone[j][i] != 0){
                        int old_stone_num = stone[j][i];
                        for(int k = 0; j + k < 5 && stone[j+k][i] == old_stone_num; k++){
                            score += stone[j+k][i];
                            stone[j+k][i] = 0;
                        }
                        break;
                    }
                }
            }
            
            if(old_score == score){
                break;
            }
        
            
            for(int i = 0; i < 5; i++){
                stone[i].erase(remove(stone[i].begin(), stone[i].end(), 0), stone[i].end());
                for(int j = stone[i].size(); j < h; j++){
                    stone[i][j] = 0;
                }
            }


        }
        cout << score << endl;
    }
    return 0;
}

C++: #include<stdio.h>
int main(void){
	int H,stone[10][5]={0};
	int a,i,j,k,score=0;

	while(1){
		scanf("%d",&H);
		if(H==0){break;}
		score=0;
		for(i=0;i<H;i++){
			scanf("%d %d %d %d %d",&stone[i][0],&stone[i][1],&stone[i][2],&stone[i][3],&stone[i][4]);	
		}
		for(a=0;a<50;a++){
			for(i=0;i<H;i++){
				if(stone[i][0]==stone[i][1]&&stone[i][1]==stone[i][2]&&stone[i][2]==stone[i][3]&&stone[i][3]==stone[i][4]){
					score+=stone[i][2]*5;
					for(j=0;j<5;j++){stone[i][j]=0;}
				}
			}
				
			for(i=0;i<H;i++){
				for(j=0;j<2;j++){
					if(stone[i][j]==stone[i][1+j]&&stone[i][1+j]==stone[i][2+j]&&stone[i][2+j]==stone[i][3+j]){
						score+=stone[i][2]*4;
						for(k=j;k<j+4;k++){stone[i][k]=0;}
					}
				}
			}

			for(i=0;i<H;i++){
				for(j=0;j<3;j++){
					if(stone[i][0+j]==stone[i][1+j]&&stone[i][1+j]==stone[i][2+j]){
						score+=stone[i][2]*3;
						for(k=j;k<j+3;k++){stone[i][k]=0;}
					}
							
				}
			}
			
			for(k=0;k<5;k++){
				for(i=1;i<H;i++){
					for(j=0;j<5;j++){
						if(stone[i][j]==0&&stone[i-1][j]!=0){
							stone[i][j]=stone[i-1][j];
							stone[i-1][j]=0;
						}
					}
				}
			}				
		}
		printf("%d\n",score);
	}
	return 0;
}