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 <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
#define rep(i,n) for(int i=0; i<(n); ++i)

int stones[11][5];
int main(void){
    int H;
    while(cin >> H && H) {
        rep(i, H) rep(j, 5) cin >> stones[H-i-1][j];
        bool isFinished = false;
        int score = 0;
        while(!isFinished) {
            isFinished = true;
            rep(i, H) {
                rep(j, 3) {
                    if(stones[i][j]!=-1 &&
                       stones[i][j]==stones[i][j+1] &&
                       stones[i][j]==stones[i][j+2]) {
                        isFinished = false;
                        int d = stones[i][j];
                        for(; stones[i][j]==d; ++j) {
                            stones[i][j] = -1;
                            score += d;
                        }
                    }
                }
            }
            rep(column, 5) {
                for(int row=1; row<H; ++row) {
                    if(stones[row-1][column]==-1 && stones[row][column]!=-1) {
                        for(int i=row; i>0&&stones[i-1][column]==-1; --i) {
                            swap(stones[i-1][column], stones[i][column]);
                        }
                    }
                }
            }
        }
        cout << score << endl;
    }
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

vector<int> retErase(vector<int> &r) {
  if (r[0] == r[1] && r[1] == r[2] && r[2] == r[3] && r[3] == r[4] && r[2] != 0) return {1, 1, 1, 1, 1};
  if (r[1] == r[2] && r[2] == r[3] && r[3] == r[4] && r[2] != 0) return {0, 1, 1, 1, 1};
  if (r[0] == r[1] && r[1] == r[2] && r[2] == r[3] && r[2] != 0) return {1, 1, 1, 1, 0};
  if (r[0] == r[1] && r[1] == r[2] && r[2] != 0) return {1, 1, 1, 0, 0};
  if (r[1] == r[2] && r[2] == r[3] && r[2] != 0) return {0, 1, 1, 1, 0};
  if (r[2] == r[3] && r[3] == r[4] && r[2] != 0) return {0, 0, 1, 1, 1};
  return {0, 0, 0, 0, 0};
}

int solve(vector<vector<int>> &M) {
  int H = M.size();
  bool cont = true;
  int score = 0;
  while(cont) {
    cont = false;
    vector<vector<int>> E(H, vector<int>(5));
    for (int i = 0; i < H; i++) {
      vector<int> e = retErase(M[i]);
      for (int j = 0; j < 5; j++) {
        if (e[j] == 1) {
          cont = true;
          E[i][j] = 1;
          score += M[i][j];
        }
      }
    }
    for (int j = 0; j < 5; j++) {
      vector<pii> newM(H);
      for (int i = 0; i < H; i++) {
        newM[i].first = M[i][j];
        newM[i].second = E[i][j];
      }
      newM.erase(remove_if(newM.begin(), newM.end(), [](pii a){return a.second == 1;}), newM.end());
      int z = H - newM.size();
      for (int i = 0; i < H; i++) {
        if (i < z) {
          M[i][j] = 0;
        } else {
          M[i][j] = newM[i - z].first;
        }
      }
    }
  }
  return score;
}

int main() {
  int H;
  while(cin >> H, H) {
    vector<vector<int>> M(H, vector<int>(5));
    for (int i = 0; i < H; i++) {
      for (int j = 0; j < 5; j++) {
        cin >> M[i][j];
      }
    }
    cout << solve(M) << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;


 int main(){
	 
	 int h;
	 while(1){
		 int p=0;
		 int flag=1;
		 int x;
		cin >> h;
		if(h == 0) break;
		vector<vector<int>> A(5);
		for(int j = h-1; j >= 0; j--){
			for(int i = 0; i< 5; i++){
				cin >> x;
				A[i].push_back(x);
			}
		}
		for(int i = 0; i< 5; i++){
			reverse(A[i].begin(), A[i].end());
			}


		while(1){
			int flag=0;
		for(int i = 0; i < h; i++){
			int count=0;
			int mem=-1;
			//一行の処理開始
			for(int j=0; j< 5;j++){
				if(mem==A[j][i]) count++;
				else {
					mem =A[j][i];
					count = 0;
				}
				if(count > 1) {
					A[j-2][i] +=10;
					A[j-1][i] +=10;
					A[j][i] +=10;
					if(mem!=0) flag =1;
				}
			}
			for(int k = 0; k < 5 ; k++){
				if(A[k][i] >=10){
					p += A[k][i]%10;
					A[k][i]=0;
				}
			}//一行の処理終了
		}
		for(int i= 0; i < 5 ; i++){
			vector<int> B(A[i]);
			int counter=0;
			for(int j = 0 ; j < h ; j++){
				if(B[j] !=0){
					A[i][counter] = B[j];
					counter+=1;
				}
			}
			for(;counter<h; counter++){
				A[i][counter] = 0;
			}
		} 
		if(flag == 0) break;
		}
		cout <<p <<endl;
	 }
		 



	return 0;
 }