hdu 1312

#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
int a[100][100];
int k;
void DFS(int x,int y,int n,int m)
{
if(y-1>0)
if(a[x][y-1])
{
a[x][y-1]=0;
k++;
DFS(x,y-1,n,m);
}
if(y+1<=n)
if(a[x][y+1])
{
a[x][y+1]=0;
k++;
DFS(x,y+1,n,m);
}
if(x+1<=m)
if(a[x+1][y])
{
a[x+1][y]=0;
k++;
DFS(x+1,y,n,m);
}
if(x-1>0)
if(a[x-1][y])
{
a[x-1][y]=0;
k++;
DFS(x-1,y,n,m);
}
}
int main()
{
char c;
int i,j;
int x,y,z;
int n,m;
while(1)
{
memset(a,0,sizeof(a));
scanf("%d%d",&n,&m);
if(n==0&&m==0)
break;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
cin>>c;
if(c=='.')
a[i][j]=1;
if(c=='#')
a[i][j]=0;
if(c=='@')
{
x=i;
y=j;
a[i][j]=0;
}
}
k=1;
DFS(x,y,n,m);
printf("%d\n",k);
}
return 0;
}