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 <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
	#define dump(x)  cerr << #x << " = " << (x) << endl;
#else
	#define dump(x)  ;
#endif

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back

//#define int long long

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

template <typename T>
std::string printVector(const std::vector<T> &data)
{
    std::stringstream ss;
    std::ostream_iterator<T> out_it(ss, ", ");
    ss << "[";
    std::copy(data.begin(), data.end() - 1, out_it);
    ss << data.back() << "]";
    return ss.str();
}

const int MOD = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;

signed main(int argc, char const *argv[])
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(1){
        int H,W; cin >> W >> H;
        if(H == 0 && W == 0) break;

        int visited[30][30] = {};
        int masu[30][30] = {};
        queue<PII> que;
        int ans = 0;
        int dx[] = {0,0,-1,1};
        int dy[] = {-1,1,0,0};
        REP(i,H){
            string S; cin >> S;
            REP(j,W){
                if(S[j] == '.') masu[i][j] = 1;
                else if(S[j] == '#') masu[i][j] = 2;
                else{
                    que.push(PII(i,j));
                    visited[i][j] = 1;
                    ans++;
                }
            }
        }
        while(!que.empty()){
            auto p = que.front(); que.pop();
            int nx = p.first;
            int ny = p.second;
            REP(i,4){
                int x = nx + dx[i];
                int y = ny + dy[i];
                if(0 <= x && x < H && 0 <= y && y <= W && masu[x][y] == 1 && visited[x][y] == 0){
                    que.push(PII(x,y));
                    visited[x][y] = 1;
                    ans++;
                }
            }
        }
        cout << ans << endl;
    }

}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <utility>
using namespace std;
#define MOD 1000000007
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec; typedef pair<int, int> pi;
int dd[] = { 0, 1, 0, -1, 0 };


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

		char C[30][30];
		int B[30][30];

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

		queue<pi> Q;
		Q.push(pi(sy, sx));
		B[sy][sx] = 1;
		int ans = 1;
		while (!Q.empty())
		{
			int ty = Q.front().first; int tx = Q.front().second;
			Q.pop();

			for (int r = 0; r < 4; r++)
			{
				int y = ty + dd[r];
				int x = tx + dd[r + 1];
				if (y < 0 || y >= H || x < 0 || x >= W)continue;
				if (C[y][x] == '#')continue;
				if (B[y][x])continue;
				ans++;
				B[y][x] = 1;
				Q.push(pi(y, x));
			}
		}

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

C++: #include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <utility>

using namespace std;

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

int main(){
    int w, h;
    while(cin >> w >> h && w > 0 && h > 0){
        string tmp;
        pair<int, int> init;
        vector<vector <int> > grid(25, vector<int>(25, -1));
        vector<vector <int> > visited(25, vector<int>(25, 0));
        for(int i = 0; i < h; i++){
            cin >> tmp;
            for (int j = 0; j < w; j++){
                if(tmp[j] == '.'){
                    grid[i][j] = 0;
                }else if(tmp[j] == '#'){
                    grid[i][j] = -1;
                }else if(tmp[j] == '@'){
                    grid[i][j] = 0;
                    init = make_pair(i, j);
                }
            }
        }
        queue<pair<int, int> > Q;
        Q.push(init);
        visited[init.first][init.second] = 1; 
        while(!Q.empty()){
            pair<int, int> cur = Q.front(); 
            Q.pop();
            int cur_x = cur.first;
            int cur_y = cur.second;
            for(int i = 0; i < 4; i++){
                pair<int, int> dst = make_pair(cur_x + dx[i], cur_y + dy[i]);
                int x = dst.first;
                int y = dst.second;
                if(0 <= x && 0 <= y && grid[x][y] == 0 && visited[x][y] == 0){
                    Q.push(dst);
                    visited[x][y] = 1;
                }
            }
        }
        int ans = 0;
        for(int i = 0; i < h; i++){
            for (int j = 0; j < w; j++){
                ans += visited[i][j];
            }
        }
        cout << ans << endl;
    }
}