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(true){
    int H;
    cin>>H;

    if(H==0)
    break;

    int S[10][5];
    for(int y=0; y<H;y++)
    for(int x=0;xA<5;x++)
    cin>>S[y][x];

    int sco=0;

    while(true){
      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];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];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];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[y][x];S[y2][x]=0;break;
          }
        }
      }
    }
  }
    cout<<sco<<endl;

  }
  return 0;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>

using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;
using v2=vector<vector<int>>;
const int INF=1e+7;
v2 fall(v2 masu){

v2 ans(5,vector<int>(10));
for(int i=0;i<5;i++){
    int fin=0;
    for(int j=0;j<10;j++){
        if(masu[i][j]!=INF) {
            ans[i][fin] = masu[i][j];
            fin++;
        }
    }
    for(int j=fin;j<10;j++){
        ans[i][j]=i+10;
    }
}
return ans;
}
int main() {
    int n;

    while(true){
        cin>>n;
        if(n==0)break;
        int ans=0;

        v2 masu(5,vector<int>(10));
        for(int i=n-1;i>=0;i--){
            rep(j,5){
                int aaa;cin>>aaa;
                masu[j][i]=aaa;
            }
        }
        for(int i=n;i<10;i++){
            rep(j,5){
                masu[j][i]=j+10;
            }
        }
        while(true) {
            bool up=false;
            int st[10];
            for (int i = 0; i < 10; i++) {
                int h = 0, t = 0;
                while (t < 4) {
                    t++;
                    if (masu[t][i] != masu[h][i] && t - h <= 2) { h = t; }
                }
                if (h <= 2)st[i] = h;
                else st[i] = 5;
            }
            for (int i = 0; i < 10; i++) {
                if (st[i] != 5) {
                    up=true;
                    int suc=masu[st[i]][i];
                    int count=0;
                    for(int j=st[i];j<5;j++){
                        if(masu[j][i]==suc){count++;masu[j][i]=INF;}
                        else break;
                    }
                    ans+=count*suc;
                }
            }


            if(up==false){break;}
            else{
                masu=fall(masu);
            }
        }
        cout<<ans<<endl;

    }




    return 0;
}

C++: #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int H;
int fld[5][10];
void drop(){
      bool pp;
      REP(i,5){
            REP(j,H){
                  if(fld[i][j]==-1){
                        for(int k=j;k<H;k++){
                              if(fld[i][k]!=-1){
                                    swap(fld[i][k],fld[i][j]);
                                    break;
                              }
                        }
                  }
            }
      }
}
int main(){
      while(cin>>H&&H){
            for(int i=H-1;i>=0;i--)REP(j,5)cin>>fld[j][i];
            bool update=true;
            int ans=0;
            while(update){
                  update=false;
                  REP(i,H){
                        int s,e,j=0;bool change=false;
                        while(j<5){
                              if(fld[j][i]==-1){
                                    j++;
                                    continue;
                              }
                              s=j;
                              while(fld[s][i]==fld[j][i])j++;
                              if(j-s>=3){
                                    e=j;
                                    change=true;
                                    break;
                              }
                        }
                        if(change){
                              update=true;
                              ans+=(e-s)*fld[s][i];
                              for(int j=s;j<e;j++)fld[j][i]=-1;
                        }
                  }
                  drop();
            }
            cout<<ans<<endl;
      }
}