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(1){
    int H;
    cin>>H;

    if(H==0)
      break;

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

    int sco = 0;

    while(1){
      bool flg = 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] =0;
          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] =0;
          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] =0;
          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[y2][x];
              S[y2][x] = 0;
              break;
            }
          }
        }
      }
    }
    cout<<sco<<endl;
  }
  return 0;
}

C++: #include <stdio.h>

void partical_move(int data[][5], int i, int n) {
  int j, k;
  for (j = n-1; j >= 0; j--) {
	if (data[j][i] == 0) {
	  for (k = j; k >= 0; k--) {
		if (data[k][i] != 0) {
		  data[j][i] = data[k][i];
		  data[k][i] = 0;
		  break;
		}
	  }
	}
  }
}

int main(void) {
  int n;
  int data[100][5] = {{0}};
  int flag = 0;
  int i, j, k;
  int score[1000] = {0};
  int L = 0;

  while (1) {
	scanf("%d", &n);
	if (n == 0) break;
	for (i = 0; i < n; i++) {
	  for (j = 0; j < 5; j++) {
		scanf("%d", &data[i][j]);
	  }

	}
	while (1) {
	  //debug
	  // 	puts("");
	  // for (i = 0; i < n; i++) {
	  // 	for (j = 0; j < 5; j++) {
	  // 	  printf("%d ", data[i][j]);
	  // 	}
	  // 	puts("");
	  // }
	  //
	  flag = 0;
	  for (i = 0; i < n; i++) {
		if (data[i][0] == data[i][1] && data[i][1] == data[i][2] && 
			data[i][2] == data[i][3] && data[i][3] == data[i][4] && data[i][2] != 0) {
		  score[L] += data[i][0]*5;

		  data[i][0] = data[i][1] = data[i][2] = data[i][3] = data[i][4] = 0; //delete

		  flag = 1;
		}

		else if (( (data[i][0] == data[i][1] && data[i][1] == data[i][2] && data[i][2] == data[i][3]) && data[i][2] != 0) ||
				 ((data[i][1] == data[i][2] && data[i][2] == data[i][3] && data[i][3] == data[i][4]) && (data[i][2] != 0))) {
		  score[L] += data[i][2]*4;

		  if (data[i][0] == data[i][1]) { //delete
			data[i][0] = data[i][1] = data[i][2] = data[i][3] = 0; //delete
		  } //delete
		  else { //delete
			data[i][1] = data[i][2] = data[i][3] = data[i][4] = 0; //delete
		  } //delete

		  flag = 1;
		}

		else {
		  for (j = 0; j < 3; j++) {
			if (data[i][j] == data[i][j+1] && data[i][j+1] == data[i][j+2] && data[i][j] != 0) {
			  score[L] += data[i][j]*3;

			  for (k = j; k < j+3; k++) { //delete
				data[i][k] = 0; //delete
			  } //delete

			  flag = 1;
			  break;
			}
		  }
		}
	  }

	  ///////////////////debug///////////////////////////
	  // puts("");
	  // for (i = 0; i < n; i++) {
	  // 	for (j = 0; j < 5; j++) {
	  // 	  printf("%d ", data[i][j]);
	  // 	}
	  // 	puts("");
	  // }
	  ///////////////////////////////////////////////////

	  if (flag == 0) {
		//   puts("");
		// for (i = 0; i < n; i++) {
		//   for (j = 0; j < 5; j++) {
		// 	printf("%d ", data[i][j]);
		//   }
		//   puts("");
		// }
		//		printf("%d\n",score[L]);
		L++;
		break;
	  }
	  //move

	  for (i = 0; i < 5; i++) { //列五行分探索
		partical_move(data,i, n); 
	  }
	}//while



	// printf("%d\n",data[l]);
  }//while

  for (i = 0; i < L; i++) {
	printf("%d\n",score[i]);
  }
}//mdatain

C++: #include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 

using namespace std; 

#define MP make_pair

long gcd(long a, long b){ 

  if(a%b==0) return b; 
  else return gcd(b,a%b); 

} 

long lcm(long a, long b){ 
  return a*b/gcd(a,b); 
} 

int main(){

	int h;
	while(cin>>h, h){

		vector< vector<int> > map(h , vector<int>(5));

		for(int i=0;i<h;i++){
			for(int j=0;j<5;j++){
				cin>>map[i][j];
			}
		}


		int res=0;
		while(true){

			bool flag=true;

			for(int i=0;i<h;i++){
				int num=map[i][0],len=1,pos=0;
				for(int j=1;j<5;j++){
					if(map[i][j]==num) len++;
					else if(len>=3) break;
					else{ num=map[i][j]; pos=j; len=1;}
				}

				if(len>=3 && num!=0){
					flag=false;
					res+=num*len;
					for(int j=0;j<len;j++) map[i][pos+j]=0;
				}

			}

			for(int i=h-2;i>=0;i--){
				for(int j=0;j<5;j++){
					int pos=i;
					while(pos+1<h && map[pos+1][j]==0) pos++;
					swap(map[i][j],map[pos][j]);
				}
			}


			if(flag) break;
		}

		cout<<res<<endl;

	}

	return 0;
}