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++: //最長共通部分列 http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_C
//要は何枚のコインで支払えますか問題。

// lcmとかはg++ -std=c++17 default.cppみたいなかんじで
//vector<vector<ll>> piyo(tate,vector<ll> (yoko));

#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1000000019
#define ll long long
#define ln cout<<endl;
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int dp[2000][2000];
vector<int> w(2000);
vector<int> v(2000);

int main() {
    cin.tie(0);
   	ios::sync_with_stdio(false);
    //double mini=INF;
    int maxi=0;
    int i;
    double h;
    int n,x,m=5;
    int a,b,d,c;
    //int e,weight;
    int target;
    //targetが目的値、nが個数
    //ll _=1;

    while(1){
        cin>>n;
        if(n==0) return 0;
        vector<vector<ll>> v(n,vector<ll> (m));
        vector<vector<ll>> f(n,vector<ll> (m));
        ll sum=0;
        //vector<vector<ll>> v(n,vector<ll> (m));
        rep(i,n)rep(j,m) {cin>>v[i][j];f[i][j]=0;}
        ll endf=0;
        while(!endf){
            endf=1;
            rep(i,n) rep(j,m) f[i][j]=0;
            for(ll i=0;i<n;i++) {
                for(ll j=0;j<m-2;j++){
                    if(v[i][j]==0) continue;
                    if(v[i][j]!=v[i][j+1]) continue;
                    if(v[i][j]!=v[i][j+2]) continue;
                    f[i][j]=1;
                    f[i][j+1]=1;
                    f[i][j+2]=1;
                }
            }
            for(ll i=0;i<n;i++) {
                for(ll j=0;j<m;j++){
                    if(f[i][j]==1) {
                        sum+=v[i][j];
                        v[i][j]=0;
                        endf=0;
                    }
                }
            }



            for(ll j=0;j<m;j++){
                ll takasa=n-1;
                for(ll i=n-1;i>=0;i--){
                    if(f[i][j]==0){
                        v[takasa][j]=v[i][j];
                        takasa--;
                    }
                }
                for(i=takasa;i>=0;i--){
                   v[i][j]=0;
                }
            }
            /*
            rep(i,n){
                rep(j,m){
                    cout<<v[i][j]<<" ";
                }
                    cout<<endl;
            }
            cout<<endl;
*/
        }
        cout<<sum<<endl;

    }

    return 0;
}

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

int main(){
	while(1){
		int H;
		cin>>H;

		if(H==0)
			break;

		int S[10][5];
		for(int y=0;y<H;y++)
			for(int x=0;x<5;x++)
				cin>>S[y][xa];
	
		int sco=0;
	
		while(1){
			bool flg=false;
	
			for(int y=0;y<H;y++){
				int m=S[y][2];
				if(m==0)
					continue;
	
				if(S[y][0]==m&&S[y][1]==m){
					sco+=m*3;S[y][0]=S[y][1]=S[y][2]=0;flg=true;
					if(S[y][3]==m){
						sco+=m;S[y][3]=0;
						if(S[y][4]==m){
							sco+=m;S[y][4]=0;
						}
					}
				}
				else if(S[y][1]==m&&S[y][3]==m){
					sco+=m*3;S[y][1]=S[y][2]=S[y][3]=0;flg=true;
					if(S[y][4]==m){
						sco+=m;S[y][4]=0;
					}
				}
				else if(S[y][3]==m&&S[y][4]==m){
					sco+=m*3;S[y][2]=S[y][3]=S[y][4]=0;flg=true;
				}
			}
	
			if(!flg)
				break;
		
			for(int x=0;x<5;x++){
				for(int y=H-1;y>=0;y--){
					if(S[y][x]!=0)
						continue;

					for(int y2=y-1;y2>=0;y2--){
						if(S[y2][x]!=0){
							S[y][x]=S[y2][x];S[y2][x]=0;break;
						}
					}
				}
			}
		}

		cout<<sco<<endl;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <algorithm>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
#define pb push_back

using namespace std;

const int INF = 1000000000;

int main() {
  while(1){
    int h;
    cin>>h;
    if(!h)break;
    vector<vector<int>> t(h,vector<int>(5));
    REP(i,h)REP(j,5)cin>>t[i][j];
    int pt=0;
    while(1){
      bool ch=false;
      REP(i,h){
        int len=1;
        REP(j,4){
          if(t[i][j]==t[i][j+1]){
            len++;
          }else{
            if(len >= 3 && t[i][j]!=0){
              pt+=len*(t[i][j]);
              REP(k,len){
                t[i][j-k]=0;
              }
              ch=true;
            }
            len=1;
          }
        }
        if(len >= 3 && t[i][4]!=0){
          pt+=len*(t[i][4]);
          REP(k,len){
            t[i][4-k]=0;
          }
          ch=true;
        }
      }
      if(!ch)break;
      REP(i,5){
        for(int j=h-1;j>=0;--j){
          for(int k=j+1;k<h;++k){
            if(t[k][i]==0){
              swap(t[k][i],t[k-1][i]);
            }
          }
        }
      }
    }
    cout<<pt<<endl;
  }
  return 0;
}