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 <iostream>
using namespace std;

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

char map[32][32];
int w, h;

int counter;

void count(int x, int y) {
	map[x][y] = '#';
	counter++;
	for (int i = 0; i < 4; i++) {
		int nextX = x + dx[i];
		int nextY = y + dy[i];
		if ((0 <= nextX && nextX < w) && (0 <= nextY && nextY < h)) {
			if (map[nextX][nextY] != '#') {
				count(nextX, nextY);
			}
		}
	}
}

int main() {
	int startX, startY;
	while (cin >> w >> h, w || h) {
		counter = 0;
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				cin >> map[j][i];
				if (map[j][i] == '@') {
					startX = j;
					startY = i;
				}
			}
		}
		count(startX, startY);
		cout << counter << endl;
	}
}

C++: #include <iostream>
#include <cmath>
#include <vector>
#include <cctype>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;

char map[21][21];
int w, h;
int tile = 0;

void dfs(int x, int y){
    if (!(0 <= x && x < w && 0 <= y < h)) return;
    tile++;
    map[y][x] = '#';
    if (map[y-1][x] == '.') dfs(x, y-1);
    if (map[y+1][x] == '.') dfs(x, y+1);
    if (map[y][x-1] == '.') dfs(x-1, y);
    if (map[y][x+1] == '.') dfs(x+1, y);
}

int main(){
    int sx, sy;
    while (cin >> w >> h, w || h){
	memset(map, '#', sizeof(map));
	tile = 0;
	for (int i = 0; i < h; i++){
	    cin >> map[i];
	    for (int p = 0; p < w; p++){
		if (map[i][p] == '@'){
		    sx = p;
		    sy = i;
		}
	    }
	}

	dfs(sx, sy);

	cout << tile << endl;
    }
    
    return 0;
}

C++: #include <iostream>
using namespace std;

#define endll '\n'
#define ll long long

const int crow = 25;
bool visited [crow][crow];
string tiles[crow];
int row, col, cnt;

void dfs (int posx, int posy) {
    if (posx < 0 || posy < 0 || posx >= col || posy >= row || visited [posy][posx] || tiles[posy][posx] == '#')
        return;
    visited [posy][posx] = true;
    cnt++;
    dfs (posx-1, posy);
    dfs (posx+1, posy);
    dfs (posx, posy-1);
    dfs (posx, posy+1);
}


int main () {

    cin  >> col >> row;
    while (row && col) {
        int posx = 0, posy = 0;
        for (int j = 0; j < row; j++) {
            cin >> tiles[j];
            for (int i = 0; i < col; i++) {
                visited [j][i] = false;
                if (tiles[j][i] == '@') {
                    posx = i;
                    posy = j;
                    //visited [j][i] = true;
                }
            }
        }
        cnt = 0;
        dfs (posx, posy);
        cout << cnt << endll;
        cin  >> col >> row;
    }
}

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 >> s[i];
		rep(i, H) rep(j, W) {
			if (s[i][j] == '@') solve(i, j);
		}
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int count=0;
void move(int x,int y,vector<vector<char> > &room,int w,int h){
    count++;
    if(x>0){
        if(room[x-1][y]=='.'){
            room[x-1][y]='@';
            move(x-1,y,room,w,h);
        }
    }
    if(x<h-1){
        if(room[x+1][y]=='.'){
            room[x+1][y]='@';
            move(x+1,y,room,w,h);
        }
    }
    if(y<w-1){
        if(room[x][y+1]=='.'){
            room[x][y+1]='@';
            move(x,y+1,room,w,h);
        }
    }
    if(y>0){
        if(room[x][y-1]=='.'){
            room[x][y-1]='@';
            move(x,y-1,room,w,h);
        }
    }
}

int main(void){
    int w=1,h=1,x,y;
    vector<vector<char> > room;
    while(w|h){
        count=0;
        room.clear();
        cin>>w;
        cin>>h;
        if((w|h)==0)break;
        room.resize(h);
        for(int i=0;i<h;i++){
            room[i].resize(w);
        }
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                cin>>room[i][j];
                if(room[i][j]=='@'){
                    x=i;y=j;
                }
            }
        }
        move(x,y,room,w,h);
        cout<<count<<endl;
    }
    return 0;
}

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

using namespace std;

int field[52][52];

void DFS(int x, int y){
    if(field[x][y]==1/*||field[x][y]==-1*/){
        field[x][y]=-1;
        DFS(x,y-1);
        DFS(x-1,y);
        DFS(x+1,y);
        DFS(x,y+1);
    }
}


int main(){
    int w,h;
    while(cin>>w>>h){
        if(w==0&&h==0)break;
        for(int i=0; i<50; i++){
            for(int j=0; j<50; j++){
                field[i][j]=0;
            }
        }
        
        int start_x;
        int start_y;
        for(int i=1; i<=h; i++){
            for(int j=1; j<=w; j++){
                char temp;
                cin>>temp;
                if(temp=='#')field[i][j]=0;
                else field[i][j]=1;
                
                if(temp=='@'){
                    start_x=i;
                    start_y=j;
                }
            }
        }
        
        DFS(start_x,start_y);
        
        int sum=0;
        for(int i=1; i<=h; i++){
            for(int j=1; j<=w; j++){
                if(field[i][j]==-1){
                    sum++;
                }
            }
        }
        cout<<sum<<endl;
    }
}