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>
#include <vector>
using namespace std;

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

int dfs(int x, int y, vector<vector<bool> >& canGo){
  if(!canGo[x][y]){ return 0; }

  int ans = 1;
  canGo[x][y] = false;
  for(int i = 0; i < 4; i++)
    ans += dfs(x + dx[i], y + dy[i], canGo);
  
  return ans;
}

int main(void){
  while(true){
    int w, h;
    cin >> w >> h;
    if(w == 0 && h == 0){ break; }

    char input;
    int sx, sy;
    vector<vector<bool> > canGo(h + 2, vector<bool>(w + 2, false));
    for(int i = 1; i <= h; i++){
      for(int j = 1; j <= w; j++){
        cin >> input;
        if(input == '.' || input == '@'){ canGo[i][j] = true; }
        if(input == '@'){
          sx = i;
          sy = j;
        }
      }
    }
    
    int ans = dfs(sx, sy, canGo);
    cout << ans << endl;
    
  }
  return 0;
}

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

int walking(vector<vector<char> > &walk, int a, int b, int &count){
	walk[a][b] = '#';
	
	if(walk[a-1][b] == '.'){
		count++;
		walking(walk, a-1, b, count);
	}

	if(walk[a][b-1] == '.'){
		count++;
		walking(walk, a, b-1, count);
	}

	if(walk[a+1][b] == '.'){
		count++;
		walking(walk, a+1, b, count);
	}

	if(walk[a][b+1] == '.'){
		count++;
		walking(walk, a, b+1, count);
	}

	return count;
}

int main(){
	while(1){
		int W, H, a=0, b=0, count=0;
		string str;
		vector<vector<char> > walk;

		cin>>W>>H;
		if((W == 0) && (H == 0))
			break;

		walk.resize(H+2);
		for(int i=0;i<H+2;i++){
			walk[i].resize(W+2);

			if((i == 0) || (i == H+1)){
				for(int j=0;j<W+2;j++)
					walk[i][j] = '#';
			}else{
				walk[i][0] = '#';
				walk[i][W+1] = '#';
			}
		}

		for(int i=1;i<=H;i++){
			cin>>str;
			
			for(int j=0;j<W;j++)
				walk[i][j+1] = str[j];
		}
		
		for(int i=1;i<=H;i++){
			for(int j=1;j<=W;j++){
				if(walk[i][j] == '@'){
					a = i;
					b = j;
					count++;
				}
			}
		}
		
		cout<<walking(walk, a, b, count)<<endl;
	}

	return 0;
}

C++: #include<iostream>
using namespace std;
typedef pair<int, int> pii;
pii dxdy[]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
char fld[21][21];
bool used[20][20];
int W, H;

int rec(int i, int j){

   if(fld[i][j]=='#') return 0;
   if(used[i][j]) return 0;
   used[i][j]=true;
   int ret=0;
   for(pii dd: dxdy){
      int ni=i+dd.first;
      int nj=j+dd.second;
      if(!(0<=ni&&ni<H&&0<=nj&&nj<W)) continue;
      ret+=rec(ni, nj);
   }

   return ret+1;
}

int main(){

   while(1){
      cin>> W>> H;
      if(!(H||W)) break;
      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;
               fld[i][j]='.';
            }
         }
      }

      for(int i=0; i<20; i++)for(int j=0; j<20; j++) used[i][j]=false;
      cout<< rec(sy, sx)<< endl;
   }

   return 0;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>

 
using namespace std;
 
#define INF 1000000000
#define EPS 1e-9
#define PI acos(-1)
 
typedef long long ll;

#define MAX_W 20
#define MAX_H 20
int W, H;
int sx, sy;
char maze[MAX_H][MAX_W];

vector<int> ans_list;

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

int solve(int x, int y){
  int tmp = 1;
  maze[y][x] = '#';
  for(int i = 0; i < 4; i++){
    int nx = x + dx[i];
    int ny = y + dy[i];
    if(nx >= 0 && nx < W && ny >= 0 && ny < H && maze[ny][nx] != '#'){
      tmp += solve(nx, ny);
    }
  }
  return tmp;
}

int main(){

  while(true){
    
    cin >> W >> H;
    if(W == 0 && H == 0)
      break;

    for(int i = 0; i < H; i++){
      for(int j = 0; j < W; j++){
	cin >> maze[i][j];
	if(maze[i][j] == '@'){
	  sy = i;
	  sx = j;
	}
      }
    }

    ans_list.push_back(solve(sx, sy));
    
  }

  for(int i = 0; i < ans_list.size(); i++){
    cout << ans_list[i] << endl;
  }

  return 0;

}

C++: #include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
 
const ll MOD=1e9+7;
const ll INF=1e18;
 
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};

int check[25][25];

int main(){
    while(1){
        int w,h;
        cin >> w >> h;
        if(w == 0 && h == 0) break;
        char tile[23][23];
        queue<P> black;
        int ans = 0;
        for(int i = 0;i < h;i++){
            cin >> tile[i];
            for(int j = 0;j < w;j++){
                check[i][j] = 0;
                if(tile[i][j] == '@'){
                    black.push(P(i,j));
                }
            }
        }
        while(!black.empty()){
            P q = black.front(); black.pop();
            if(check[q.fs][q.sc] != 0) continue;
            ans++;
            check[q.fs][q.sc] = 1;
            for(int i = 0;i < 4;i++){
                int ni = q.fs+dx[i];
                int nj = q.sc+dy[i];
                if( min(ni,nj) >= 0 && ni < h && nj < w && check[ni][nj] == 0 && tile[ni][nj] == '.'){
                    black.push(P(ni,nj));
                }
            }
        }
        cout << ans << endl;
    }
}