给程序员介绍一些C++开源库

/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.

URL   : http://acm.hdu.edu.cn/showproblem.php?pid=1312 Name  : 1312 Red and Black

Date  :Sunday, August 14, 2011
Time Stage : half an hour

Result:
4412418	2011-08-14 15:52:18 Accepted 1312 15MS 196K 1248 B C++ pyy

Test Data:

Review:
这个……水题啊水题～～～
//----------------------------------------------------------------------------*/

#include <stdio.h>
#include <string.h>
#include <conio.h>

#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))

#define infinity	0x7f7f7f7f
#define minus_inf	0x80808080

#define MAXSIZE 22

int w, h, startx, starty, cnt ;
char map[MAXSIZE][MAXSIZE] ;

void dfs (int x, int y)
{
if (map[x][y] != '.' || x < 1 || x > h || y < 1 || y > w)
return ;
++cnt ;
map[x][y] = '#' ;
dfs (x-1, y) ;
dfs (x, y-1) ;
dfs (x+1, y) ;
dfs (x, y+1) ;
}

int main ()
{
int i, j ;
while (scanf ("%d%d", &w, &h), w+h)
{
getchar () ;
for (i = 1 ; i <= h ; ++i)
{
for (j = 1 ; j <= w ; ++j)
{
scanf ("%c", &map[i][j]) ;
if (map[i][j] == '@')
{
startx = i ;
starty = j ;
map[i][j] = '.' ;
}
}
getchar () ;
}
cnt = 0 ;
dfs (startx, starty) ;
printf ("%d\n", cnt) ;
}
return 0 ;
}