#include<cstdio> |
#include<cstdlib> |
#include<cmath> |
#include<cstring> |
#include<cctype> |
#include<algorithm> |
#include<stack> |
#include<queue> |
#include<iostream> |
using namespace std; |
#define MAXN 25 |
char str[MAXN][MAXN]; |
int W,H; |
int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}}; |
int dfs( int x, int y) |
{ |
int i,j,k; |
int num=0; |
for (i=0;i<4;i++) |
{ |
int dx=x+dir[i][0]; |
int dy=y+dir[i][1]; |
if () |
} |
} |
int main() |
{ |
while ( scanf ( "%d%d" ,&W,&H)&&W+H!=0) |
{ |
int i,j,k; |
int sx,sy; |
for (i=0;i<H;i++) |
{ |
for (j=0;j<=W+1;j++) |
{ |
scanf ( "%c" ,&str[i][j]); |
if (str[i][j]== '@' ) |
{ |
sx=i; |
sy=j; |
} |
} |
} |
int ans=dfs(sx,sy); |
printf ( "%d\n" ,ans); |
} |
return 0; |
} |