Sample Input

4 4
*...
....
.*..
....
3 5
**...
.....
.*...
0 0

Sample Output

Field #1:
*100
2210
1*10
1110

Field #2:
**100
33200
1*100


解法: BFS


import java.util.Scanner;

public class UVA10189 {

 public static void main(String[] args) {

  Scanner sc = new Scanner(System.in);

  int field = 0;

  while (sc.hasNext()) {

   String temp[] = sc.nextLine().split(" ");

   int n = Integer.parseInt(temp[0]);
   int m = Integer.parseInt(temp[1]);

   if (n == 0 && m == 0) {
    break;
   }

   field += 1;

   if (field > 1)
    System.out.println();

   String a = null;

   char matrix[][] = new char[n][m];

   int count_mine[][] = new int[n][m];


   for (int i = 0; i < n; i++) {

    a = sc.nextLine();

    for (int j = 0; j < m; j++) {

     matrix[i][j] = a.charAt(j);

     if (a.charAt(j) == '*')

      count_mine[i][j] = -1;
     else
      count_mine[i][j] = 0;

    }

   }

   for (int i = 0; i < n; i++) {

    for (int j = 0; j < m; j++) {

     if (count_mine[i][j] != -1) {
      int count = 0;

      for (int s = -1; s <= 1; s++) {

       for (int t = -1; t <= 1; t++) {

        if (i + s >= 0 && i + s < n && j + t >= 0
          && j + t < m)

        {

         if (matrix[i + s][j + t] == '*')
          count++;
        }

       }

      }
      count_mine[i][j] = count;
     }

    }

   }

   System.out.println("Field #" + field + ":");

   for (int i = 0; i < n; i++) {

    for (int j = 0; j < m; j++) {

     if (count_mine[i][j] != -1) {
      System.out.print(count_mine[i][j]);
     } else {
      System.out.print('*');
     }

    }
    System.out.println();
   }
  }
 }
}