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 H;
    int P[10][5]; //パズル
    int score; //総得点
    int check; //連続した玉があるか

void renzoku_check() 
{
    for (int i = 0; i < H; i++) {
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] != P[i][3]) && (P[i][0] != 0)) {
            score += 3*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            check = 1;
        }
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] == P[i][3]) && (P[i][0] != P[i][4]) && (P[i][0] != 0)) {
            score += 4*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            check = 1;
        }
        if ((P[i][0] == P[i][1]) && (P[i][0] == P[i][2]) && (P[i][0] == P[i][3]) && (P[i][0] == P[i][4]) && (P[i][0] != 0)) {
            score += 5*P[i][0];
            P[i][0] = 0;
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
        if ((P[i][1] == P[i][2]) && (P[i][1] == P[i][3]) && (P[i][0] != P[i][2]) && (P[i][4] != P[i][2]) && (P[i][1] != 0)) {
            score += 3*P[i][1];
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            check = 1;
        }
        if ((P[i][1] == P[i][2]) && (P[i][1] == P[i][3]) && (P[i][1]== P[i][4]) && (P[i][0] != P[i][1]) && (P[i][1] != 0)) {
            score += 4*P[i][1];
            P[i][1] = 0;
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
        if ((P[i][2] == P[i][3]) && (P[i][2] == P[i][4]) && (P[i][1] != P[i][2]) && (P[i][2] != 0)) {
            score += 3*P[i][2];
            P[i][2] = 0;
            P[i][3] = 0;
            P[i][4] = 0;
            check = 1;
        }
    }
}

void drow()
{
    for (int i = 1; i < H; i++) {
        for (int j = 0; j < 5; j++) {
            if (P[i][j] == 0) {
                for (int k = i; k > 0; k--) {
                    P[k][j] = P[k-1][j];
                }
                P[0][j] = 0;
            }
        }
    }
}

int main()
{
    while(1)
    {
        cin >> H;
        if (H == 0) {
            break;
        }
        for (int i = 0; i < H; i++) { //パズル初期化
            for (int j = 0; j < 5; j++) {
                cin >> P[i][j];
            }
        }
        score = 0;

        while(1)
        {
            check = 0;
            renzoku_check();
            if (check == 0) break;
            drow();
        }
        
        cout << score << endl;


    }
}

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(true){
	cin>>h;
	if(h==0)break;
	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;
}

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

long long int solutions;
bool grandFlag;

void print(vector<vector<int> >& pz){
  for(int i=0; i<pz.size(); i++){
    for(int j=0; j<5; j++)
      cout << pz[i][j] << " ";
    cout << endl;
  }
};

void solve(vector<vector<int> >& pz){
  for(int i=pz.size()-1; i>=0; i--){
    int a = pz[i][0], x = 1, pos = 0;
    bool yes = false;
    for(int j=1; j<5; j++){
      if(pz[i][j] == 0)
	continue;
      if(pz[i][j] == a)
	x++;
      else if(x>=3) {
	yes = true;
	pos = j-1;
	break;
      }
      else{
	x = 1;
	a = pz[i][j];
      }
      if(j == 4 && x>=3){
	yes = true;
	pos = j;
      }
    }
    if(yes == 1){
      for(int j=pos; j>pos-x; j--)
	pz[i][j] = 0;
      solutions += (a*x);
      grandFlag = true;
    }
  }
};

void simplify(vector<vector<int> >& pz){
  int lowest; bool set;
  for(int j=0; j<5; j++){
    lowest = pz.size();
    set = false;
    for(int i=pz.size()-1; i>=0; i--){
      if(pz[i][j] == 0 && !set){
	lowest = i;
	set = true;
      }
      else if(pz[i][j] != 0 && set){
	swap(pz[i][j], pz[lowest][j]);
	lowest--;
      }
    }
  }
};

void slv(vector<vector<int> >& pz){
  while(grandFlag){
    grandFlag = false;
    solve(pz); 
    simplify(pz);
  }
};

int main(){
  int h;
  cin >> h;
  while(h!=0){
    solutions = 0;
    grandFlag = true;
    vector<vector<int> > pz(h, vector<int>(5));
    for(int i=0; i<h; i++)
      for(int j=0; j<5; j++)
	cin >> pz[i][j];

    slv(pz);
    cout << solutions << endl;
    cin >> h;
  }

  return 0;
}