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 JAVA (judge verdict: Wrong Answer)


import java.util.Scanner;

public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        while(true){
            int h = sc.nextInt();
            if(h==0)break;
            int[][] f = new int[h][5];
            for (int i = 0; i < f.length; i++) {
                for (int j = 0; j < 5; j++) {
                    f[f.length-1-i][j]=sc.nextInt();   
                      
                }
            }
            System.out.println(calc(f));
        }
    }
    static int calc(int[][] f){
        int res = 0;
        while(true){
            boolean[][] checked = new boolean[f.length][5];
            int point = 0;
            for (int i = 0; i < f.length; i++) {
                for (int j = 0; j < 3; j++) {
                    for (int j2 = 1; j2 <= 9; j2++) {
                        boolean flg =true;
                        for (int k = 0; k < 3; k++) {
                            if(f[i][j+k]!=j2){
                                flg=false;
                            }
                        }
                        if(flg){
                            for (int k = 0; k < 3; k++) {
                                checked[i][j+k]=true;
                            }
                        }
                    }
                }
            }
            for (int i = 0; i < checked.length; i++) {
                for (int j = 0; j < 5; j++) {
                    if(checked[i][j]){
                        point+=f[i][j];
                        f[i][j]=0;
                    }
                }
            }
            
            if(point==0)break;
            res+=point;
            fall(f);
        }
        return res;
    }
    static void fall(int[][] f){
        for (int i = 0; i < f.length; i++) {
            for (int j = 0; j < 5; j++) {
                while(f[i][j]==0 && above(f,i,j)){
                    for (int j2 = i; j2 < f.length-1; j2++) {
                        f[j2][j] = f[j2+1][j];
                    }
                }
            }
        }
    }
    static boolean above(int[][]f,int y,int x){
        for (int i = y+1; i < f.length; i++) {
            if(f[i][x]>0)return true;
        }
        return false;
    }
   
}