#include #include char map[100][100]; int sign[100][100]; int n,m; int ans; void dfs(int x,int y) { if(x>=0&&x=0&&y=0&&map[x-1][y]=='.'&&sign[x-1][y]==0) { sign[x-1][y]=1; ans++; dfs(x-1,y); } if(x+1=0&&map[x][y-1]=='.'&&sign[x][y-1]==0) { sign[x][y-1]=1; ans++; dfs(x,y-1); } if(y+1