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;

template<typename T>
class UF
{
public:
	UF()
	{
		count = 0;
	}

	void push(T a)
	{
		M[a] = count;
		V.push_back(count);
		rank.push_back(0);
		count++;
	}

	void unite(T a , T b)
	{
		long long int x = find(M[a]);
		long long int y = find(M[b]);
		if(x == y)return;
		if(rank[x] < rank[y])
		{
			V[x] = y;
		} else
		{
			V[y] = x;
			if(rank[x] == rank[y])rank[x]++;
		}
	}
	void merge(T a , T b)
	{
		unite(a , b);
	}
	bool same(T a , T b)
	{
		return find(M[a]) == find(M[b]);
	}
	long long int group()
	{
		set<long long int>S;
		for(long long int i = 0; i < V.size(); i++)
		{
			S.insert(find(V[i]));
		}
		return S.size();
	}

private:
	vector<long long int> V , rank;
	map < T , long long int>M;
	long long int count;

	long long int find(long long int x)
	{
		if(V[x] == x)return x;
		else return V[x] = find(V[x]);
	}
};

int main()
{
	int W , H;
	while(cin >> W >> H , W || H)
	{
		vector<vector<char>>VVC(H , vector<char>(W));
		UF<pair<int , int>>UFP;
		pair<int,int>at;
		for(size_t i = 0; i < H; i++)
		{
			for(size_t j = 0; j < W; j++)
			{
				cin >> VVC[i][j];
				UFP.push(make_pair(i , j));
				if(VVC[i][j]=='@')
				{
					at=make_pair(i,j);
				}
				if(VVC[i][j] != '#')
				{
					if(i != 0)
					{
						if(VVC[i - 1][j] != '#')
						{
							UFP.merge(make_pair(i , j) , make_pair(i - 1 , j));
						}
					}
					if(j != 0)
					{
						if(VVC[i][j - 1] != '#')
						{
							UFP.merge(make_pair(i , j) , make_pair(i , j - 1));
						}
					}
				}

			}
		}
		int ans=0;
		for(size_t i = 0; i < H; i++)
		{
			for(size_t j = 0; j < W; j++)
			{
				if(UFP.same(at,make_pair(i,j)))
				{
					ans++;
				}
			}
		}
		cout<<ans<<endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,a) for(int i=0;i<(a);i++)
#define MOD 1000000007

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 <algorithm>
#include <stdlib.h>
#include <string>
#include <queue>
#include <map>
#include <stack>
using namespace std;

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


int main() {
int yoko,tate,px,py;
while(cin>>yoko>>tate &&yoko){

	int m[25][25];

string st;
cin>>yoko>>tate;
for(int i=1;i<tate+1;i++){
cin>>st;
for(int j=1;j<yoko+1;j++){
if(st[j-1]=='#') m[i][j]=-1;
else if(st[j-1]=='.') m[i][j]=0;
else if(st[j-1]=='@'){
 m[i][j]=1;
px=i;
py=j;
}
}
}
int ans=1;
stack<pair<int,int> > s;
s.push(make_pair(px,py));
//cout<<"pxpy "<<px<<" "<<py<<endl;
while(s.empty()==false){
px=s.top().first;
py=s.top().second;
s.pop();

for(int i=0;i<4;i++){
//cout<<px+dx[i]<<" "<<py+dy[i]<<endl;
	if(0<px+dx[i] && px+dx[i]<tate+1 && py+dy[i]>0 && py+dy[i]<yoko+1){
	
		if(m[px+dx[i]][py+dy[i]]==0){
			m[px+dx[i]][py+dy[i]]=1;
			s.push(make_pair(px+dx[i],py+dy[i]));
			ans++;
//cout<<px+dx[i]<<" "<<py+dy[i]<<" "<<ans<<endl;
		}

	}}
}

cout<<ans<<endl;

}



	return 0;
}

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

int main(){
  int H, W;
  while(scanf("%d%d", &W, &H)){
    if ((H == 0) && (W == 0)){
      break;
    }
    vector<vector<char> > m(H, vector<char>(W, ' '));
    pair<int,int> start(0,0);
    for (int i = 0; i < H; i++){
      for (int j = 0; j < W; j++){
        scanf(" %c", &(m[i][j]));
        if (m[i][j] == '@'){
          start.first = j;
          start.second = i;
	}
      }
    }
    set<pair<int,int> > q;
    set<pair<int,int> > already;
    q.insert(start);
    while(!q.empty()){
      pair<int,int> next = *(q.begin());
      q.erase(q.begin());
      if (already.find(next) == already.end()){
        already.insert(next);
        if ((next.first > 0) && (m[next.second][next.first-1] == '.')){
          q.insert(pair<int,int>(next.first-1, next.second));
	}
        if ((next.first < W-1) && (m[next.second][next.first+1] == '.')){
          q.insert(pair<int,int>(next.first+1, next.second));
	}
        if ((next.second > 0) && (m[next.second-1][next.first] == '.')){
          q.insert(pair<int,int>(next.first, next.second-1));
	}
        if ((next.second < H-1) && (m[next.second+1][next.first] == '.')){
          q.insert(pair<int,int>(next.first, next.second+1));
	}
      }
    }
    printf("%d\n", (int)already.size());
  }
  return 0;
}