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>
using namespace std;

int main()
{
  while(true){
    int H;
    cin>>H;

    if(H==0)
    break;

    int S[10][5];
    for(int y=0; y<H;y++)
    for(int x=0;xA<5;x++)
    cin>>S[y][x];

    int sco=0;

    while(true){
      boolflg=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){
          sco+=m*3;s[y][0]=s[y][1]=S[y][2];flg=true;
          if(S[y][3]==m){
            sco+=m;S[y][3]=0;
            if(S[y][4]==m){
              sco+=m;S[y][4]=0;
            }
          }
        }
        else if(S[y][1]==m&&S[y][3]==m){
          sco+=m*3;s[y][1]=S[y][2]=s[y][3];flg=true;
            if(S[y][4]==m){
              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];flg=true;
        }
      }
    }

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

  }
  return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

int main() {
	for (int H; cin >> H&&H;) {
		int A[10][6] = {};
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < 5; j++) {
				cin >> A[i][j];
			}
		}

		int ans = 0;

		for (bool flag = true; flag;) {//??????????????£???????????????
			flag = false;
			for (int i = 0; i < H; i++) {
				int F = 0, E = 1;
				for (int j = 1; j < 5 + 1; j++) {
					if (A[i][j] != A[i][j - 1]) {
						if (E - F >= 3) {
							flag = true;
							ans += A[i][j - 1] * (E - F);
							for (int f = F; f < E; f++) {
								A[i][f] = 0;
							}
							break;
						}
						F = j;
						E = j + 1;
					}
					else if (A[i][j - 1] != 0) {
						E++;
					}
				}
			}

			//cout << "before" << endl;
			//for (int i = 0; i < H; i++) {
			//	for (int j = 0; j < 5; j++) {
			//		cout << A[i][j] << " ";
			//	}
			//	cout << endl;
			//}

			for (bool flag2 = true; flag2;) {
				flag2 = false;
				for (int i = H - 1; i > 0; i--) { //i!=0
					for (int j = 0; j < 5; j++) {
						//?¶???????????????????
						if (A[i][j] == 0) {
							if (A[i - 1][j] |= 0)flag2 = true;
							swap(A[i][j], A[i - 1][j]);
						}
					}
				}
			}

			//cout << "after" << endl;
			//for (int i = 0; i < H; i++) {
			//	for (int j = 0; j < 5; j++) {
			//		cout << A[i][j] << " ";
			//	}
			//	cout << endl;
			//}
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
// void pfield(vector<vector<int> >, int);

int main() {
  int cols;
  while(cin >> cols, cols) {
    vector<vector<int> > field(5, vector<int>()); // [col][line]
    for(int il = 0; il < cols; ++il) {
      for(int ic = 0; ic < 5; ++ic) {
        int num;
        cin >> num;
        field[ic].push_back(num);
      }
    }
    for(int ic = 0; ic < 5; ++ic) {
      reverse(field[ic].begin(), field[ic].end());
    }
    int score = 0;
    int lastScore = 0;
    do {
      lastScore = score;
      // Top down scan
      for(int il = cols - 1; il >= 0; --il) {
        int rowCnt = 0;
        int lastNum = -1;
        for(int ic = 0; ic < 5; ++ic) {
          if(field[ic].size() <= il) {
            rowCnt = 0;
            continue;
          }
          (field[ic][il] == lastNum) ? ++rowCnt : (rowCnt = 0);
          int eraseNum = lastNum;
          lastNum = field[ic][il];
          if(rowCnt == 2) {
            for(int dic = -2; dic <= 0; ++dic) {
              field[ic + dic].erase(field[ic + dic].begin() + il);
              score += eraseNum;
            }
          } else if(rowCnt > 2) {
            field[ic].erase(field[ic].begin() + il);
            score += eraseNum;
          }
        }
      }
    } while(score != lastScore);
    cout << score << endl;
  }
  return 0;
}