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 <iostream>
#include <algorithm>
#define MAX_INT  100005
using namespace std;

//??\???????????§???
#define MAX_X  22
#define MAX_Y  22

//?????°
char field[MAX_X][MAX_Y];
int X, Y;
int px, py;                     // players position


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


void print_field() {
  for (int y = 0; y < Y; y++ ) {
    for (int x = 0; x < X; x++ ) {
      cout << field[x][y];
    }
    cout << endl;
  }
  cout << endl;
}


void dfs(int x, int y) {

  field[x][y] = '$';            // ?¨????????????¨?????°

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

    if(field[nx][ny] == '.') {
      dfs(nx, ny);
    }
  }

}


int main() {

  while(true) {

    cin >> X >> Y;

    if(X == 0 && Y == 0) break;

    for(int y = 0; y < Y; y++ ){
      for(int x = 0; x < X; x++ ){
        cin >> field[x][y];
        if( field[x][y] == '@' ) { px = x; py = y; }
      }
    }

    dfs(px, py);

    // ?¨?????????´????????°??????
    int res = 0;
    for(int y = 0; y < Y; y++ ){
      for(int x = 0; x < X; x++ ){
        if ( field[x][y] == '$' ) { res++; }
      }
    }

    cout << res << endl;
  }
  return 0;

}

C++: #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<int,int> P;
typedef set<int> S;
ll n;
char maze[25][25];
int dist[25][25];
int sx,sy;
int h,w;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
vector<int> ans;
void bfs(){
    queue<P> que;
    for(int i = 0;i < 25; i++){
        for(int j = 0;j < 25; j++){
            dist[i][j]=-1; //距離の初期化
        }
    }
    que.push(P(sy,sx));
    dist[sy][sx]=0;
    while(que.size()){
        P p=que.front();
        que.pop(); //キューの先頭を取り出す
        for(int i=0;i<4;i++){
            int ny = p.first + dy[i] , nx = p.second + dx[i]; 
            if(0<=nx && nx <= (w-1) && 0<=ny && ny <= (h-1) && maze[ny][nx]!='#' && dist[ny][nx] == -1){
            que.push(P(ny,nx));
            dist[ny][nx]=dist[p.first][p.second]+1;
            }
        }
    }
    int cnt=0;
    for(int i=0;i<25;i++){
        for(int j=0;j<25;j++){
            if(dist[i][j]!=-1) cnt++;
        }
    }
    ans.push_back(cnt);
}
int main(){
    while(1){
        cin>>w>>h;
        if(h==0 && w==0){
            for(int i=0;i<ans.size();i++) cout<<ans[i]<<endl;
            return 0;
        }
        //入力と初期位置の決定
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cin>>maze[i][j];
                if(maze[i][j]=='@'){
                    sx=j;
                    sy=i;
                }
            }
        }
        //cout<<sx<<" "<<sy<<endl;
        bfs();
    }
    return 0;
}

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

using namespace std;

#define WH 22

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

int main(int argc, char const *argv[])
{
	int w,h;
	char f[WH][WH];

	char c;
	int cnt;

	int x,y;

	while(1){
		cin>>w>>h;
		if(w+h==0) break;

		for(int i1=0;i1<WH;i1++){
			for(int i2=0;i2<WH;i2++){
				f[i1][i2]='#';
			}
		}
		queue<pair<int,int> > q;
		cnt=1;

		for(int i1=1;i1<=h;i1++){
			for(int i2=1;i2<=w;i2++){
				cin>>f[i1][i2];
				if(f[i1][i2]=='@'){
					x=i2;
					y=i1;
				}
			}
		}

		q.push(make_pair(x,y));
		while(!q.empty()){
			x=q.front().first;
			y=q.front().second;
			q.pop();

			for(int i1=0;i1<4;i1++){
				if(f[y+dy[i1]][x+dx[i1]]=='.') {
					cnt++;
					q.push(make_pair(x+dx[i1],y+dy[i1]));
					f[y+dy[i1]][x+dx[i1]]='@';
				}
			}
		}

		cout<<cnt<<endl;


	}


	return 0;
}

C++: #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int H,W;
char S[22][22];

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

int dfs(int x,int y){
  used[x][y]=true;
  int res=1;
  for(int i=0;i<4;i++){
    int nx=x+dx[i];
    int ny=y+dy[i];
    if(nx<0||ny<0||nx>=H||ny>=W) continue;
    if(used[nx][ny]) continue;
    if(S[nx][ny]!='.') continue;
    res+=dfs(nx,ny);
  }
  return res;
}

void solve(){
  for(int i=0;i<H;i++) for(int j=0;j<W;j++) cin>>S[i][j];
  for(int i=0;i<H;i++) for(int j=0;j<W;j++) used[i][j]=false;

  int stx,sty;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(S[i][j]=='@'){
        stx=i;
        sty=j;
      }
    }
  }

  cout<<dfs(stx,sty)<<endl;

}

int main(){
  while(1){
    cin>>W>>H;
    if(W==0) break;
    solve();
  }

  return 0;
}