UVA572（C&JAVA）

#include<stdio.h>
#include<string.h>
#define MAXN 105
int map[MAXN][MAXN];
int n,m;
void dfs(int i,int j)
{
    if(!map[i][j]) return;
    map[i][j]=0;

    dfs(i+1,j);
    dfs(i-1,j);

    dfs(i-1,j-1);
    dfs(i-1,j+1);
    dfs(i+1,j-1);
    dfs(i+1,j+1);

    dfs(i,j+1);
    dfs(i,j-1);
}
int main()
{
   //freopen("a.txt","r",stdin);
   //freopen("b.txt","w",stdout);
   while(scanf("%d%d",&n,&m)!=EOF)
   {
       if(n==0||m==0) break;
       getchar();
       memset(map,0,sizeof(map));
       for(int i=1;i<=n;i++)
       {
           for(int j=1;j<=m;j++)
           {
               char ch;
               scanf("%c",&ch);
               if(ch=='@') map[i][j]=1;
           }
           getchar();
       }
       int ans=0;
       for(int i=1;i<=n;i++)
       {
           for(int j=1;j<=m;j++)
           {
               if(map[i][j])
               {
                   dfs(i,j);
                   ans++;
               }
           }
       }
       printf("%d\n",ans);
   }
   //fclose(stdin);
   //fclose(stdout);
   return 0;
}

import java.util.Scanner;

public class Main {
	char[][] in;
	boolean[][] bl;

	public static void main(String[] args) {
		Scanner ro = new Scanner(System.in);
		Main dp = new Main();
		int x, y;
		x = ro.nextInt();
		y = ro.nextInt();
		while (x != 0 && y != 0) {
			dp.in = new char[x][y];
			dp.bl = new boolean[x][y];
			int count = 0;
			for (int i = 0; i < x; i++) {
				String temp = ro.next();
				dp.in[i] = temp.toCharArray();
			}
			for (int i = 0; i < x; i++) {
				for (int j = 0; j < y; j++) {
					if (dp.in[i][j] == '@' && !dp.bl[i][j]) {
						count++;
						dp.oil(i, j);
					}
				}
			}
			System.out.println(count);
			x = ro.nextInt();
			y = ro.nextInt();
		}
	}

	public void oil(int x, int y) {
		try {
			if (in[x][y] != '@' || bl[x][y]) {
				return;
			}
			bl[x][y] = true;
			oil(x - 1, y - 1);
			oil(x - 1, y);
			oil(x - 1, y + 1);
			oil(x, y - 1);
			oil(x, y + 1);
			oil(x + 1, y - 1);
			oil(x + 1, y);
			oil(x + 1, y + 1);
		} catch (ArrayIndexOutOfBoundsException aiex) {
			return;
		}
	}
}