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;

long long int solutions;
bool grandFlag;

void print(vector<vector<int> >& pz){
  for(int i=0; i<pz.size(); i++){
    for(int j=0; j<5; j++)
      cout << pz[i][j] << " ";
    cout << endl;
  }
};

void solve(vector<vector<int> >& pz){
  for(int i=pz.size()-1; i>=0; i--){
    int a = pz[i][0], x = 1, pos = 0;
    bool yes = false;
    for(int j=1; j<5; j++){
      if(pz[i][j] == 0)
	continue;
      if(pz[i][j] == a)
	x++;
      else if(x>=3) {
	yes = true;
	pos = j-1;
	break;
      }
      else{
	x = 1;
	a = pz[i][j];
      }
      if(j == 4 && x>=3){
	yes = true;
	pos = j;
      }
    }
    if(yes == 1){
      for(int j=pos; j>pos-x; j--)
	pz[i][j] = 0;
      solutions += (a*x);
      grandFlag = true;
    }
  }
};

void simplify(vector<vector<int> >& pz){
  int lowest; bool set;
  for(int j=0; j<5; j++){
    lowest = pz.size();
    set = false;
    for(int i=pz.size()-1; i>=0; i--){
      if(pz[i][j] == 0 && !set){
	lowest = i;
	set = true;
      }
      else if(pz[i][j] != 0 && set){
	swap(pz[i][j], pz[lowest][j]);
	lowest--;
      }
    }
  }
};

void slv(vector<vector<int> >& pz){
  while(grandFlag){
    grandFlag = false;
    solve(pz); 
    simplify(pz);
  }
};

int main(){
  int h;
  cin >> h;
  while(h!=0){
    solutions = 0;
    grandFlag = true;
    vector<vector<int> > pz(h, vector<int>(5));
    for(int i=0; i<h; i++)
      for(int j=0; j<5; j++)
	cin >> pz[i][j];

    slv(pz);
    cout << solutions << endl;
    cin >> h;
  }

  return 0;
}

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

#pragma warning(disable : 4996)

using namespace std;

int main()
{
	int H;

	while (true)
	{
		scanf("%d", &H);

		if (H == 0) { break; }

		vector<vector<int> > M(H, vector<int>(5));

		for (int i = 0; i < H; i++)
		{
			for (int j = 0; j < 5; j++)
			{
				scanf("%d", &M[i][j]);
			}
		}

		int ret = 0;

		while (true)
		{
			for (int i = 0; i < H; i++)
			{
				for (int j = 5; j >= 3; j--)
				{
					for (int k = 0; k <= 5 - j; k++)
					{
						bool ok = (M[i][k] != 0);

						for (int l = k + 1; l < k + j; l++)
						{
							if (M[i][l - 1] != M[i][l] || M[i][l] == 0)
							{
								ok = false;
							}
						}

						if (ok)
						{
							ret += M[i][k] * j;

							for (int l = k; l < k + j; l++)
							{
								M[i][l] = 0;
							}
						}
					}
				}
			}

			bool ok = false;

			for (int i = H - 1; i >= 1; i--)
			{
				for (int j = 0; j < 5; j++)
				{
					if (M[i][j] == 0)
					{
						M[i][j] = M[i - 1][j]; M[i - 1][j] = 0; ok = true;
					}
				}
			}

			if (!ok) { break; }
		}

		printf("%d\n", ret);
	}

	return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>

#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9

using namespace std;
typedef long long ll;

int main() {
	while (1) {
		int h, r, score, count, num;
		bool erased;
		vector<list<int> > mp(5);
		vector<list<int>::iterator> itrs(5);

		score = 0;
		cin >> h;
		if (h==0) break;
		vector<vector<int>> input(h);
		REP(j, h) {
			REP(k, 5) {
				cin >> r;
				input[j].push_back(r);
			}
		}

		REP(k, 5) {
			REP(j, h) { mp[k].push_front(input[j][k]); }
		}

		while (1) {
			// 各行を見て点数を計算
			REP(i, 5) itrs[i] = mp[i].begin();
			REP(j, h) {
				num = -1;
				REP(k, 5) {
					/*debug(j);
					debug(k);
					debug(*itrs[k]);*/
					if (j < mp[k].size()) {
						if (*itrs[k] == num)
							count++;
						else {
							num = *itrs[k];
							count = 1;
						}
						if (count >= 3) {
							*itrs[k] = -1;
							if (count == 3) {
								score += 3 * num;
								itrs[k - 1]--;
								itrs[k - 2]--;
								*itrs[k - 1] = -1;
								*itrs[k - 2] = -1;
								itrs[k - 1]++;
								itrs[k - 2]++;
							} else {
								score += num;
							}
							/*debug(j);
							debug(num);
							debug(count);
							debug(score);*/
						}
						if (itrs[k] != mp[k].end()) itrs[k]++;
					}
				}
			}

			erased = false;
			REP(i, 5) itrs[i] = mp[i].begin();
			REP(j, h) {
				REP(k, 5) {
					// debug(j);
					// debug(k);
					if (itrs[k] != mp[k].end()) {
						if (*itrs[k] < 0) {
							erased = true;
							// debug(*itrs[k]);
							itrs[k] = mp[k].erase(itrs[k]);
						} else {
							// debug(*itrs[k]);
							++itrs[k];
						}
					}
					//				if (*itrs[k] != NULL)debug(*itrs[k]);
				}
				// cout << "--------------------------" << endl;
			}
			// cout << score << endl;
			// cout << "--------------------------" << endl;
			if (!erased) break;
			REP(i, 5) if (mp[i].empty()) break;
		}

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