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 <algorithm>
#include <queue>
#include <cstring>

using namespace std;

int h;
int map[10][5];
bool checked[10][5];

int check(int x,int y,int num,int count){
  if(x > 4 || y > 9)
    return count;
  
  if(num != map[y][x])
    return count;

  if(count > 5)
    return count;

  if(num == 0)
    return count;
  
  checked[y][x] = true;
  return check(x+1,y,map[y][x],count+1);
}

int main(){

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

    memset(map,0,sizeof(map));
    memset(checked,false,sizeof(checked));

    
    for(int i = 10-h;i<10;i++){
      for(int j = 0;j<5;j++){
	cin>>map[i][j];
      }
    }

    int point = 0;
    bool update = true;
    /*
    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
    }
    */
    while(update){
      update = false;
      memset(checked,false,sizeof(checked));
      for(int i = 10-h;i < 10;i++){
	for(int j = 0;j<5;j++){
	  if(checked[i][j])
	    continue;
	  int tmp =  check(j,i,map[i][j],1) - 1;
	  point += (tmp >= 3)?tmp * map[i][j]: 0;
	  if(tmp >= 3){
	    update = true;
	    for(int k = j;k<j+tmp;k++){
	      for(int l = i;l > 0;l--){
		map[l][k] = map[l-1][k];
	      }
	      
	    }
	    
	  }
	  
	}
      }
      /*
      cout<<"--------------------------"<<endl;

    for(int i = 0;i<10;i++){
      for(int j = 0;j<5;j++){
	cout<<map[i][j]<<"\t";
      }
      cout<<endl;
      }
*/
      
    }
    cout<<point<<endl;
  }
    
	
  return 0;
}

C++: #include <iostream>
#include <utility>
using namespace std;
typedef pair<int, int> P;

int main()
{
    while(true){
        int h;
        cin >> h;
        if(h == 0) break;
        int p[22][5];
        int ans = 0;
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++){
                cin >> p[h - 1 - i][j];
                ans += p[h - 1 - i][j];
            }
        }
        for(int i = h; i < 20; i++){
            for(int j = 0; j < 5; j++) p[i][j] = 0;
        }
        while(true){
            bool del[12][5];
            bool end = true;
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 5; j++) del[i][j] = false;
            }
            for(int i = 0; i < h; i++){
                for(int j = 0; j < 3; j++){
                    if(p[i][j] != 0 && p[i][j] == p[i][j + 1] && p[i][j] == p[i][j + 2]){
                        end = false;
                        for(int k = j; k < j + 3; k++) del[i][k] = true;
                        int a = p[i][2];
                        if(a == p[i][3]){
                            del[i][3] = true;
                            if(a == p[i][4]) del[i][4] = true;
                        }
                    }
                }
            }
            if(end) break;
            for(int j = 0; j < 5; j++){
                int l = 0;
                for(int i = 0; i < h; i++){
                    while(del[l][j]) l++;
                    p[i][j] = p[l][j];
                    l++;
                }
                for(int i = h; i < 20; i++){
                    p[i][j] = 0;
                }
            }
        }
        for(int i = 0; i < h; i++){
            for(int j = 0; j < 5; j++) ans -= p[i][j];
        }
        cout << ans << endl;
    }
}

C++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1193&lang=jp

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

int H;
vector<vector<int>> field;

int erase(int cnt, int h, int st, int ed)
{
	int res=0;
	if(cnt>=3){
		for( int i=st; i<=ed; ++i ){
			res += field[h][i];
			field[h][i] = 0;
		}
	}

	return res;
}

int chain()
{
	int res=0;
	int prev=0,cnt=0,st=0;
	rep(h,H){
		rep(w,5){
			if( w>0 && prev==field[h][w] && field[h][w] ){ 
				cnt++;
				if(w==4){ res += erase(cnt,h,st,w); }
			}else{
				res += erase(cnt,h,st,w-1);
				st=w; 
				cnt=1;
				prev=field[h][w];
			}
		}
	}
	return res;
}

void fall()
{
	int cnt=0;
	while(true)
	{
		for( int h=H-1; h>0; --h ){
			for( int w=5-1; w>=0; --w){
				if(field[h][w]==0 && field[h-1][w]){
					swap(field[h][w],field[h-1][w]);
					cnt++;
				}
			}
		}
		if(cnt==0) break;
		cnt=0;
	}
	return;
}

int main()
{
	while( cin>>H && H )
	{
		field.assign( H, vector<int>(5,0) );
		rep(h,H){
			rep(w,5){
				cin >> field[h][w];
			}
		}
		
		int score=0,ans=0;
		while(true)
		{
			score = chain();
			if(score==0){ break; }
			ans += score;
			fall();
		}
		cout << ans << endl;
	}
	return 0;
}