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 <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>
#include <complex>
 
#define INF 100000000
#define EPS 1e-9
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
  
#define MAX_H 10
int H;
int maze[MAX_H][5];

vector<int> ans_list;

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 >> maze[i][j];
      }
    }

    int ans = 0;

    while(true){

      bool flag = false;
      for(int i = 0; i < H; i++){
	for(int j = 0; j < 3; j++){
	  int num = maze[i][j];
	  if(num == -1)
	    continue;
	  int n;
	  for(n = 0; n + j < 5; n++){
	    if(maze[i][j+n] != num)
	      break;
	  }
	  if(n < 3)
	    continue;
	  ans += num*n;
	  flag = true;
	  for(int k = 0; k < n; k++){
	    maze[i][j+k] = -1;
	  }
	}
      }

      if(!flag)
	break;

      /*
      cout << "消去前" << endl;
      for(int i = 0; i < H; i++){
	for(int j = 0; j < 5; j++){
	  cout << maze[i][j] << " ";
	}
	cout << endl;
      }
      */

      for(int x = 0; x < 5; x++){
	for(int y = H-1; y >= 0; y--){
	  if(maze[y][x] != -1)
	    continue;
	  int n, num = -1;
	  for(n = 1; y-n >= 0; n++){
	    if(maze[y-n][x] != -1){
	      num = maze[y-n][x];
	      maze[y-n][x] = -1;
	      maze[y][x] = num;
	      break;
	    }
	  }
	}
      }

      /*
      cout << "消去後" << endl;
      for(int i = 0; i < H; i++){
	for(int j = 0; j < 5; j++){
	  cout << maze[i][j] << " ";
	}
	cout << endl;
      }
      */

    }

    ans_list.push_back(ans);

  }

  for(int i = 0; i < ans_list.size(); i++){
    cout << ans_list[i] << endl;
  }
  
}

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

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
    if (v.empty()) {
        ostr << "{ }";
        return ostr;
    }
    ostr << "{" << v.front();
    for (auto itr = ++v.begin(); itr != v.end(); itr++) {
        ostr << ", " << *itr;
    }
    ostr << "}";
    return ostr;
}

int main(){
while(1){//start

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

	vector<vector<int> > v (5, vector<int>(h));
	for(int i = 0; i < h; i++){
		for(int j = 0; j < 5; j++){
			int tmp;
			cin >> tmp;
			v[j][i] = tmp;
		}
	}

	for(int i = 0; i < 5; i++){
		reverse(v[i].begin(), v[i].end());
	}

	//cout << v << endl;


	int ans = 0;
for(int k = 0; k <= 11; k++){

	for(int i = 0; i < h; i++){
		if(v[0][i] == v[1][i] and v[0][i] == v[2][i] and v[0][i] == v[3][i] and v[0][i] == v[4][i]){
			ans += v[0][i] * 5;
			v[0][i] = 0;
			v[1][i] = 0;
			v[2][i] = 0;
			v[3][i] = 0;
			v[4][i] = 0;
		}
		else if(v[0][i] == v[1][i] and v[0][i] == v[2][i] and v[0][i] == v[3][i]){
			ans += v[0][i] * 4;
			v[0][i] = 0;
			v[1][i] = 0;
			v[2][i] = 0;
			v[3][i] = 0;
		}
		else if(v[1][i] == v[2][i] and v[1][i] == v[3][i] and v[1][i] == v[4][i]){
			ans += v[1][i] * 4;
			v[1][i] = 0;
			v[2][i] = 0;
			v[3][i] = 0;
			v[4][i] = 0;
		}
		else if(v[1][i] == v[2][i] and v[2][i] == v[3][i]){
			ans += v[1][i] * 3;
			v[1][i] = 0;
			v[2][i] = 0;
			v[3][i] = 0;
		}
		else if(v[0][i] == v[1][i] and v[1][i] == v[2][i]){
			ans += v[0][i] * 3;
			v[0][i] = 0;
			v[1][i] = 0;
			v[2][i] = 0;
		}
		else if(v[2][i] == v[3][i] and v[3][i] == v[4][i]){
			ans += v[2][i] * 3;
			v[2][i] = 0;
			v[3][i] = 0;
			v[4][i] = 0;
		}
	}

	for(int i = 0; i < 5; i++){
		v[i].erase(remove(v[i].begin(), v[i].end(), 0), v[i].end());
		v[i].resize(h);
	}
}
	cout << ans << endl;
	//init
	v.clear();

}//end

	return 0;
}