Red and black poj1979 // acmclub.com 6659
2014-10-16 00:22
162 查看
#include<iostream> #include<cstdio> using namespace std; char tiles[21][21]; int x,y,w,h,ans; int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};//^<> void dfs(int sx,int sy){ ans++;tiles[sy][sx]='#'; for(int i=0;i<4;i++){ int nx=sx+dx[i],ny=sy+dy[i]; if(nx>=1&&nx<=w&&ny>=1&&ny<=h&&tiles[ny][nx]=='.'/**/)dfs(nx,ny); } } int main(){ // freopen("red.txt","r",stdin); while(cin>>w>>h&&(w||h)){ ans=0; getchar(); for(int i=1;i<=h;i++){ for(int j=1;j<=w;j++){ tiles[i][j]=getchar(); if(tiles[i][j]=='@'){x=j;y=i;} } getchar(); } dfs(x,y); cout<<ans<<endl; } return 0; }
相关文章推荐
- 1027:电子钟 Form sdjzu.acmclub.com
- Ants acmclub.com 10913 // poj 1852
- 破译邮件 Form SDJZU.acmclub.com
- 1.6.7将军(Check the Check)UVa 10196 // PC 1101017 // acmclub.com 25177
- 迷宫最短路径问题(maze)acmclub.com 1102
- Lake Counting (Poj 2386 // hzu.acmclub.com 11448)
- 贪心——区间问题 hzu.acmclub.com 1126看电视
- dutacm.club Water Problem(矩阵快速幂)
- acmclub 1028行车路程
- ACMclub 2117 确定比赛名次(拓扑排序)
- 北大ACM 1001题:求高精度幂-------http://blog.sina.com.cn/s/blog_498c588d0100vwjg.html
- IntelliJ IDEA2017 修改缓存文件的路径(转载:https://www.cnblogs.com/acm-bingzi/p/ideaCachePath.html)
- svn俱乐部(svnclub.com)给力2011
- dutacm.club_1087_Common Substrings_(KMP)_(结合此题通俗理解kmp的next数组)
- acm入门必看的学长经验【转载自www.acmwiki.com】
- ZOJ ACM CLUB晚会
- 解决postfix relay=none; status=bounced (mail for thehealthclub.com loops back to myself)
- ZOJ ACM CLUB晚会
- ACM Portal和Amazon.com的搜索引擎,怎一个烂字了得
- Acm Club 1326:算法2-8~2-11:链表的基本操作