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<bits/stdc++.h>
using namespace std;

int dele(vector<vector<int>> &st){
    int res=0;
    for(int i=0;i<st.size();i++){
        int pre=-1;
        int cnt=0;
        for(int j=0;j<=5;j++){
            if(j<5 && pre==st[i][j])
                cnt++;
            else{
                if(cnt>=3){
                    for(int r=j-cnt;r<j;r++)
                        res+=st[i][r],st[i][r]=0;
                    cnt=1;
                }
                else if(j<5){
                    pre=st[i][j];
                    cnt=1;
                }

            }


        }

    }
    return res;

}

void drop(vector<vector<int>> &st){
    for(int j=0;j<5;j++){
        int cnt=0;
        for(int i=st.size()-1;i>=0;i--){
            if(st[i][j]==0)
                cnt++;
            else{
                if(cnt>0){
                for(int r=i;r>=0;r--){
                    st[r+cnt][j]=st[r][j];
                    st[r][j]=0;
                }
                i=i+cnt;
                cnt=0;
                }
            }

        }



    }


}

int main()
{
    int h;
    while(cin>>h,h){
        vector<vector<int>> st(h,vector<int>(5));
        for(int i=0;i<h;i++)
            for(int j=0;j<5;j++){
                cin>>st[i][j];
            }
        int res=0;
        while(true){
            int sc=dele(st);
            if(sc==0)
                break;
            res+=sc;
            drop(st);

        }
        cout<<res<<endl;
    }
}

C++: #include<iostream>
using namespace std;
int H,t[50][6];
int main(){
  while(1){
    cin>>H;
    if(H==0)break;
    for(int i=H-1;i>=0;i--){
      for(int j=0;j<5;j++)cin>>t[i][j];
    }
    int ans=0;
    while(1){
      int tmp=ans;
      for(int i=0;i<H;i++){
	int key=t[i][0],cnt=1;
	t[i][5]=-1;
	for(int j=1;j<6;j++){
	  if(key==t[i][j])cnt++;
	  else{
	    if(cnt>=3&&key!=0)
	      for(int k=0;k<cnt;k++){
		ans+=key;
		t[i][j-k-1]=0;
	      }
	    cnt=1;
	    key=t[i][j];
	  }
	}
      }
      if(tmp==ans)break;
      for(int j=0;j<5;j++){
	int I=0;
	for(int i=0;i<H;i++){
	  if(t[i][j]==0)continue;
	  t[I][j]=t[i][j];
	  I++;
	}
	while(I<H)t[I++][j]=0;
      }
    }
    cout<<ans<<endl;
  }
}

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

int M[11][5];

int main() {
	ios::sync_with_stdio(false);
	while(true) {
		int H; cin >> H;
		if(H == 0) break;
		for(int i = H - 1; i >= 0; --i) {
			for(int j = 0; j < 5; ++j) {
				cin >> M[i][j];
			}
		}
		int ans = 0;
		while(true) {
			/*
			for(int i = H - 1; i >= 0; --i) {
				for(int j = 0; j < 5; ++j) printf("%d", M[i][j]);
				printf("\n");
			}
			*/
			bool update = false;
			for(int i = 0; i < H; ++i) {
				for(int j = 0; j < 5; ++j) {
					if(M[i][j] == 0) continue;
					int s = 0;
					for(int k = j; k < 5; ++k) {
						if(M[i][k] == M[i][j]) ++s;
						else break;
					}
					if(s >= 3) {
						ans += s * M[i][j];
						for(int x = 0; x < s; ++x) {
							M[i][j + x] = 0;
						}
						update = true;
					}
				}
			}
			for(int j = 0; j < 5; ++j) {
				while(true) {
					bool update2 = false;
					for(int i = 0; i < H; ++i) {
						if(M[i][j] == 0 && M[i + 1][j] != 0) {
							M[i][j] = M[i + 1][j];
							M[i + 1][j] = 0;
							update2 = true;
						}
					}
					if(!update2) break;
				}
			}
			if(!update) break;
		}
		cout << ans << endl;
	}
}

C++: #include <stdio.h>
#include <algorithm>

using namespace std;

int main(void){
	int h, ans, hoge,count;
	int table[10][5];
	bool b[5];

	while(1){
		scanf("%d", &h);
		if(h==0) break;

		ans=0;

		for(int i=0; i<h; i++){
			for(int j=0; j<5; j++){
				scanf("%d", &table[i][j]);
			}
		}

		hoge =0;
		while(1){
			for(int i=0; i<h; i++){
				fill(b, b+5, false);
				count=0;
				if(table[i][2]==0) continue;
				if(table[i][2] == table[i][1]){
					b[1]=true;
					count++;
					if(table[i][2] ==table[i][0]){
						b[0]=true;
						count++;
					}
				}
				if(table[i][2] == table[i][3]){
					b[3]=true;
					count++;
					if(table[i][2] ==table[i][4]){
						b[4]=true;
						count++;
					}
				}

				if(count>=2){
					b[2] = true;
					count++;
					ans += (table[i][2]*count);

					for(int j=0; j<5; j++){
						if(b[j]==true){
							table[i][j]=0;
						}
					}
				}
			}//endfor

			if(hoge == ans) break;
			hoge = ans;

			for(int i=0; i<h; i++){
				for(int j=0; j<5; j++){
					if(table[i][j] == 0){
						for(int k =i; k>0; k--){
							int tmp;
							tmp =table[k-1][j];
							table[k-1][j] = table[k][j];
							table[k][j] = tmp;
						}
					}
				}
			}

		}//endwhile

		printf("%d\n", ans);
	}//endwhile

	return 0;
}