Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var (
	sc = bufio.NewScanner(os.Stdin)
)

type Color int

const (
	ColorBlack Color = iota
	ColorRed
)

type Node struct {
	ID    int
	X, Y  int
	Color Color
	Nexts []*Node
}

func main() {
	for sc.Scan() {
		if sc.Text() == "0 0" {
			break
		}
		chunks := strings.Split(sc.Text(), " ")
		w, _ := strconv.Atoi(chunks[0])
		h, _ := strconv.Atoi(chunks[1])

		// Initialize map
		m := map[int]map[int]*Node{}
		for x := 1; x <= w; x++ {
			m[x] = map[int]*Node{}
			for y := 1; y <= h; y++ {
				m[x][y] = &Node{ID: x + y*w, X: x, Y: y}
			}
		}
		for x := 1; x <= w; x++ {
			for y := 1; y <= h; y++ {
				nexts := []*Node{}
				if n, ok := m[x-1][y]; ok {
					nexts = append(nexts, n)
				}
				if n, ok := m[x][y-1]; ok {
					nexts = append(nexts, n)
				}
				if n, ok := m[x+1][y]; ok {
					nexts = append(nexts, n)
				}
				if n, ok := m[x][y+1]; ok {
					nexts = append(nexts, n)
				}
				m[x][y].Nexts = nexts
			}
		}

		// Set colors
		queue := []*Node{}
		touchedIDs := map[int]struct{}{}
		for y := 1; y <= h; y++ {
			sc.Scan()
			for i, c := range sc.Text() {
				switch c {
				case '.', '@':
					n := m[i+1][y]
					n.Color = ColorBlack
					if c == '@' {
						queue = append(queue, n)
						touchedIDs[n.ID] = struct{}{}
					}
				case '#':
					m[i+1][y].Color = ColorRed
				}
			}
		}

		// Search
		visitedIDs := map[int]struct{}{}
		for {
			if len(queue) == 0 {
				break
			}
			n := queue[0]
			queue = queue[1:]
			visitedIDs[n.ID] = struct{}{}
			for _, next := range n.Nexts {
				if next.Color == ColorRed {
					continue
				}
				if _, ok := touchedIDs[next.ID]; !ok {
					queue = append(queue, next)
					touchedIDs[n.ID] = struct{}{}
				}
			}
		}
		fmt.Println(len(visitedIDs))
	}
}

C++: #include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int inf = 1000000000;
const int mod = 1000000007;
const double eps = 1e-9;
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1};

int W, H;
int ans = 0;
string field[100];

void dfs(int y, int x) {
	if (x < 0 || y < 0 || x == W || y == H) return;
	if (field[y][x] == '#') return;
	ans++;
	field[y][x] = '#';
	rep(i, 4) dfs(y + dy[i], x + dx[i]);
}

int main() {
	while (cin >> W >> H, W) {
		rep(i, H) cin >> field[i];
		rep(i, H) rep(j, W) {
			if (field[i][j] == '@') dfs(i, j);
		}
	}
	return 0;
}

C++: #include <iostream>
#include <string>

using namespace std;


int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int w,h;
int map[21][21];

int count;
int init_x,init_y;

void dfs(int x,int y) {
  
  //cout << x << " " << y << endl;

  if(x<0 || x>=w || y<0 || y>=h) return;

  //if(map[x][y]==2) map[x][y]=0;

  if(map[x][y]>0) return;

  map[x][y]=3;

  count++;

  for(int i=0;i<4;i++) dfs(x+dx[i],y+dy[i]);

}

int main() {

  string buf;

  while(cin >> w >> h) {

    if(w==0 && h==0) break;

    getline(cin,buf);

    for(int i=0;i<h;i++) {

      getline(cin,buf);

      for(int j=0;j<w;j++) {

	switch(buf[j]) {

	case '.':
	  map[j][i]=0;
	  break;

	case '#':
	  map[j][i]=1;
	  break;

	case '@':
	  map[j][i]=0;
	  init_x=j;
	  init_y=i;
	  break;

	}

      }

    }

    for(int i=0;i<h;i++) {

      for(int j=0;j<w;j++) {

	cout << map[j][i];

      }

      cout << endl;

    }

    cout << endl;

    cout << map[5][7] << endl;

    count=0;

    dfs(init_x,init_y);

    cout << init_x << " " << init_y << endl;

    for(int i=0;i<h;i++) {

      for(int j=0;j<w;j++) {

	cout << map[j][i];

      }

      cout << endl;

    }

    cout << count << endl;

  }

  return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(ll i=(a);i<ll(b);i++)
#define rep(i,b) loop(i,0,b)

int h,w;
char g[30][30];

int rec(int ci, int cj){
    g[ci][cj] = '#';
    int ans = 1;
    int di[] = {0,1,0,-1};
    int dj[] = {1,0,-1,0};
    rep(i,4){
        int ni = ci + di[i];
        int nj = cj + dj[i];
        if(ni >= h || nj >= w || ni < 0 || nj < 0 || g[ni][nj] == '#') continue;
        ans += rec(ni,nj);
    }
    return ans;
}

int main(){
    while(scanf("%d%d",&w,&h), w != 0){
        rep(i,h) scanf("%s",g[i]);
        int ans = 0;
        rep(i,h)rep(j,w) if(g[i][j]=='@') ans = rec(i,j);
        printf("%d\n",ans);
    }
}

C++: #include<iostream>
#include<queue>

using namespace std;
typedef pair<int, int> pii;
pii dxdy[]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};

int main(){

   while(1){
      int W, H;
      cin>> W>> H;
      if(!(H||W)) break;
      char fld[H][W];
      int sx, sy;
      for(int i=0; i<H; i++){
         for(int j=0; j<W; j++){
            cin>> fld[i][j];
            if(fld[i][j]=='@'){
               sy=i;
               sx=j;
            }
         }
      }

      bool visited[H][W];
      for(int i=0; i<H; i++)for(int j=0; j<W; j++)visited[i][j]=0;
      queue<pii> Q;
      Q.push(pii(sy, sx));
      while(!Q.empty()){
         pii now=Q.front(); Q.pop();
         visited[now.first][now.second]=1;
         for(pii dd: dxdy){
            int ni=now.first+dd.first;
            int nj=now.second+dd.second;
            if(!(0<=ni&&ni<H&&0<=nj&&nj<W)) continue;
            if(fld[ni][nj]=='#') continue;
            if(visited[ni][nj]) continue;
            Q.push(pii(ni, nj));
         }
      }
      int ans=0;
      for(int i=0; i<H; i++)for(int j=0; j<W; j++){
         ans+=visited[i][j];
      }

      cout<< ans<< endl;
   }

   return 0;
}

C++: #include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

int w, h;
bool visited[20][20];
vector<string> field;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};

int dfs(const int x, const int y) {
	visited[y][x] = true;
	int res = 1;
	for(int i = 0; i < 4; ++i) {
		const int nx = x + dx[i], ny = y + dy[i];

		if(nx < 0 || ny < 0 || nx >= w || ny >= h)
			continue;

		if(!visited[ny][nx] && field[ny][nx] != '#')
			res += dfs(nx, ny);
	}

	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(cin >> w >> h, w) {
		field.clear();
		field.resize(h);
		for(int i = 0; i < h; ++i)
			cin >> field[i];

		int sx, sy;
		for(int i = 0; i < h; ++i)
			for(int j = 0; j < w; ++j)
				if(field[i][j] == '@')
					sx = j, sy = i;

		memset(visited, false, sizeof(visited));
		cout << dfs(sx, sy) << endl;
	}

	return EXIT_SUCCESS;
}

C++: #include<stdio.h>
#include<string.h>

int answer,w,h;
char c[21][21];

void move(int x,int y){
    if(c[x][y]!='#'){
        answer++;
        c[x][y]='#';
        if(x-1>=0) move(x-1,y);
        if(x+1<h) move(x+1,y);
        if(y-1>=0) move(x,y-1);
        if(y+1<w) move(x,y+1);
    }
}

int main(){
    while(1){
        int x,y;
        answer=0;
        scanf("%d %d",&w,&h);
        if(w==0&&h==0) return 0;
        getchar();
        for(int i=0;i<h;i++){
            for(int j=0;j<=w;j++){
                scanf("%c",&c[i][j]);
                if(c[i][j]=='@'){
                    x=i;
                    y=j;
                }
            }
        }
        move(x,y);
        printf("%d\n",answer);
    }
}