Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

var (
	direction1 = [][]int{ // 奇数段目の移動方向
		{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {1, -1}, {1, 1},
	}
	direction2 = [][]int{ // 偶数段目の移動方向
		{-1, -1}, {0, -1}, {1, 0}, {0, 1}, {-1, 1}, {-1, 0},
	}
)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		m, _ := strconv.Atoi(buf[0])
		n, _ := strconv.Atoi(buf[1])
		if m == 0 && n == 0 {
			break
		}
		// initialize district_map
		/*
			district_map = [
				[-1, -1,  -1,  -1,  -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, -1,  -1,  -1,  -1]
			]
		*/
		district_map := make([][]int, n+2)
		for i := range district_map {
			district_map[i] = make([]int, m+2)
		}
		tmp1 := make([]int, m+2)
		for i := range tmp1 {
			tmp1[i] = -1
		}
		district_map[0] = tmp1
		district_map[n+1] = tmp1
		for i := 1; i < n+1; i++ {
			district_map[i] = make([]int, m+2)
			district_map[i][0] = -1
			district_map[i][m+1] = -1
			for j := 1; j < m+1; j++ {
				district_map[i][j] = INF
			}
		}

		scanner.Scan()
		s, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < s; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf_[0])
			y, _ := strconv.Atoi(buf_[1])
			Search(Point{x, y}, district_map, m, n)
		}
		ans := 0
		scanner.Scan()
		t, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < t; i++ {
			scanner.Scan()
			buf__ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf__[0])
			y, _ := strconv.Atoi(buf__[1])
			z := Count(Point{x, y}, district_map, m, n)
			ans = max(ans, z)
		}
		fmt.Println(ans)
	}
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

type Point struct {
	x, y int
}

type Entry struct {
	hop   int
	point Point
}

func Search(p Point, mp [][]int, m, n int) {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	mp[p.y][p.x] = 0
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					mp[ny][nx] = dist + 1
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
}

func Count(p Point, mp [][]int, m, n int) int {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	ans := 1
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					ans++
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
	return ans
}

C++: #include <iostream>
#include <sstream>
#include <fstream>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
using namespace std;

typedef pair <int, int> PII;
typedef PII Node;
typedef queue <Node> Queue;

typedef vector <int> VI;
typedef vector <VI> VVI;
typedef set<PII> SPII;

SPII V;

int w, h;
const int inf = 1<<24;
const int odx[6] = { 0, 1, 1, 1, 0, -1 };
const int ody[6] = { -1, -1, 0, 1, 1, 0 };
const int edx[6] = { -1, 0, 1, 0, -1, -1 };
const int edy[6] = { -1, -1, 0, 1, 1, 0 };

int bfs( VVI& M, int X, int Y ) {
    int answer = 0;
    Queue Q;
    Node start( X, Y );
    Q.push( start );
    M[Y][X] = 0;
    while ( !Q.empty() ) {
        Node node = Q.front();
        Q.pop();

        int x = node.first;
        int y = node.second;
        if ( V.find( PII( x, y ) ) == V.end() ) answer++;

        for ( int i = 0; i < 6; i++ ) {
            int nx = x + ( y%2==0 ? edx[i] : odx[i] );
            int ny = y + ( y%2==0 ? edy[i] : ody[i] );
            if ( nx < 0 || nx >= w || ny < 0 || ny >= h ) continue;
            if ( M[y][x] + 1 >= M[ny][nx] ) continue;
            M[ny][nx] = M[y][x] + 1;
            Node nnode( nx, ny );
            Q.push( nnode );
        }
    }
    return answer;
}

int main() {
    while ( cin >> w >> h ) {
        V.clear();
        VVI M( h+1, VI( w+1, inf ) );

        int s;
        cin >> s;
        for ( int i = 0; i < s; i++ ) {
            int x, y;
            cin >> x >> y;
            x--;
            y--;
            V.insert(PII(x,y));
            bfs( M, x, y );
        }

        int answer = 0;
        VVI backup = M;
        int t;
        cin >> t;
        for ( int i = 0; i < t; i++ ) {
            M = backup;
            int x, y;
            cin >> x >> y;
            x--;
            y--;
            answer = max( answer, bfs( M, x, y ) );
        }

        cout << answer << endl;
    }
    return 0;
}

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

struct NODE{
	int x,y,c,num;
	NODE(int x,int y,int c) : x(x) , y(y) , c(c) {}
	NODE(int x,int y,int c,int num) : x(x) , y(y) , c(c) , num(num) {}
};
int W,H;

int doit(vector<NODE> v){
	queue<NODE> Q;
	for(int i = 0 ; i < v.size() ; i++){
		Q.push(NODE(v[i].x,v[i].y,0,i));
	}
	int cnt[100][100]={};
	int ans[100][100];
	for(int i = 0 ; i < 100 ; i++)
		for(int j = 0 ; j < 100 ; j++)
			ans[i][j] = 1e9;
	
	// kore Shindoinen!!!!!!!!!!!!!
	// kore Shindoinen!!!!!!!!!!!!!
	// kore Shindoinen!!!!!!!!!!!!!
	int dx[2][6] = { {-1, 0, 1,-1,-1,0 } , {-1,0,0,1,1,1} };
	int dy[2][6] = { { 0, 1, 0, 1,-1,-1} , {0,1,-1,0,1,-1} };
	// kore Shindoinen!!!!!!!!!!!!!
	// kore Shindoinen!!!!!!!!!!!!!
	// kore Shindoinen!!!!!!!!!!!!!
	while(Q.size()){
		NODE q = Q.front(); Q.pop();
		if( q.x < 0 || q.y < 0 || q.x >= W || q.y >= H ) continue;
		if( ans[q.y][q.x] < q.c ) continue;
		if( ans[q.y][q.x] > 10000) {
			ans[q.y][q.x] = q.c;
			cnt[q.y][q.x] = (1<<q.num);
		}else if( ans[q.y][q.x] == q.c ){
			cnt[q.y][q.x] |= (1<<q.num);
			continue;
		}
		for(int i = 0 ; i < 6 ; i++){
			Q.push(NODE(q.x+dx[q.y%2][i],q.y+dy[q.y%2][i],q.c+1,q.num));
		}
	}
	
	int cntt = 0;
	for(int i = 0 ; i < H ; i++){
		for(int j = 0 ; j < W ; j++){
			//printf("%3d",cnt[i][j]);
			if( cnt[i][j] == (1<<(v.size()-1)) ){
				cntt++;
			}
		}
		//puts("");
	}
	return cntt;
	
}
int main(){

	while(cin >> W >> H && W){
		int s,N;
		cin >> s;
		vector<NODE> alr;
		for(int i = 0 ; i < s ; i++){
			int x,y;
			cin >> x >> y;
			x--,y--;
			alr.push_back(NODE(x,y,0));
		}
		cin >> N;
		int ans = 0;
		for(int i = 0 ; i < N ; i++){
			int x,y;
			cin >> x >> y;
			x--,y--;
			alr.push_back(NODE(x,y,0));
			ans = max( ans , doit(alr) );
			alr.pop_back();
		}
		
		cout << ans << endl;
		
		
	}
}