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 <cstdio>
#include <cmath>
#include <vector>
#include <cctype>
#include <algorithm>
#include <string>
#include <queue>
#include <cstring>
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 && 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 (1){
	scanf("%d %d", &w, &h);
	if (w == 0 && h == 0) break;
	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);
	printf("%d\n", tile);
    }
    
    return 0;
}

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

#define rep(i,n) for(int i=0; i<n; i++)

std::string field[20];
int dx[4] = {0,-1,0,1};	//右、上、左、下
int dy[4] = {1,0,-1,0};
int h,w;
int cnt;
void rec(int y,int x){
	field[y][x] = '#';
	cnt++;
	int xi, yi;
	rep(i,4){
		xi = x, yi = y;
		xi += dx[i];
		yi += dy[i];

		if(xi < 0 || xi >= w)continue;
		if(yi < 0 || yi >= h)continue;
		if(field[yi][xi] != '.')continue;
		rec(yi,xi);
	}
}

int main(){

	while(std::cin >> w >> h, (h||w)){

		cnt = 0;

		rep(i,h){
			std::cin >> field[i];
		}
		rep(i,h){
			rep(j,w){
				if(field[i][j] == '@'){
					rec(i,j);
				}
			}
		}
		std::cout << cnt << std::endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;

char field[30][30];
int w, h;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

void init() {
  REP(i, w) {
    REP(j, h) {
      field[i][j] = '?';
    }
  }
}

void trample(int x, int y) {
  if (x < 0 or w <= x or 
      y < 0 or h <= y or 
      field[x][y] != '@') {
    return;
  }

  REP(d, 4) {
    int nx = x + dx[d], ny = y + dy[d];
    if (field[nx][ny] == '.') {
      field[nx][ny] = '@';
      trample(nx, ny);
    }
  }
}

int main() {
  while (cin >> w >> h and w) {
    int sx, sy;
    init();
    REP(y, h) {
      string row;
      cin >> row;
      REP(x, w) {
        field[x][y] = row[x];
        if (row[x] == '@') {
          sx = x, sy = y;
        }
      }
    }

    trample(sx, sy);

    int accessible = 0;
    REP(y, h) {
      REP(x, w) {
        if (field[x][y] == '@') {
          accessible++;
        }
      }
    }
    cout << accessible << endl;
  }
}

C++: import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		while (true) {
			int w = 1;
			int h = 1;
			int moveCan = 0;

			w = scan.nextInt();
			h = scan.nextInt();

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

			char[][] table = new char[h][w];
			// int[][] num = new int[h][w];

			for (int i = 0; i < h; i++) {
				// for (int j = 0; j < w; j++) {
				table[i]/* [j] */= scan.next().toCharArray();
				// }
			}

			moveCan = AtCheck(table, w, h);
			System.out.println(moveCan);
		}

		scan.close();
	}

	public static int AtCheck(char table[][], int w, int h) {
		int befAtNum = 0;
		int aftAtNum = 0;

		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@')
					befAtNum++;
			}
		}

		int[][] atPlace = new int[h][w];
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@') {
					atPlace[i][j] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i - 1][j - 1]=='.')
					// atPlace[i - 1][j - 1] = 1;
					if (j != 0 && table[i][j - 1] == '.')
						atPlace[i][j - 1] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i + 1][j - 1]=='.')
					// atPlace[i + 1][j - 1] = 1;
					if (i != 0 && table[i - 1][j] == '.')
						atPlace[i - 1][j] = 1;
					if (i != (h - 1) && table[i + 1][j] == '.')
						atPlace[i + 1][j] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i - 1][j + 1]=='.')
					// atPlace[i - 1][j + 1] = 1;
					if (j != (w - 1) && table[i][j + 1] == '.')
						atPlace[i][j + 1] = 1;
					// if (i != (h - 1) && j != (w - 1) && i != 0 && j != 0
					// && table[i + 1][j + 1]=='.')
					// atPlace[i + 1][j + 1] = 1;
				}
			}
		}

		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (atPlace[i][j] == 1)
					table[i][j] = '@';
			}
		}
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				if (table[i][j] == '@')
					aftAtNum++;
			}
		}
		if (befAtNum != aftAtNum) {
			return AtCheck(table, w, h);
		} else {
			return aftAtNum;
		}
	}

}

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

using namespace std;

int w,h;
int sum;
vector<string> tile(20);

void search(int x,int y);

int main(){

  int now_x,now_y;
  
  while(1){

	sum=0;
	cin>>w>>h;

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

	tile.clear();

	for(int i=0;i<h;++i)
	  cin>>tile[i];
		
	for(int i=0;i<h;++i){
	  for(int j=0;j<w;++j){
		if(tile[i][j]=='@'){
		  now_x=j;
		  now_y=i;
		  break;
		}
	  }
	}
	
	search(now_x,now_y);
	cout<<sum<<endl;
	
  }

  return 0;
  
}
  
void search(int x,int y){

  int i;
  tile[y][x]='#';
  sum++;
  
  if(x+1 < w){
	if(tile[y][x+1]=='.')
	  search(x+1,y);
  }
  
  if(x-1 >= 0){
	if(tile[y][x-1]=='.')
	  search(x-1,y);
  }
  
  if(y+1 < h){
	if(tile[y+1][x]=='.')
	  search(x,y+1);
  }
  
  if(y-1 >= 0){
	if(tile[y-1][x]=='.')
	  search(x,y-1);
  }
  
}