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 <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)

typedef pair<int, int> Pi;
#define fi first
#define se second

int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};

signed main()
{
  int W, H;
  char mas[25][25];
  
  
  
  while(cin >> W >> H, W || H) {
    queue < Pi > que;
    int ans = 1;
    Rep(i, H) Rep(j, W) {
      cin >> mas[i][j];
      if(mas[i][j] == '@') {
	que.push(Pi(i, j));
	mas[i][j] = '#';
      }
      
    }

    while(!que.empty()) {
      Pi d = que.front(); que.pop();
      int y = d.fi, x = d.se;

      Rep(i, 4) {
	int ny = y + my[i], nx = x + mx[i];
	if(ny < 0 || nx < 0 || ny >= H || nx >= W || mas[ny][nx] == '#') continue;
	ans++, mas[ny][nx] = '#';
	que.push(Pi(ny, nx));
      }
    }

    cout << ans << endl;
  }
  
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
const ll INF=1e18;

vin dx={-1,0,1,0};
vin dy={0,1,0,-1};
int w,h;

int dfs(vvch &c,int x,int y,int &res){
    c[y][x]='?';
    int nx,ny;
    rep(i,4){
        nx=x+dx[i];
        ny=y+dy[i];
        if(0<=nx&&nx<w&&0<=ny&&ny<h&&c[ny][nx]=='.'){
            res++;
            dfs(c,nx,ny,res);
        }
    }
    return res;
}

int main(){
    queue<int> ans;int res;
    while(1){
        cin>>w>>h;
        if(w==0)break;
        vvch c(h,vch(w));int sx,sy;
        rep(i,h)rep(j,w){
            cin>>c[i][j];
            if(c[i][j]=='@'){
                sx=j;
                sy=i;
            }
        }
        res=1;
        ans.push(dfs(c,sx,sy,res));
    }
    while(ans.size()){
        cout<<ans.front()<<endl;
        ans.pop();
    }
}

C++: #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>

int main(){
  while(1){
    int h,w;
    cin>>w>>h;
    if(h==0&&w==0) break;
    char a[h][w];
    queue<pair<int,int>> q;
    bool used[h][w];
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        cin>>a[i][j];
        used[i][j]=0;
        if(a[i][j]=='@') q.push(make_pair(i,j));
      }
    }
    int ans=0;
    while(!q.empty()){
      pair<int,int> p=q.front();
      q.pop();
      int x=p.first, y=p.second;
      if(used[x][y]) continue;
      used[x][y]=1;
      ans++;
      if(x>0){
        if(!used[x-1][y]&&a[x-1][y]=='.'){
          q.push(make_pair(x-1,y));
        }
      }
      if(x<h-1){
        if(!used[x+1][y]&&a[x+1][y]=='.'){
          q.push(make_pair(x+1,y));
        }
      }
      if(y>0){
        if(!used[x][y-1]&&a[x][y-1]=='.'){
          q.push(make_pair(x,y-1));
        }
      }
      if(y<w-1){
        if(!used[x][y+1]&&a[x][y+1]=='.'){
          q.push(make_pair(x,y+1));
        }
      }
    }
    cout<<ans<<endl;
  }
  return 0;
}

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

char map[20][20];
int W, H;
int sh, sw;
int dw[4] = {-1, 0, 1, 0};
int dh[4] = {0, 1, 0, -1};
int cnt;

void print_map(){
  for(int i = 0; i < H; i++){
    for(int j = 0; j < W; j++){
      cout << map[i][j];
    }
    cout << endl;
  }
}

void solve(int w, int h){
  map[h][w] = '#';
  cnt++;
  for(int i = 0; i < 4; i++){
    int nh = h + dh[i], nw = w + dw[i];
    if(0 <= nh && nh < H && 0 <= nw && nw < W && map[nh][nw] == '.') solve(nw, nh);
  }
  return;
}

int main(void){
  while(true){
    cin >> W >> H;
    if(W == 0 && H == 0) break;
    cnt = 0;
    for(int i = 0; i < H; i++){
      for(int j = 0; j < W; j++){
        cin >> map[i][j];
        if(map[i][j] == '@'){
          sh = i;
          sw = j;
        }
      }
    }
    solve(sw, sh);
    cout << cnt << endl;
  }
  return 0;
}

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

char a[20][20];
int w,h,cx,cy,count=1;

void check(int x,int y){
  if (a[y][x]=='.'){
    count ++;
    a[y][x]='*';
    if (x>0) check(x-1,y);
    if (x<w-1) check(x+1,y);
    if (y>0) check(x,y-1);
    if (y<h-1) check(x,y+1);
  }
}

int main(){
  cin >> w >> h;
  while (w!=0||h!=0){
    for (int i=0;i<h;i++){
      for (int j=0;j<w;j++){
	cin >> a[i][j];
	if (a[i][j]=='@'){
	  cx=j;
	  cy=i;
	}
      }
    }

    if (cx>0) check(cx-1,cy);
    if (cx<w-1) check(cx+1,cy);
    if (cy>0) check(cx,cy-1);
    if (cy<h-1) check(cx,cy+1);
    
    cout << count << endl;
    count =1;
    cin >> w >> h;
  }
  return 0;
}

C++: 

#include<bits/stdc++.h>
using namespace std;

struct UnionFind {
  vector< int > data;
  UnionFind(int sz) {
    data.assign(sz, -1);
  }
  int Size(int x) {
    return(-data[x]);
  }
  int Find(int k) {
    return(k < 0 ? k : data[k] = Find(data[k]));
  }
  void Unite(int a, int b) {
    a = Find(a), b = Find(b);
    if(a == b) return;
    data[a] += data[b];
    data[b] = a;
  }
};

int main() {
  int W, H;
  while(cin >> W >> H, W) {
    string mas[50];
    for(int i = 0; i < H; i++) cin >> mas[i];
    UnionFind uf(W * H);
    for(int i = 0; i < H; i++) {
      for(int j = 1; j < W; j++) {
        if(mas[i][j - 1] != '#' && mas[i][j] != '#') uf.Unite(i * W + j - 1, i * W + j);
      }
    }
    for(int i = 1; i < H; i++) {
      for(int j = 0; j < W; j++) {
        if(mas[i - 1][j] != '#' && mas[i][j] != '#') uf.Unite(i * W - W + j, i * W + j);
      }
    }
    for(int i = 0; i < H; i++) {
      for(int j = 0; j < W; j++) {
        if(mas[i][j] == '@') cout << uf.Size(i * W + j);
      }
    }
  }
}