Go: package main

import (
	"fmt"
	"math"
)

type Position struct {
	X int64
	Y int64
}

func (one Position) Distance(another Position) int64 {
	return int64(math.Abs(float64(one.X-another.X)) + math.Abs(float64(one.Y-another.Y)))
}

type PersonPosition struct {
	Takayuki Position
	Kazuyuki Position
}

func (one PersonPosition) Distance() int64 {
	return one.Takayuki.Distance(one.Kazuyuki)
}

type Status struct {
	Person PersonPosition
	Turn   int64
}

type PQStatus []*Status

func (pq PQStatus) Len() int {
	return len(pq)
}
func (pq PQStatus) Less(i, j int) bool {
	if pq[i].Turn == pq[j].Turn {
		return pq[i].Person.Distance() < pq[j].Person.Distance()
	}
	return pq[i].Turn < pq[j].Turn
}

func (pq PQStatus) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PQStatus) Push(x interface{}) {
	item := x.(*Status)
	*pq = append(*pq, item)
}

func (pq *PQStatus) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	*pq = old[0 : n-1]
	return item
}

func solve(h, w int64) {
	var tx, ty, kx, ky int64
	fmt.Scan(&tx, &ty, &kx, &ky)
	tx--
	ty--
	kx--
	ky--
	m := make([][]int64, h)
	for i := range m {
		m[i] = make([]int64, w)
		for j := int64(0); j < w; j++ {
			fmt.Scan(&m[i][j])
		}
	}
	start := &Status{Person: PersonPosition{Takayuki: Position{X: tx, Y: ty}, Kazuyuki: Position{X: kx, Y: ky}}, Turn: 0}
	pq := make(PQStatus, 0)
	//heap.Init(&pq)
	//heap.Push(&pq, start)
	pq.Push(start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		now := pq.Pop().(*Status)
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			continue
		}
		if ans<=now.Turn {
			continue
		}
		memo[now.Person] = now.Turn
		for i := 0; i < 4; i++ {
			next := &Status{}
			*next = *now
			next.Person.Kazuyuki.X += dx[i]
			next.Person.Kazuyuki.Y += dy[i]
			if next.Person.Kazuyuki.X < 0 || next.Person.Kazuyuki.X >= w ||
				next.Person.Kazuyuki.Y < 0 || next.Person.Kazuyuki.Y >= h ||
				m[next.Person.Kazuyuki.Y][next.Person.Kazuyuki.X] == 1 {
				next.Person.Kazuyuki.X -= dx[i]
				next.Person.Kazuyuki.Y -= dy[i]
			}
			next.Person.Takayuki.X -= dx[i]
			next.Person.Takayuki.Y -= dy[i]
			if next.Person.Takayuki.X < 0 || next.Person.Takayuki.X >= w ||
				next.Person.Takayuki.Y < 0 || next.Person.Takayuki.Y >= h ||
				m[next.Person.Takayuki.Y][next.Person.Takayuki.X] == 1 {
				next.Person.Takayuki.X += dx[i]
				next.Person.Takayuki.Y += dy[i]
			}
			next.Turn += 1
			if next.Turn < 100 {
				//heap.Push(&pq, next)
				pq.Push(next)
			}
		}
	}
	if ans == 101 {
		fmt.Println("NA")
	} else {
		fmt.Println(ans)
	}
}

func main() {
	var h, w int64
	for {
		fmt.Scan(&h, &w)
		if h == 0 && w == 0 {
			break
		}
		solve(h, w)
	}
}

C++: #include<iostream>
#include<utility>
#include<queue>
#include<map>
using namespace std;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int main() {
	int W, H, tx, ty, kx, ky;
	bool d[52][52];
	map<pair<pair<int, int>, pair<int, int> >,bool> m;
	pair<pair<int, int>, pair<int, int> >num;
	pair<pair<int, int>, pair<int, int> >copy;
	while (true) {
		cin >> W >> H;
		if (W == 0)break;
		for (int i = 0; i < H+2; i++) {
			for (int j = 0; j < W+2; j++) {
				d[i][j] = 1;
			}
		}
		cin >> tx >> ty >> kx >> ky;
		for (int i = 1; i < H + 1; i++) {
			for (int j = 1; j < W + 1; j++) {
				cin >> d[j][i];
			}
		}
		num.first.first = tx;
		num.first.second = ty;
		num.second.first = kx;
		num.second.second = ky;
		queue<pair<pair<int, int>, pair<int, int> > > q;
		q.push(num);
		int qsize = q.size();
		int loopcount = 0;
		while (!q.empty()) {
			num = q.front();
			q.pop();
			if (qsize == 0) {
				qsize = q.size()+1;
				loopcount++;
				if (loopcount >= 100) {
					cout << "NA" << endl;
					break;
				}
			}
			qsize--;
			if (num.first.first == num.second.first && num.first.second == num.second.second) {
				cout << loopcount << endl;
				break;
			}
			for (int i = 0; i < 4; i++) {
				if (!d[num.first.first + dx[i]][num.first.second + dy[i]]) {
					copy.first.first = num.first.first + dx[i];
					copy.first.second = num.first.second + dy[i];
				}
				if (!d[num.second.first - dx[i]][num.second.second - dy[i]]) {
					copy.second.first = num.second.first - dx[i];
					copy.second.second = num.second.second - dy[i];
				}
				if (!m[copy]) {
					m[copy] = true;
					q.push(copy);
				}
			}
			if (q.empty()) {
				cout << "NA" << endl;
			}
		}
	}
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct Data{
	int x1,y1,x2,y2,cnt;
	Data(){}
	Data(int x1,int y1,int x2,int y2,int cnt):
		x1(x1),y1(y1),x2(x2),y2(y2),cnt(cnt){}
};
bool memo[50][50][50][50];
int dx[] = {0,1,-1,0}, dy[] = {1,0,0,-1};
int main() {
	int x,y;
	while(scanf("%d%d",&x,&y),(x|y)) {
		int tx,ty;
		int kx,ky;
		scanf("%d%d",&tx,&ty);
		scanf("%d%d",&kx,&ky);
		tx--;ty--;kx--;ky--;
		int stage[51][51];
		for(int i = 0; i < y; i++) {
			for(int j = 0; j < x; j++) {
				scanf("%d",&stage[i][j]);
			}
		}
		memset(memo,0,sizeof(memo));
		queue<Data> Q;
		Q.push(Data(tx,ty,kx,ky,0));
		int ans = -1;
		while(!Q.empty()) {
			Data d = Q.front();Q.pop();
			if(d.cnt >= 100) break;
			if(d.x1 == d.x2 && d.y1 == d.y2) {
				ans = d.cnt;
				break;
			}
			if(memo[d.x1][d.y1][d.x2][d.y2]) continue;
			memo[d.x1][d.y1][d.x2][d.y2] = true;
			for(int i = 0; i < 4; i++) {
				bool flg1 = false,flg2 = false;
				int nx1 = dx[i] + d.x1, ny1 = dy[i] + d.y1;
				int nx2 = dx[3-i] + d.x2, ny2 = dy[3-i] + d.y2;
				if(nx1 < 0 || nx1 >= x || ny1 < 0 || ny1 >= y || stage[ny1][nx1] == 1) flg1 = true;
				if(nx2 < 0 || nx2 >= x || ny2 < 0 || ny2 >= y || stage[ny2][nx2] == 1) flg2 = true;
				if(!(flg1 | flg2)) {
					Q.push(Data(nx1,ny1,nx2,ny2,d.cnt + 1));
				}
				if(!flg1 && flg2) {
					Q.push(Data(nx1,ny1,d.x2,d.y2,d.cnt+1));
				}
				if(flg1 && !flg2) {
					Q.push(Data(d.x1,d.y1,nx2,ny2,d.cnt+1));
				}
			}
		}
		if(ans == -1) puts("NA");
		else printf("%d\n",ans);
	}
	return 0;
}