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[H][5]; //盤面
  for(int y=0; y<H; y++){
   for(int x=0; x<5; x++){
    cin >> S[y][x];
   }
  } 

  int sco = 0; //スコア

  while(ture){
   bool flag = 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){ //0～2が同じ
     sco += m*3;
     S[y][0] = S[y][1] = S[y][2] = 0;
     flag = true;

     if(S[y][3]==m){ //3も同じ
      sco += m;
      S[y][3] = 0;

      if(S[y][4]==m){ //3も同じかつ4も同じ
       sco += m;
       S[y][4] = 0;
      }
     }
    }

    else if(S[y][1]==m && S[y][3]==m){ //1～3が同じ
     sco += m*3;
     S[y][1] = S[y][2] = S[y][3] = 0;
     flag = true;
  
     if(S[y][4]==m){ //4も同じ
      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;
     flag = true;
    }
   }

   if(!flag) 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>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#include <cstring>
#include <cstdio>
#include <stack>
#define INF 1000000000
#define rep(i,n) for(int i =0;i<n;i++)
using namespace std;
typedef long long int ll;

int main(){
    for (;;) {
        int n;
        cin >> n;
        if(!n)break;
        int g[n][5];
        for (int i=0; i<n; i++) {
            for (int j=0; j<5; j++) {
                cin >> g[i][j];
            }
        }
        int ans = 0;
        int ansb=-1;
        while (ans != ansb) {
            ansb = ans;
            for (int i=0; i<n; i++) {
                vector<int> hoge(5,0);
                int ch=0;
                for (int j=0; j<3; j++) {
                    for (int k=0;k<j; k++) {
                        hoge[k]=g[i][k];
                    }
                    int p=j;
                    ch=0;
                    while (p+1<=5 and g[i][p]==g[i][p+1]) {
                        ch++;
                        hoge[p]=0;
                        p++;
                    }
                    if (ch<=1) {
                        hoge = {0,0,0,0,0};
                        continue;
                    }
                    if (ch>=2) {
                        if(p<4)hoge[p]=0;
                        for (int k=p+1; k<=5; k++) {
                            hoge[k]=g[i][k];
                        }
                        break;
                    }
                }
                if(ch>=2){
                    for (int j=0; j<5; j++) {
                        ans += g[i][j]-hoge[j];
                        g[i][j]=hoge[j];
                    }
                }
            }
            for (int i=0; i<5; i++) {
                for (int j=n-2; j>=0; j--) {
                    int p = j;
                    while (p+1<n and g[p+1][i]==0) {
                        p++;
                    }
                    if(p==j)continue;
                    if (p==n) {
                        g[p-1][i]=g[j][i];
                        g[j][i]=0;
                    }else{
                        g[p][i]=g[j][i];
                        g[j][i]=0;
                    }
                }
            }
        }
        cout << ans <<endl;
    }
    
    
}