Go: package main

import (
	"bufio"
	"encoding/json"
	"fmt"
	"os"
	"strconv"
	"strings"
)

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

type Color int

const (
	ColorBlack Color = iota
	ColorRed
)

var strByColor = map[Color]string{
	ColorBlack: "black",
	ColorRed:   "red",
}

func (c Color) String() string {
	return strByColor[c]
}

type Node struct {
	ID      int
	X, Y    int
	Color   Color
	NextIDs map[int]struct{}
}

func (n *Node) String() string {
	d, _ := json.Marshal(n)
	return string(d)
}

type Map struct {
	Width, Height int
	Nodes         map[int]*Node
}

func (m *Map) GetByID(id int) *Node {
	return m.Nodes[id]
}

func (m *Map) Get(x, y int) *Node {
	return m.Nodes[m.getID(x, y)]
}

func (m *Map) SetColor(x, y int, c Color) {
	m.Nodes[m.getID(x, y)].Color = c
}

func (m *Map) getID(x, y int) int {
	return x + y*m.Width
}

func (m *Map) init() {
	for x := 1; x <= m.Width; x++ {
		for y := 1; y <= m.Height; y++ {
			id := m.getID(x, y)
			m.Nodes[id] = &Node{ID: id, X: x, Y: y}
		}
	}
	for x := 1; x <= m.Width; x++ {
		for y := 1; y <= m.Height; y++ {
			nextIDs := map[int]struct{}{}
			if x > 1 {
				nextIDs[m.getID(x-1, y)] = struct{}{}
			}
			if x < m.Width {
				nextIDs[m.getID(x+1, y)] = struct{}{}
			}
			if y > 1 {
				nextIDs[m.getID(x, y-1)] = struct{}{}
			}
			if y < m.Height {
				nextIDs[m.getID(x, y+1)] = struct{}{}
			}
			m.Get(x, y).NextIDs = nextIDs
		}
	}
}

func NewMap(w, h int) *Map {
	m := &Map{Width: w, Height: h, Nodes: map[int]*Node{}}
	m.init()
	return m
}

type Searcher struct {
	Map        *Map
	queue      []*Node
	touchedIDs map[int]struct{}
	visitedIDs map[int]struct{}
}

func NewSearcher(m *Map) *Searcher {
	return &Searcher{
		Map:        m,
		queue:      []*Node{},
		touchedIDs: map[int]struct{}{},
		visitedIDs: map[int]struct{}{},
	}
}

func (s *Searcher) Search(start *Node) {
	s.enqueue(start)

	for {
		if len(s.queue) == 0 {
			break
		}
		for nextID := range s.dequeue().NextIDs {
			n := s.Map.GetByID(nextID)
			if n.Color == ColorRed || s.hasTouched(n) {
				continue
			}
			s.enqueue(n)
		}
	}
}

func (s *Searcher) VisitedNodeCount() int {
	return len(s.visitedIDs)
}

func (s *Searcher) hasTouched(n *Node) bool {
	_, ok := s.touchedIDs[n.ID]
	return ok
}

func (s *Searcher) enqueue(n *Node) {
	s.queue = append(s.queue, n)
	s.touchedIDs[n.ID] = struct{}{}
}

func (s *Searcher) dequeue() *Node {
	n := s.queue[0]
	s.queue = s.queue[1:]
	s.visitedIDs[n.ID] = struct{}{}
	return n
}

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])

		m := NewMap(w, h)

		// Set colors
		var start *Node
		for y := 1; y <= h; y++ {
			sc.Scan()
			for i, c := range sc.Text() {
				switch c {
				case '.', '@':
					m.SetColor(i+1, y, ColorBlack)
					if c == '@' {
						start = m.Get(i+1, y)
					}
				case '#':
					m.SetColor(i+1, y, ColorRed)
				}
			}
		}

		// Search
		s := NewSearcher(m)
		s.Search(start)
		fmt.Println(s.VisitedNodeCount())
	}
}

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

using namespace std;

typedef long long int ll;
typedef pair<int,int> P;

#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define all(x) x.begin(),x.end()

const ll mod = 1e9+7;
const ll INF = 1e9;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

bool valid(int lx,int ux,int ly,int uy,int x,int y){
	return (lx<=x&&x<ux&&ly<=y&&y<uy);
}

int main()
{
	int w,h;
	while(cin>>w>>h,w!=0&&h!=0){
		vector<string> s(h);
		rep(i,h)cin>>s[i];

		queue<P> que;
		rep(i,h)rep(j,w)if(s[i][j]=='@')s[i][j]='x',que.push(P(i,j));
		while(!que.empty()){
			P p = que.front();que.pop();
			int y=p.first,x=p.second;
			rep(i,4){
				if(valid(0,w,0,h,x+dx[i],y+dy[i])){
					if(s[y+dy[i]][x+dx[i]]=='.'){
						s[y+dy[i]][x+dx[i]]='x';
						que.push(P(y+dy[i],x+dx[i]));
					}
				}
			}
		}
		int ans=0;
		rep(i,h)rep(j,w)if(s[i][j]=='x')ans++;
		cout<<ans<<endl;
	}
	return 0;
}

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

int visit(int a, int b);

using namespace std;

vector<string> cell;
vector< vector<bool> > check;
int c, d;

int main(){
    
    while(cin >> c >> d, c | d){
        string temp;
        int x = 0, y = 0;
        
        for(int i = 0; i < d; i++){
            cin >> temp;
            cell.push_back(temp);
        }
        
        for(int i = 0; i < d; i++){
            for(int j = 0; j < c; j++){
                if(cell[i][j] == '@'){
                    x = j;
                    y = i;
                }
            }
        }
        
        for(int i = 0; i < d; i++){
            vector<bool> temp2;
            for(int j = 0; j < c; j++){
                temp2.push_back(false);
            }
            check.push_back(temp2);
        }
        
        cout << visit(y, x) << endl;
        
        cell.clear();
        check.clear();
        
        
    }
    
    return 0;
}

int visit(int a, int b){
    int ans = 0;
    
    check[a][b] = true;
    
    if(a + 1 < d && cell[a + 1][b] != '#' && !check[a + 1][b]){
        ans += visit(a + 1, b);
    }
    
    if(b + 1 < c && cell[a][b + 1] != '#' && !check[a][b + 1]){
        ans += visit(a, b + 1);
    }
    
    if(a - 1 > -1 && cell[a - 1][b] != '#' && !check[a - 1][b]){
        ans += visit(a - 1, b);
    }
    
    if(b - 1 > -1 && cell[a][b - 1] != '#' && !check[a][b - 1]){
        ans += visit(a, b - 1);
    }
    
    ans++;
    
    return ans;
}

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

using namespace std;

int solve( int w, int h, vector< vector<char> > &v );
void dfs( int W, int H, int w_index, int h_index, vector< vector<char> > &V, int &ans );

int main(int argc, char const *argv[]) {
    vector< vector<char> > vec;

    int w, h;
    vector<int> sums;

    while (1) {
        cin >> w >> h;

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

        vec.resize(w);
        for (int i = 0; i < w; i++) {
            vec[i].resize(h);
        }

        for (int i = 0; i < w; i++) {
            for (int j = 0; j < h; j++) {
                cin >> vec[i][j];
            }
        }

        sums.push_back( solve( w, h, vec ) );
    }

    for( auto it = sums.begin(); it != sums.end(); it ++ ){
        cout << *it << endl;
    }

    return 0;
}

int solve( int w, int h, vector< vector<char> > &v ){
    int w_index, h_index, total;
    int ans = 0;

    for (auto it = v.begin(); it != v.end(); it++ ) {
        auto iter = find(it->begin(), it->end(), '@');

        if(iter!=it->end()){
            w_index = distance( v.begin(), it );
            h_index = distance( it->begin(), iter );
        }
    }

    dfs( w, h, w_index, h_index, v, ans );

    return ans;
}

void dfs( int W, int H, int w_index, int h_index, vector< vector<char> > &V , int &ans ){
    int dx[4] = { 1, 0, -1, 0 };
    int dy[4] = { 0, 1, 0, -1 };
    V[w_index][h_index] = '#';

    for( int i = 0; i < 4; i++ ){
        int nx = w_index + dx[i];
        int ny = h_index + dy[i];

        if( 0 <= nx && nx < W && 0 <= ny && ny < H && V[nx][ny] == '.' ){
            ans++;
            dfs( W, H, nx, ny, V, ans );
        }
    }

    return;
}