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++: /**********************************************

1.red and black
2.炭田高輝
3.sumita.takaki@gmail.com

last updated: 2013-10-15@20:19

 **********************************************/
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;


void rec(int y, int x);
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
bool visit[21][21];
string tiles[21];
int h=0, w=0;



int main(void){
        


        while(cin >> w >> h, h){
                
                
                for(int i=0; i<h; i++){

                        cin >> tiles[i];
                        
                        for(int j=0; j<w; j++)visit[i][j] = false;
                }


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

                        for(int j=0; j<w; j++){
                                
                                if(tiles[i][j] == '@')rec(i,j);

                        }
                }
                                
                int ans = 0;

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

                        for(int j=0; j<w; j++){
                                if(visit[i][j])ans++;
                        }

                }

                cout << ans << endl;

        }



}

void rec(int y, int x){

        
        if(visit[y][x])return;
        visit[y][x] = true;

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

                if(ny<0 || nx<0 || ny>=h || nx>=w)continue;
                if(tiles[ny][nx] == '#')continue;
                rec(ny,nx);
        }



}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>

using namespace std;

vector<string> field;
int w,h;

int bfs(int sx,int sy){

	bool passed[21][21];
	for(int i = 0; i < 21; i++)
		fill(passed[i],passed[i]+21,false);

	queue<pair<int,int> > *prv = new queue<pair<int,int> >();
	queue<pair<int,int> > *nxt = new queue<pair<int,int> >();

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

	prv->push(make_pair(sy,sx));
	while(prv->size()){
		while(prv->size()){
			pair<int,int> cp = prv->front();prv->pop();
			if(passed[cp.first][cp.second])
				continue;
			passed[cp.first][cp.second] = true;
			for(int i = 0; i < 4; i++){
				pair<int,int> np = cp;
				np.first += dy[i];
				np.second += dx[i];
				// ツ各ツ陛サツ古シツづ鳴暗堋督ョ
				if(np.first >= 0 && np.second >= 0 && np.first < h && np.second < w){
					if(passed[np.first][np.second] || field[np.first][np.second] == '#')
						continue;
					nxt->push(np);
				}
			}
		}
		swap(prv,nxt);
	}

	delete prv,nxt;

	int cnt = 0;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			if(passed[i][j])
				cnt++;
		}
	}

	return cnt;
}

int main(){

	while(cin >> w >> h && !(w == 0 && h == 0)){
		int sx,sy;
		for(int i = 0; i < h; i++){
			string str;
			cin >> str;
			field.push_back(str);
			for(int k = 0; k < str.size(); k++){
				if(str[k] == '@'){
					sx = k;
					sy = i;
				}
			}
		}
		cout << bfs(sx,sy) << endl;

		field.clear();
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int,int> P;

int main()
{
  int w, h;
  while (cin >> w >> h && w != 0) {
    vector<string> grid(h);
    P start;
    for (int i = 0; i < h; i++) {
      cin >> grid[i];
      for (int j = 0; j < w; j++) {
        if (grid[i][j] == '@') {
          start = make_pair(i, j);
          grid[i][j] = '#';
        }
      }
    }

    queue<P> q;
    q.push(start);
    int ans = 0;
    while (!q.empty()) {
      const P p = q.front();
      q.pop();

      ans++;
      for (int d = 0; d < 4; d++) {
        static const int dir_h[] = {-1, 1, 0, 0};
        static const int dir_w[] = {0, 0, -1, 1};
        const int next_h = p.first+dir_h[d];
        const int next_w = p.second+dir_w[d];
        if (next_h >= 0 && next_h < h && next_w >= 0 && next_w < w
            && grid[next_h][next_w] == '.') {
          q.push(make_pair(next_h, next_w));
          grid[next_h][next_w] = '#';
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define rep(i, n) for(int i = 0; i < n; i ++)
#define ALL(T) T.begin(), T.end()
#define mp make_pair
#define pb push_back
#define X first
#define Y second

using namespace std;

typedef pair<int, int> pii;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<string> vs;

const int INF = 1 << 24;
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

int cnt, w, h;
char m[20][20];

void dfs(pii);

int main(void){
    while(cin >> w >> h, w){
        cnt = 0;
        pii p;

        rep(y, h){
            cin >> m[y];
            rep(x, w) if(m[y][x] == '@') m[y][x] = '.', p = mp(x, y);
        }

        dfs(p);
        cout << cnt << endl;
    }

    return 0;
}

void dfs(pii p){
    if((p.X < 0 || w <= p.X) ||
       (p.Y < 0 || h <= p.Y)) return;

    if(m[p.Y][p.X] == '.') cnt ++;
    else return;
    m[p.Y][p.X] = '#';

    rep(i, 4){
        pii next = mp(p.X + dx[i], p.Y + dy[i]);
        dfs(next);
    }
}