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>
using namespace std;

int main(){
  while(1){
    int N;
    cin >> N ;
    if(N==0){
      break;
    }
    int str[11][6]={0};
    for(int i=N-1;i>=0;i--){
      for(int j=0;j<5;j++){
        cin >> str[i][j];
      }
    }
    int score=0;
    for(int i=0;i<10;i++){
//    for(int q=0;q<N;q++){
//     for(int w=0;w<5;w++){
//       cout << str[q][w];
//     }
//     cout << endl;
//    }
//    cout << endl;
      for(int j=0;j<N;j++){
        int a=str[j][0];
        int ch=0;
        for(int k=0;k<=5;k++){
          if(a==str[j][k]&&a!=0){
            ch++;
          }else{
            if(ch>=3){
              for(int l=k-1;l>=k-ch;l--){
                score+=str[j][l];
                str[j][l]=0;
              }
              break;
            }else{
              a=str[j][k];
              ch=1;
            }
          }
        }
      }
      for(int j=0;j<N;j++){
        for(int k=0;k<N;k++){
          for(int l=0;l<5;l++){
            if(str[k][l]==0){
              str[k][l]=str[k+1][l];
              str[k+1][l]=0;
            }
          }
        }
      }
    }
//    for(int q=0;q<N;q++){
//     for(int w=0;w<5;w++){
//       cout << str[q][w];
//     }
//     cout << endl;
//    }
    cout << score << endl;
  }
}

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

int main (){
	int h;
	while(cin>>h && h){
		vector<vector<int>> v(h,vector<int>(5));
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>v[i][j];//入力
		int ans=0;
		while(1){
			int flag=true; //消す石があったらtrueのまま
			//３個以上並ぶところを消す処理
			for(int i=0;i<h;i++){
				int chain; //同じ数字が並ぶ数
				for(int j=0;j<5;j++){
					chain=1;
					while(j+1<5 && v[i][j]!=-1 && v[i][j]==v[i][j+1]){
						chain++;
						j++;
					}
					if(chain>=3){ //3つ以上並んでいたら
						flag=false;
						ans+=chain*v[i][j];
						for(int k=0;k<chain;k++){ //その部分を-1に変える
							v[i][j-chain+k+1]=-1;
						}
						break;
					}
				}
			}
			if(flag)break; //消す石が無かったなら終了

			//石の落下処理。配列を縦に回す
			for(int p=0;p<h;p++){
				for(int i=0;i<5;i++){
					for(int j=h-1;j>=1;j--){
						if(v[j][i]==-1){
							for(int k=j;k>=1;k--)swap(v[k][i],v[k-1][i]);
						}
					}
				}
			}
		}
		cout<<ans<<endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int g[11][5];
bool used[11][5];
int main(){
    int h;
    while(cin>>h,h){
        int s=0;
        rep(i,h)rep(j,5) cin>>g[i][j];
        while(1){
            bool update=false;
            rep(i,h){
                int cnt=1;
                FOR(j,1,5){
                    if(g[i][j]!=0&&g[i][j]==g[i][j-1]) ++cnt;
                    else{
                        if(cnt>=3){
                            s+=g[i][j-1]*cnt,update=true;
                            rep(k,cnt) g[i][j-1-k]=0;
                        }
                        cnt=1;
                    }
                }
                if(cnt>=3){
                    s+=g[i][4]*cnt,update=true;
                    rep(k,cnt) g[i][4-k]=0;
                }
            }
            if(!update) break;
            rep(j,5){
                int cnt=0;
                rep(i,h){
                    if(g[h-i-1][j]!=0){
                        swap(g[h-cnt-1][j],g[h-i-1][j]);
                        ++cnt;
                    }
                }
            }
        }
        cout<<s<<endl;
    }
    return 0;
}

C++: #include <cstdio>
using namespace std;

int main(){
	const int MAX_H = 10;
	int H, board[MAX_H][5];
	int l, res, sub;
	bool deleted;
	
	while(true){
		scanf("%d", &H);
		if(H == 0) break;
		for(int i = 0; i < H; i++){
			for(int j = 0; j < 5; j++){
				scanf("%d", &board[i][j]);
			}
		}
		
		deleted = true;
		res = 0;
		while(deleted){
			deleted = false;
			for(int i = 0; i < H; i++){
				for(int j = 0; j < 5;){
					l = j;
					while(j < 5 && board[i][l] == board[i][j]) j++;
					if(j - l >= 3 && board[i][l] != 0){
						res += board[i][l] * (j - l);
						for(int k = l; k < j; k++) board[i][k] = 0;
						deleted = true;
					}
				}
			}
			
			for(int j = 0; j < 5; j++){
				for(int i = 0; i < H; i++){
					if(board[i][j] == 0){
						for(int k = i; k - 1 >= 0; k--){
							sub = board[k][j];
							board[k][j] = board[k - 1][j];
							board[k - 1][j] = sub;
						}
					}
				}
			}
		}
		printf("%d\n", res);
	}
	
	return 0;
}