标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12138 Accepted Submission(s):
7554
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 char a[21][21]; 5 int m,n; 6 int count=0; 7 void dfs(int x,int y) 8 { 9 if(a[x][y]==‘.‘&&x<n&&x>=0&&y<m&&y>=0) 10 { 11 count++; 12 a[x][y]=‘#‘; 13 dfs(x+1,y); 14 dfs(x,y+1); 15 dfs(x,y-1); 16 dfs(x-1,y); 17 } 18 } 19 int main() 20 { 21 freopen("in.txt","r",stdin); 22 while(scanf("%d%d",&m,&n)&&m!=0&&n!=0) 23 { 24 count=0; 25 int i,j,x,y; 26 for(i=0;i<n;i++) 27 { 28 for(j=0;j<m;j++) 29 { 30 cin>>a[i][j]; 31 if(a[i][j]==‘@‘) 32 { 33 x=i;y=j; 34 } 35 } 36 } 37 a[x][y]=‘.‘; 38 dfs(x,y); 39 cout<<count<<endl; 40 } 41 }
标签:
原文地址:http://www.cnblogs.com/a1225234/p/4618518.html