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++: //莉頑律縺ョ謌先棡*AOJ0027*AOJ0028


#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int stoi(string x){stringstream ss;ss<<x;int tmp;ss>>tmp;return tmp;}
string itos(int x){stringstream ss;ss<<x;return ss.str();}
int main(){
	
	int h,ans=0;
	while(true){
	cin>>h;
	if(h==0)break;
	ans=0;
	int ta[200][5]={{0},{0}};
	for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>ta[i][j];
	//逶、髱「縺ョ蟄伜惠縺励↑縺?→縺薙ｍ縺ッ0
	while(true){

	bool f=1;
	for(int i=0;i<h;i++){
	int cnt=0,fi=-1;
		for(int j=0;j<3;j++){
			if(ta[i][j]==ta[i][j+1]&&ta[i][j]==ta[i][j+2]&&ta[i][j]!=0){
			cnt++;
			if(fi==-1)fi=j;
			}
		}//endfor
		if(cnt!=0)ans+=ta[i][fi]*(2+cnt),f=0;
		if(cnt!=0)for(int j=0;j<2+cnt;j++)ta[i][fi+j]=0;
	}//endfor
	if(f)break;
	//關ス縺ィ縺吝?逅?	for(int i=h-2;i>=0;i--){
		for(int j=0;j<5;j++){
			int ti=i;
			while(true){
			if(ti==h-1||ta[ti+1][j]!=0)break;
			ta[ti+1][j]=ta[ti][j];
			ta[ti][j]=0;
			ti++;
			}//endwhile
		}//endfor
	}//endfor
	//for(int i=0;i<h;i++)printf("%d%d%d%d%d\n",ta[i][0],ta[i][1],ta[i][2],ta[i][3],ta[i][4]);
	//printf("\n");
	}//endwhile
	cout<<ans<<endl;
	}//endwhile
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

#include "../dump.hpp"

#define rep(i,n) for(int i=0,i##_cond=(n);i<i##_cond;++i)
#define FOR(i,a,b) for(int i=(a),i##_cond=(b);i<i##_cond;++i)

int main(){
  while(1){
    int h; cin >> h; if(h == 0) break;
    
    vector<deque<int>> stone(5, deque<int>(h));
    rep(j, h) rep(i, 5) cin >> stone[i][j]; // j = 0が天井, h-1が底
    
    int ans = 0;
    while(1){
      int tmp = ans;
      rep(j, h){ // 上から見る
	int l = 0, r = 1; // [l, r) : 同じ数字が並ぶ区間
	rep(i,4){
	  if(stone[i][j] == stone[i+1][j]){
	    r++;
	  }else{
	    if(r - l >= 3) break;
	    l = i + 1;
	    r = i + 2;
	  }
	}
	
	if(stone[l][j] != -1 and r - l >= 3){
	  FOR(i, l, r){
	    ans += stone[i][j];
	    stone[i].erase(stone[i].begin() + j); // 消して
	    stone[i].push_front(-1); // 上に詰める
	  }
	}
      }
      if(tmp == ans) break;
    }
    cout << ans << endl;
  }
}

C++: #include<iostream>
#include<cstdio>
#include<vector>

using namespace std;

vector<vector<int>>tile(5);

int dis(int dh) {
	int re = 0;
	for (int i = 0; i < dh; i++) {
		if (tile[0][i] == tile[1][i] && tile[1][i] == tile[2][i]) {
			if (tile[0][i] == tile[3][i]) {
				if (tile[0][i] == tile[4][i]) {
					for (int j = 0; j < 5; j++) {
						re += tile[j][i];
						tile[j][i] = 0;
					}
					continue;
				}
				for (int j = 0; j < 4; j++) {
					re += tile[j][i];
					tile[j][i] = 0;
				}
				continue;
			}
			for (int j = 0; j < 3; j++) {
				re += tile[j][i];
				tile[j][i] = 0;
			}
			continue;
		}
		if (tile[2][i] == tile[1][i] && tile[1][i] == tile[3][i]) {
			if (tile[2][i] == tile[4][i]) {
				for (int j = 1; j < 5; j++) {
					re += tile[j][i];
					tile[j][i] = 0;
				}
				continue;
			}
			for (int j = 1; j < 4; j++) {
				re += tile[j][i];
				tile[j][i] = 0;
			}
			continue;
		}
		if (tile[2][i] == tile[3][i] && tile[4][i] == tile[2][i]) {
			for (int j = 2; j < 5; j++) {
				re += tile[j][i];
				tile[j][i] = 0;
			}
			continue;
		}
	}
	return re;
}

void fall(int fh) {
	for (auto &ftile : tile) {
		auto itr = ftile.begin();
		while (itr != ftile.end()) {
			if ((*itr) == 0) {
				itr = ftile.erase(itr);
			}
			else {
				itr++;
			}
		}
		ftile.resize(fh,0);
	}
}

int main() {
	int h;
	while (scanf("%d",&h), h) {
		for (auto &vtile : tile) {
			vtile.resize(h, 0);
		}
		for (int i = 0; i < h; i++) {
			scanf("%d %d %d %d %d", &tile[0][h - i - 1], &tile[1][h - i - 1], &tile[2][h - i - 1], &tile[3][h - i - 1], &tile[4][h - i - 1]);
		}
		int ans = 0;
		while (1) {
			int a;
			a = dis(h);
			if (a)ans += a;
			else break;
			fall(h);
		}
		printf("%d\n", ans);
	}
}

C++: #include <bits/stdc++.h>
#define int long long
#define double long double
#define INF 1e18
using namespace std;
signed main() {
  int H, W = 5; 
  while (cin >> H, H!=0) {
    // v[W][H]
    vector<vector<int>> v(W, vector<int>(H, 0));
    for (int i = H-1; i>=0; i--) {
      for (int j = 0; j < W; j++) {
        int t;
        cin >> t;
        v[j][i]=t;
      }
    }

    int ans = 0;
    for (int i = 0; i < W; i++) {
      for (int j = H-1; j >= 0; j--) {
        int last = -1, cnt = 0;
        for (int k = 0; k < W; k++) {
          if (v[k].size() <= j) {
            cnt = 1;
            last = -1;
          } else if (last == v[k][j]) {
            cnt++;
          } else {
            if (cnt >= 3) {
              ans += v[k-1][j]*cnt;
              for (int l = k-cnt; l < k;  l++) {
                v[l].erase(v[l].begin()+j);
              }
            }
            cnt = 1;
            last = v[k][j];
          }
        }
        if (cnt >= 3) {
          ans +=v[W-1][j]*cnt;
          for (int l = W-cnt; l < W-1; l++) {
            v[l].erase(v[l].begin()+j);
          }
        }
      }
    }
    
    cout << ans << endl;
  }
}