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 <string>
#include <vector>
#include <algorithm>

using namespace std;

int main(void){
//	FILE* fp_in = freopen("data.txt", "r", stdin);

	while(1) {
		int h, field[5][10];	//フィールドの高さ、フィールド
		int imos[5][10];
		int max[2][10];
		int fall[5][10];
		int score = 0;			//スコア
		bool flg = true;		//消去可能フラグ

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

		//データ取得
		for(int i = 0; i < h; i++)
			for(int j = 0; j < 5; j++)
				cin >> field[j][i];


		while( flg ) {
			flg = false;

			for(int i = 0; i < 5; i++) {
				for(int j = 0; j < 10; j++) {
					imos[i][j] = -1;
				}
			}
			for(int i = 0; i < 2; i++) {
				for(int j = 0; j < 10; j++)
					max[i][j] = 0;
			}

			for(int i = 0; i < h; i++ ) {
				int cnt = 1;
				for(int j = 1; j < 5; j++) {
					if( field[j - 1][i] == field[j][i] ) {
						if(field[j - 1][i] > 0 && field[j][i] > 0 ) cnt ++;
					} else {
						cnt = 1;
					}
					imos[j][i] = cnt;
				}
			}


			for(int i = 0; i < h; i++) {
				for(int j = 4; j >= 0; j--) {
					if( imos[j][i] >= 3 ) {
						max[0][i] = j;
						max[1][i] = imos[j][i];
						score += field[j][i] * max[1][i];
						break;
					}
				}
			}
			
			//消去
			for(int i = 0; i < h; i++) {
				for(int j = max[0][i]; j > max[0][i] - max[1][i]; j --) {
					field[j][i] = -1;
					flg = true;
				}
			}

			//落下
			for(int i = 0; i < 5; i++) {
				int cnt = h - 1;
				for(int j = h - 1; j >= 0; j-- ) {
					if( field[i][j] > 0 ) {
						fall[i][cnt] = field[i][j]; 
						cnt --;
					}
				}
				for(int j = cnt; j >= 0; j--) {
					fall[i][j] = -1;
				}
			}

			for(int i = 0; i < 5; i++)
				for(int j = 0; j < h; j++)
					field[i][j] = fall[i][j];

		}
		
		cout << score << endl;
		

	}
	

	

//	while(1){}
    return 0;
}

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

using namespace std;

#define SIZE 100010

bool solve(){
  int h;
  int stone[5][12];
  scanf("%d", &h);

  if(!h) return 0;
  
  for(int i=0;i<h;i++){
    for(int j=0;j<5;j++){
      scanf("%d", &stone[j][h-i-1]);
    }
  }
  for(int i=0;i<5;i++)
    stone[i][h] = -1;

  bool flag = true;
  int ans = 0;
  
  while(flag){
    flag = false;

    for(int i=0;i<h;i++){
      int t = stone[2][i];
      if(t == -1) break;
      
      if((stone[1][i] == t && stone[3][i] == t) ||
         (stone[3][i] == t && stone[4][i] == t) ||
         (stone[0][i] == t && stone[1][i] == t)){

        if(stone[0][i] == t && stone[1][i] == t){
          ans += stone[0][i];
          stone[0][i] = -1;
        }

        if(stone[3][i] == t && stone[4][i] == t){
          ans += stone[4][i];
          stone[4][i] = -1;
        }

        if(stone[1][i] == t){
          ans += stone[1][i];
          stone[1][i] = -1;
        }

        if(stone[3][i] == t){
          ans += stone[3][i];
          stone[3][i] = -1;
        }

        ans += t; stone[2][i] = -1;

        flag = true;
      }
    }


    for(int i=0;i<5;i++){
      for(int j=h-1;j>=0;j--){
        if(stone[i][j] == -1){
          for(int k=j;k<h-1;k++) swap(stone[i][k], stone[i][k+1]);
        }
      }
    }
  }

  printf("%d\n", ans);

  return 1;
}

int main(){
  while(solve());

}