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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
	int h;
	while(scanf("%d", &h), h){
		vector<vector<int> > v(5, vector<int>(h));
		for(int i = h - 1; i >= 0; --i)
		for(int j = 0; j < 5; ++j){
			scanf("%d", &v[j][i]);
		}
		int s = 0;
		bool upd = true;
		while(upd){
			upd = false;
			for(int i = 0; i < h; ++i){
				bool rm[5] = {};
				for(int j = 0; j < 3; ++j){
					if(v[j][i] && v[j][i] == v[j + 1][i] &&
					   v[j][i] == v[j + 2][i]){
						rm[j] = rm[j + 1] = rm[j + 2] = true;
						upd = true;
					}
				}
				for(int j = 0; j < 5; ++j){
					if(rm[j]){
						s += v[j][i];
						v[j][i] = 0;
					}
				}
			}
			for(int j = 0; j < 5; ++j){
				fill(remove(v[j].begin(), v[j].end(), 0), v[j].end(), 0);
			}
		}
		printf("%d\n", s);
	}
}

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

int main(){
 while(true){
  int H;
  cin >> H;
  
  if(H==0) break;

  int S[H][5]; //盤面
  for(int y=0; y<H; y++){
   for(int x=0; x<5; x++){
    cin >> S[y][x];
   }
  } 

  int sco = 0; //スコア

  while(true){
   bool flag = 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){ //0～2が同じ
     sco += m*3;
     S[y][0] = S[y][1] = S[y][2] = 0;
     flag = true;

     if(S[y][3]==m){ //3も同じ
      sco += m;
      S[y][3] = 0;

      if(S[y][4]==m){ //3も同じかつ4も同じ
       sco += m;
       S[y][4] = 0;
      }
     }
    }

    else if(S[y][1]==m && S[y][3]==m){ //1～3が同じ
     sco += m*3;
     S[y][1] = S[y][2] = S[y][3] = 0;
     flag = true;
  
     if(S[y][4]==m){ //4も同じ
      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] = 0;
     flag = true;
    }
   }

   if(!flag) 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[y2][x];
       S[y2][x] = 0;
       break;
      }
     }
    
    }
   }
  }
  cout << sco << endl;
 }
 return 0;
}

C++: #include<iostream>

using namespace std;

#define HMAX 10

int main(){

	int H;
	int puzz[HMAX][5];
	bool lf,ff;
	int cnt,bef;
	int score;

	while(1){
		cin>>H;
		if(H==0) break;
		for(int i=0;i<H;i++){
			for(int j=0;j<5;j++){
				cin>>puzz[i][j];
			}
		}
		score=0;
		while(1){
			lf=false;
			for(int i=0;i<H;i++){
				bef=puzz[i][0];
				cnt=1;
				for(int j=1;j<6;j++){
					if(j!=5&&bef==puzz[i][j]) cnt++;
					else if(cnt<3||bef==-1){
						cnt=1;
						bef=puzz[i][j];
					}
					else{
						for(int k=j-cnt;k<j;k++){
							puzz[i][k]=-1;
						}
						score+=bef*cnt;
						lf=true;
						break;
					}
				}

			}
			if(!lf) break;
			while(1){
				ff=false;
				for(int i=0;i<H-1;i++){
					for(int j=0;j<5;j++){
						if(puzz[i+1][j]==-1&&puzz[i][j]!=-1){
							puzz[i+1][j]=puzz[i][j];
							puzz[i][j]=-1;
							ff=true;
						}
					}
				}
				if(!ff) break;
			}
		}
		cout<<score<<endl;
	}
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);

    int H;
    while (cin >> H, H) {
        vector<vector<int>> field(H, vector<int>(6, -1));

        for (int y = 0; y < H; ++y) {
            for (int x = 0; x < 5; ++x) {
                cin >> field[y][x];
            }
        }

        int score = 0;
        for (;;) {
            vector<vector<bool>> deleted(H, vector<bool>(6));
            bool done = true;

            for (int y = 0; y < H; ++y) {
                int run = 1;
                for (int x = 1; x < 6; ++x) {
                    if (field[y][x] == field[y][x-1]) {
                        ++run;
                    } else {
                        if (field[y][x-1] != 0 && run >= 3) {
                            score += field[y][x-1] * run;
                            done = false;
                            for (int k = 1; k <= run; ++k)
                                deleted[y][x-k] = true;
                        }
                        run = 1;
                    }
                }
            }

            for (int x = 0; x < 5; ++x) {
                int p = H-1;
                for (int y = H-1; y >= 0; --y) {
                    if (!deleted[y][x]) {
                        field[p][x] = field[y][x];
                        --p;
                    }
                }
                for ( ; p >= 0; --p)
                    field[p][x] = 0;
            }

            if (done)
                break;
        }

        cout << score << endl;
    }
}