Red and Black（基础DFS）

Description
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on red tiles, he can move only on black tiles.

Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.

‘.’ - a black tile
‘#’ - a red tile
‘@’ - a man on a black tile(appears exactly once in a data set)
Output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).
Sample Input
6 9
….#.
…..#
……
……
……
……
……

@…

.#..#.
11 9
.#………
.#.#######.
.#.#…..#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#…….#.
.#########.
………..
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..

.

…@…

.

..#.#..
..#.#..
0 0
Sample Output
45
59
6
13

题意：@为起点，.为可以经过的点，#为墙，问可以经过几个.
题解：用DFS把所有路都过一遍，基础DFS

代码（C）

#include<stdio.h>
char a[30][30];
int b[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int ans,m,n;

void dfs(int l,int r)
{
    ans++;
    a[l][r]='#';
    for(int i=0;i<4;i++)
    {
        int q=l+b[i][0];
        int p=r+b[i][1];
        if(q<n&&p<m&&q>=0&&p>=0&&a[q][p]=='.')
          dfs(q,p);
    }
    return;
}

int main()
{
    int i,j,x,y;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        if(n==0&&m==0)  break;
        for(i=0;i<n;i++)
        {
            getchar();//吸收多余的空格，推荐直接用字符串输入
            for(j=0;j<m;j++)
            {
                scanf("%c",&a[i][j]);
                if(a[i][j]=='@')
                {
                    x=i;
                    y=j;
                }
            }

        }
        ans=0;
        dfs(x,y);
        printf("%d\n",ans);
    }
    return 0;
}