摘要： #include <stdio.h>#include <string.h>char visit[20][20];int count,m,n;void dfs(int x,int y){ count++; visit[x][y]='#'; if(x!=0&&visit[x-1][y]=='.')dfs(x-1,y); if(x!=n-1&&visit[x+1][y]=='.')dfs(x+1,y); if(y!=0&&visit[x][y-1]=='.')dfs 阅读全文