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<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int h,w=5;
int v[15][5];

int disappearance(){

  int ret=0;
  int i,j;
  /*
消えるとき
1 2 3 4 5
1 2 3 4
1 2 3
2 3 4
2 3 4 5
3 4 5
   */

  rep(i,h){
    if(v[i][0]==v[i][1] && v[i][1]==v[i][2] && v[i][2]==v[i][3] && v[i][3]==v[i][4]
       && v[i][0]!=-1){
      ret+=v[i][0]*5;
      rep(j,5)v[i][j]=-1;
    }
    if(v[i][0]==v[i][1] && v[i][1]==v[i][2] && v[i][2]==v[i][3] && v[i][3]!=v[i][4]
       && v[i][0]!=-1){
      ret+=v[i][0]*4;
      rep(j,4)v[i][j]=-1;
    }
    if(v[i][0]==v[i][1] && v[i][1]==v[i][2] && v[i][0]!=v[i][3]
       && v[i][0]!=-1){
      ret+=v[i][0]*3;
      rep(j,3)v[i][j]=-1;
    }
    if(v[i][0]!=v[i][1] && v[i][1]==v[i][2] && v[i][2]==v[i][3] && v[i][3]==v[i][4]
       && v[i][1]!=-1){
      ret+=v[i][1]*4;
      loop(j,1,5)v[i][j]=-1;
    }
    if(v[i][0]!=v[i][1] && v[i][1]==v[i][2] && v[i][2]==v[i][3] && v[i][3]!=v[i][4]
       && v[i][1]!=-1){
      ret+=v[i][1]*3;
      loop(j,1,4)v[i][j]=-1;
    }
    if(v[i][1]!=v[i][4] && v[i][2]==v[i][4] && v[i][3]==v[i][4]
       && v[i][4]!=-1){
      ret+=v[i][2]*3;
      loop(j,2,5)v[i][j]=-1;
    }
  }

  return ret;
}

void drop(){
  int i,j;
  loop(i,1,h)rep(j,w)if(v[i][j]>0){
    int k=i-1;
    while(k>=0){
      if(v[k][j]!=-1)break;
      k--;
    }
    if(k+1!=i){
      v[k+1][j]=v[i][j];
      v[i][j]=-1;
    }
  }
}


int main(void) {
  int i,j;
  while(1){
    cin>>h;
    if(h==0)break;
    rep(i,15)rep(j,5)v[i][j]=-1;
    rep(i,h)rep(j,w)cin>>v[h-1-i][j];

    int ans=0;

    while(1){

      int t=disappearance();

      if(t==0)break;

      ans+=t;
      
      drop();

    }
    cout<<ans<<endl;
  }
}

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;
}

C++: #include<iostream>

using namespace std;

int main(int argc, char *argv[])
{
  for(;;) {
    int h;
    cin >> h;
    if(h == 0) break;
    int fld[h][5];
    for(int i = 0; i < h; i++) {
      for(int j = 0; j < 5; j++) {
        cin >> fld[i][j];
      }
    }
    int sc = 0;
    for(;;) {
      bool vanished = false;
      for(int i = 0; i < h; i++) {
        for(int j = 0; j < 3; j++) {
          int c = fld[i][j];
          if(c > 0) {
            int k = j + 1;
            for(; k < 5; k++) {
              if(fld[i][k] != c) break;
            }
            if(k - j >= 3) {
              vanished = true;
              for(int l = j; l < k; l++) {
                sc += fld[i][l];
              }
              for(int t = i; t > 0; t--) {
                for(int l = j; l < k; l++) {
                  fld[t][l] = fld[t-1][l];
                }
              }
              for(int l = j; l < k; l++) {
                fld[0][l] = 0;
              }
            }
          }
        }
      }
      if(!vanished) break;
    }
    cout << sc << endl;
  }
  return 0;
}