八连块问题（刘汝佳）

http://wenku.baidu.com/link?url=v8pqTJx34ttdwvzsCHbkYvlV6euGrk-Gq_qhqj3J4_CrqGLqZFHULgw_EXTd2KPc-U2ATiXMu4gNl8JCdBAWvMNgK9C4sYL9OUrMvnEt8dq&pn=51

#include <cstdio>

#include <iostream>
#include <cstring>
using namespace std;

int mat[100][100];
int vis[100][100];
int dfs(int x,int y)
{
    if(!mat[x][y] || vis[x][y])
    {

       return 0;
    }
     vis[x][y]=1;
    dfs(x-1,y-1);dfs(x-1,y);dfs(x-1,y+1);dfs(x,y-1);dfs(x,y+1);dfs(x+1,y-1);dfs(x+1,y);dfs(x+1,y+1);
}
int main()
{
    int n;
    while(cin>>n)
    {
        memset(mat,0,sizeof(mat));
        memset(vis,0,sizeof(vis));
        int count=0;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
        {
            cin>>mat[i][j];
        }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
        {
            if(mat[i][j] &&(!vis[i][j]))
            {
                ++count;
                dfs(i,j);
            }
        }
        cout<<"八连快的个数为："<<count<<endl;
    }
}