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 <cstring>

using namespace std;

int H,puz[10][5];

int solve(){
  int res = 0;
  bool update = true;
  while(update){
    update = false;
    for(int i = 0 ; i < H ; i++){
      bool c[5] = {false},ok = false;
      int num = puz[i][0],cnt = 1;
      c[0] = true;
      for(int j = 1 ; j < 5 ; j++){
        if(num == puz[i][j] && puz[i][j] > 0){
          cnt++;
          c[j] = true;
          if(cnt >= 3) ok = true;
        }else if(puz[i][j] > 0){
          if(ok) break;
          num = puz[i][j];
          cnt = 1;
          memset(c,false,sizeof(c));
          c[j] = true;
        }
      }
      if(cnt >= 3){
        res += cnt*num;
        update = true;
        for(int j = 0 ; j < 5 ; j++){
          if(c[j]) puz[i][j] = -1;
        }
      }
    }
    if(update){
      int tmp[10][5];
      memset(tmp,0,sizeof(tmp));
      for(int j = 0 ; j < 5 ; j++){
        int idx = H-1;
        for(int i = H-1 ; i >= 0 ; i--){
          if(puz[i][j] == -1) continue;
          tmp[idx--][j] = puz[i][j];
        }
      }
      for(int i = 0 ; i < H ; i++){
        for(int j = 0 ; j < 5 ; j++){
          puz[i][j] = tmp[i][j];
        }
      }
    }
  }
  return res;
}

int main(){
  while(cin >> H,H){
    for(int i = 0 ; i < H ; i++){
      for(int j = 0 ; j < 5 ; j++){
        cin >> puz[i][j];
      }
    }
    cout << solve() << endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <algorithm>

int main(void)
{
  for( ; ; ){
    int h;
    int m[16][16];

    scanf("%d", &h);
    if(!h) break;

    for(int i = 0;i < h; i++)
      for(int j = 0;j < 5; j++)
        scanf("%d", m[h - i - 1] + j);

    int ans = 0;
    for( ; ; ){
      /* 水平に並んだブロックを探す */
      for(int i = 0;i < h; i++){
        int pre = m[i][0], cnt = 1;
        for(int j = 1;j < 5; j++){
          if(pre == m[i][j])
            cnt++;
          else{
            if(cnt >= 3){
              ans += pre * cnt;
              for(int k = 1;k <= cnt; k++) m[i][j - k] = 0;
            }
            pre = m[i][j]; cnt = 1;
          }
        }
        if(cnt >= 3){
          ans += pre * cnt;
          for(int k = 1;k <= cnt; k++) m[i][5 - k] = 0;
        }
      }

      /* ブロックを落とす */
      bool flag = true; // 連鎖が終わってる?
      for(int i = 1;i < h; i++){
        for(int j = 0;j < 5; j++){
          if(m[i][j] == 0 || m[i - 1][j] != 0) continue;
          int k = i - 1;
          for( ;k - 1 >= 0 && m[k - 1][j] == 0; k--) ;
          std::swap(m[k][j], m[i][j]);
          flag = false;
        }
      }

      if(flag) break;
    }
    printf("%d\n", ans);
  }
}

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(cin>>h,h!=0){
	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;
}