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<cmath>
#include<string>
#include<algorithm>
#include<vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
  int n;
  while(cin>>n,n){
    vector<string>s(5);
    rep(i,n){
      string a,b,c,d,e;
      cin>>a>>b>>c>>d>>e;
      s[0]=a+s[0];
      s[1]=b+s[1];
      s[2]=c+s[2];
      s[3]=d+s[3];
      s[4]=e+s[4];
    }
    rep(i,5)while(s[i].size()<11)s[i].push_back('%');
    //
    int ans=0;
    while(1){
      bool han=true;
      rep(i,11){
	int j;
	for(j=1;j<4;j++){
	  if(s[j-1][i]==s[j][i]&&s[j][i]==s[j+1][i]&&s[j][i]!='%')break;
	}
	if(j!=4){
	  han=false;
	  char tmp=s[2][i];
	  rep(j,5){
	    if(tmp==s[j][i]){
	      ans+=s[j][i]-'0';s[j][i]='!';
	    }
	  }
	  if(s[0][i]==s[2][i]&&s[0][i]!=s[1][i]){ans-=tmp-'0';s[0][i]=tmp;}
	  else if(s[2][i]==s[4][i]&&s[3][i]!=s[4][i]){ans-=tmp-'0';s[4][i]=tmp;}
	}
      }
      rep(i,5){
	for(int j=10;j>=0;j--){
	  if(s[i][j]=='!'){s[i].erase(s[i].begin()+j);s[i].push_back('%');}
	}
      }
      if(han)break;
      //rep(i,5)cout<<s[i]<<endl;
    }
    cout<<ans<<endl;
  }
}

C++: #include <bits/stdc++.h>
#define ll long long
#define pds pair<double, string>
using namespace std;

int paz[11][6];
int h;

bool check() {
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < 3; j++) {
            if (paz[i][j] == -1) continue;
            if (paz[i][j] == paz[i][j + 1] && paz[i][j] == paz[i][j + 2])
                return true;
        }
    }
    return false;
}

void fall() {
    for (int i = 0; i < 5; i++) {
        for (int j = h - 1; j >= 1; j--) {
            if (paz[j][i] == -1) {
                int k = j - 1;
                while (k >= 0 && paz[k][i] == -1) k--;
                if (k != -1) {
                    paz[j][i] = paz[k][i];
                    paz[k][i] = -1;
                }
            }
        }
    }
}

int main() {
    while (cin >> h, h) {
        for (int i = 0; i < h; i++) {
            for (int j = 0; j < 5; j++) {
                cin >> paz[i][j];
            }
        }
        int score = 0;
        while (check()) {
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < 3; j++) {
                    if (paz[i][j] == -1) continue;
                    if (j == 0) {
                        int cur = paz[i][j], k;
                        for (k = 1; k < 5; k++) {
                            if (cur != paz[i][k]) break;
                        }
                        if (k > 2) {
                            score += cur * (k - j);
                            for (int l = 0; l < k; l++) paz[i][l] = -1;
                        }
                    } else if (j == 1) {
                        int cur = paz[i][j], k;
                        for (k = 2; k < 5; k++) {
                            if (cur != paz[i][k]) break;
                        }
                        if (k > 3) {
                            score += cur * (k - j);
                            for (int l = 1; l < k; l++) paz[i][l] = -1;
                        }
                    } else if (j == 2) {
                        int cur = paz[i][j], k;
                        for (k = 3; k < 5; k++) {
                            if (cur != paz[i][k]) break;
                        }
                        if (k > 4) {
                            score += cur * (k - j);
                            for (int l = 2; l < k; l++) paz[i][l] = -1;
                        }
                    }
                }
            }
            fall();
        }
        cout << score << endl;
    }
    return 0;
}

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

int solve(int x,int p){
	return floor(p*(1+x*0.01));
}

int main() {
	int n;
	int a[6][10];
	memset(a,0,sizeof(a));
	while(cin >> n && n){
		for(int i=0;i<n;i++) for(int j=0;j<5;j++) cin >> a[j][i];
		int sum=0;
		int csum;
		do{
			csum=sum;
			for(int i=0;i<n;i++){
				int current=0;
				int count=0;
				int start;
				for(int j=0;j<6;j++){
					if(current != a[j][i]){
						if(count>=3){
							sum+=count*current;
							for(int k=1;k<=count;k++){
								a[j-k][i]=0;
							}
//							cout << "count:" << count << endl;
//							cout << "current:" << current << endl;
						}
						current = a[j][i];
						count=1;
					} else {
						count++;
					}
				}
			}
/*			for(int i=0;i<n;i++){
				for(int j=0;j<5;j++){
					cout << a[j][i] << " ";
				}
				cout << endl;
			}*/
			for(int j=0;j<5;j++){
				for(int i=n-1;i>0;i--){
					if(a[j][i]==0){
						for(int k=i-1;k>=0;k--){
							if(a[j][k]!=0){
//								cout << j << " swap " << i << " " << k << endl;
								swap(a[j][k],a[j][i]);
								break;
							}
						}
					}
				}
			}
		}while(csum!=sum);
		cout << sum << endl;
	}
	return 0;
}