Problem:
Chain Disappearance Puzzle

We are playing a puzzle.
An upright board with H rows by 5 columns of cells, as shown in
the figure below, is used in this puzzle.
A stone engraved with a digit, one of 1 through 9, is placed in each of
the cells.
When three or more stones in horizontally adjacent cells are engraved
with the same digit, the stones will disappear.
If there are stones in the cells above the cell with a disappeared
stone, the stones in the above cells will drop down, filling the
vacancy.

The puzzle proceeds taking the following steps.

When three or more stones in horizontally adjacent cells are
engraved with the same digit, the stones will disappear. Disappearances
of all such groups of stones take place simultaneously.

When stones are in the cells above the emptied cells, these stones drop down so that the emptied cells are filled.

After the completion of all stone drops, if one or more groups of
stones satisfy the disappearance condition, repeat by returning to the
step 1.

The score of this puzzle is the sum of the digits on the disappeared stones.

Write a program that calculates the score of given configurations of stones.

Input

The input consists of multiple datasets.
Each dataset is formed as follows.

Board height H

Stone placement of the row 1

Stone placement of the row 2

...

Stone placement of the row H

The first line specifies the height ( H ) of the puzzle board (1 ≤ H ≤ 10).
The remaining H lines give placement of stones on each of the rows from top to bottom.
The placements are given by five digits (1 through 9), separated by a space.
These digits are engraved on the five stones in the corresponding row, in the same order.

The input ends with a line with a single zero.

Output

For each dataset, output the score in a line.
Output lines may not include any characters except the digits expressing the scores.

Sample Input

1
6 9 9 9 9
5
5 9 5 5 9
5 5 6 9 9
4 6 3 6 9
3 3 2 9 9
2 2 1 1 1
10
3 5 6 5 6
2 2 2 8 3
6 2 5 9 2
7 7 7 6 1
4 6 6 4 9
8 9 1 1 8
5 6 1 8 1
6 8 2 1 2
9 6 3 3 5
5 3 8 8 8
5
1 2 3 4 5
6 7 8 9 1
2 3 4 5 6
7 8 9 1 2
3 4 5 6 7
3
2 2 8 7 4
6 5 7 7 7
8 8 9 9 9
0

Output for the Sample Input

36
38
99
0
72

Solution in C (judge verdict: Wrong Answer)

#include<stdio.h>

int main(void){
  int h,i,j,k,x;
  int n=0;
  int count;
  int point[256] = {0};
  int stone[15][5]={0};

  while(1){

    scanf("%d", &h);                                    //高さの入力
    if(h == 0){
      break;
    }

    for(i=0;i<h;i++){                                   
      for(j=0;j<5;j++){
	scanf("%d",&stone[h-1-i][j]);                   //石群の入力
      }
    }

    for(k=0;k<=h*5;k++){
      for(i=0;i<h;i++){
	count=1;
	for(j=0;j<5;j++){
	  if(stone[i][j]==stone[i][j+1]){               //水平に隣り合う同じ数字の石を探す
	    count++;
	  }else{
	    if(count>2){                                
	      point[n] += count * stone[i][j];          //同じ数字の石が3個以上あれば　数字の合計を獲得ポイントに加算
	      for(count -= 1;count>=0;count--){
		stone[i][j-count] = 0;                  //同じ数字の石を全て0に更新
	      }
	    }
	    count=1;                                    //カウントをリセット
	  }
	}
      }

       for(j=0;j<5;j++){
	count = 0;
	for(i=0;i<h;i++){
	  stone[i-count][j]=stone[i][j];                //一つ上の石の数字を下の石にコピー　すなわち移動する
	  if(stone[i][j]==0)
	    count++;                                    //カウントをインクリメント
	}
	for(i=h-count;i<h;i++)
	  stone[i][j]=0;                                //上から移動された分の石を0に更新
      }
    }
    n++;
  }

  for(i=0;i<n;i++){                                      //出力
    printf("%d\n", point[i]);
  }

  return 0;
}