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

int main (){
	int h;
	while(cin>>h && h){
		vector<vector<int>> v(h,vector<int>(5));
		for(int i=0;i<h;i++)for(int j=0;j<5;j++)cin>>v[i][j];//入力
		int ans=0;
		while(1){
			int flag=true; //消す石があったらtrueのまま
			//３個以上並ぶところを消す処理
			for(int i=0;i<h;i++){
				int chain; //同じ数字が並ぶ数
				for(int j=0;j<5;j++){
					chain=1;
					while(j+1<5 && v[i][j]!=-1 && v[i][j]==v[i][j+1]){
						chain++;
						j++;
					}
					if(chain>=3){ //3つ以上並んでいたら
						flag=false;
						ans+=chain*v[i][j];
						for(int k=0;k<chain;k++){ //その部分を-1に変える
							v[i][j-chain+k+1]=-1;
						}
						break;
					}
				}
			}
			if(flag)break; //消す石が無かったなら終了

			//石の落下処理。配列を縦に回す
			for(int p=0;p<h;p++){
				for(int i=0;i<5;i++){
					for(int j=h-1;j>=1;j--){
						if(v[j][i]==-1){
							for(int k=j;k>=1;k--)swap(v[k][i],v[k-1][i]);
						}
					}
				}
			}
		}
		cout<<ans<<endl;
	}
}

C++: #include <iostream>
#include <cstring>

using namespace std;

#define H 10

int map[10][5];

int calc_and_remove() {
  int res = [&]{
    int res = 0;
    for(int i = 0; i < H; i++) {
      for(int j = 0; j < 5; j++) {
        int left = j;
        int right = left;
        int prev = map[i][left];
        while(right < 5  && map[i][right] && map[i][right] == prev) right++;
        if (right - left >= 3) {
          for(int k = left; k < right; k++) {
            res += map[i][k];
            map[i][k] = 0;
          }
        }
      }
    }
    return res;
  }();

  for(int i = H-1; i >= 0; i--) {
    for(int j = 0; j < 5; j++) {
      int cnt = 0;
      while (map[i][j] == 0 && cnt < 5) {
        for(int k = i; k >= 0; k--) {
          if (k-1 == -1) {
            map[k][j] = 0;
          }
          else {
            map[k][j] = map[k-1][j];
          }
        }
        cnt ++;
      }
    }
  }

  return res;
}

int main() {
  int h;
  while(cin >> h, h) {
    memset(map, 0, H*5*sizeof(int));
    for(int i = 0; i < h; i++)
      for(int j = 0; j < 5; j++)
        cin >> map[i+(10-h)][j];

    int res = 0;
    for(int k = 0; k < 20; k++) {
      res += calc_and_remove();
    }

    cout << res << endl;
  }

  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int fld[10][5];
int Counter(int y,int x){
    int cnt=0,t=fld[y][x];
    while(fld[y][x]==t&&x<5){
        cnt++;
        x++;
    }
    return cnt;
}
void Deleter(int y,int x){
    int t=fld[y][x];
    while(fld[y][x]==t&&x<5){
        fld[y][x]=0;
        x++;
    }
}
void Droper(){
    for(int i=0;i<10;i++){
        for(int j=0;j<5;j++){
            if(fld[i][j]==0)continue;
            int y=i-1;
            while(y>=0&&fld[y][j]==0)y--;
            y++;if(y==i)continue;
            fld[y][j]=fld[i][j];
            fld[i][j]=0;
        }
    }
}
void debug(int h){
    cout<<endl;
    for(int i=0;i<h;i++){
        for(int j=0;j<5;j++)cout<<fld[i][j]<<" ";
        cout<<endl;
    }
}
int main(){
    int h;
    while(cin>>h,h){
        fill_n(*fld,50,0);
        for(int i=h-1;i>=0;i--)
            for(int j=4;j>=0;j--)
                cin>>fld[i][j];
        int Point=0;
        while(true){
            bool update=false;
            for(int i=0;i<h;i++){
                for(int j=0;j<5;j++){
                    if(fld[i][j]==0)continue;
                    int cnt=Counter(i,j);
                    if(cnt<3)continue;
                    Point+=cnt*fld[i][j];
                    Deleter(i,j);
                    update=true;
                    //debug(h);
                }
            }
            Droper();
            if(update==false)break;
           // debug(h);
        }
        cout<<Point<<endl;
    }
}

C++: #include <stdio.h>

int a[5][10];

void arrange(void)
{
	int i,j;
	for(i = 0;i < 5;i++){
		for(j = 0;j < 9;j++){
			if(a[i][j + 1] == 0 && a[i][j] != 0){
				a[i][j + 1] = a[i][j];
				a[i][j] = 0;
				j = -1;
			}
		}
	}
	return;
}

int delblock(void)
{
	int i,j,ret = 0;
	for(j = 0;j < 10;j++){
		for(i = 0;i < 3;i++){
			if(a[i][j] != 0 && a[i][j] == a[i + 1][j] && a[i][j] == a[i + 2][j]){
				if(i + 3 < 5 && a[i][j] == a[i + 3][j]){
					if(i + 4 < 5 && a[i][j] == a[i + 4][j]){
						a[i + 4][j] = 0;
					}
					a[i + 3][j] = 0;
				}
				a[i][j] = a[i + 1][j] = a[i + 2][j] = 0;
				ret = 1;
			}
		}
	}
	return ret;
}

int main(void)
{
	int H,i,j,sum,afsum;
	while(1)
	{
		for(j = 0;j< 10;j++)
			for(i = 0;i < 5;i++)
				a[i][j] = 0;
		sum = afsum = 0;
		scanf("%d",&H);
		if(H == 0)
			break;
		for(j = 10 - H;j< 10;j++){
			for(i = 0;i < 5;i++){
				scanf("%d",&a[i][j]);
				sum += a[i][j];
			}
		}
		while(delblock()){
			arrange();
		}
		for(j = 0;j< 10;j++)
			for(i = 0;i < 5;i++)
				afsum += a[i][j];
		printf("%d\n",sum - afsum);
	}
	return 0;
}