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)
	pq = append(pq, 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)
		now := pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}

		if _, ok := memo[now.Person]; ok {
			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 <= 98 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				pq = append(pq, 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<stdio.h>

#include<queue>
#include<iostream>
#include<string.h>
using namespace std;
struct PP{
	int kx;
	int ky;
	int tx;
	int ty;
	int Z;
};
int A[52][52][52][52];
int main(){
	PP S;
	queue<PP> P;
	int  w,h;
	int d=0,i=0,j=0,l=-1,D[54][54];
	int tx[4]={ 1, 0,-1,0 };       
	int kx[4]={-1, 0, 1,0 };
	int ty[4]={ 0, 1, 0,-1 };
	int ky[4]={ 0, -1, 0,1};
	scanf("%d %d",&w,&h);
	while(w!=0||h!=0){
	memset(A,0,sizeof(A));
		for(i=0;i<=h+1;i++){
		for(j=0;j<=w+1;j++){
		D[i][j]=1;
		}
	}

	scanf("%d %d",&S.tx,&S.ty);
	scanf("%d %d",&S.kx,&S.ky);
	A[S.tx+1][S.ty+1][S.kx+1][S.ky+1]=1;
	for(i=1;i<=h;i++){
		for(j=1;j<=w;j++){
		scanf("%d",&D[i][j]);
		}
	}
	S.Z=0;
	P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			d=-1;
			printf("%d\n",S.Z);
		}
	while(d!=-1){
		l++;
		if(l==4){
		l=0;
		S=P.front();
		P.pop();
		if(P.empty()){
			printf("NA\n");
		break;
		}
		}
		S=P.front();
		
		S.tx=S.tx+tx[l];
		S.ty=S.ty+ty[l];
		S.kx=S.kx+kx[l];
		S.ky=S.ky+ky[l];
		if(A[S.tx+1][S.ty+1][S.kx+1][S.ky+1]==1){
			continue;
		}
		A[S.tx+1][S.ty+1][S.kx+1][S.ky+1]=1;

		if(D[S.ty+1][S.tx+1]==1){
		S.tx=S.tx-tx[l];
		S.ty=S.ty-ty[l];
		}
		if(D[S.ky+1][S.kx+1]==1){
		S.kx=S.kx-kx[l];
		S.ky=S.ky-ky[l];
		}
		S.Z++;
		P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			printf("%d\n",S.Z);
			break;
		}	
		if(S.Z==100){
			printf("NA\n");
		break;
		}
	}
	while(!P.empty()){
	P.pop();
	}
	l=-1;
	scanf("%d %d",&w,&h);
	}	
	return 0;
}

C++: #include<iostream>
#include<queue>
#include<map>
using namespace std;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
class state {
public:
	int tx;
	int ty;
	int kx;
	int ky;
	int time;
	bool operator < (const state &s)const {
		if (ty != s.ty)return ty < s.ty;
		if (tx != s.tx)return tx < s.tx;
		if (ky != s.ky)return ky < s.ky;
		if (kx != s.kx)return kx < s.kx;
		return false;
	}
};
int main() {
	int W, H, tx, ty, kx, ky;
	bool d[52][52];
	state num;
	state copy;
	while (true) {
		map<state, bool> m;
		queue<state> q;
		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.tx = tx;
		num.ty = ty;
		num.kx = kx;
		num.ky = ky;
		num.time = 0;
		q.push(num);
		while (!q.empty()) {
			num = q.front();
			q.pop();
			if (num.time == 100) {
				cout << "NA" << endl;
				break;
			}
			if (num.tx == num.kx && num.ty == num.ky) {
				cout << num.time << endl;
				break;
			}
			for (int i = 0; i < 4; i++) {
				copy = num;
				copy.time++;
				if (!d[num.tx + dx[i]][num.ty + dy[i]]) {
					copy.tx = num.tx + dx[i];
					copy.ty = num.ty + dy[i];
				}
				if (!d[num.kx - dx[i]][num.ky - dy[i]]) {
					copy.kx = num.kx - dx[i];
					copy.ky = num.ky - dy[i];
				}
				if (!m[copy]) {
					m[copy] = true;
					q.push(copy);
				}
			}
			if (q.empty()) {
				cout << "NA" << endl;
			}
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <queue>
#include <utility>
#include <set>
using namespace std;
typedef pair<int,int> P_;
typedef pair<P_,P_> _P;
typedef pair<_P,int> P;
int M[50][50];
int dx1[]={1,0,-1,0},dy1[]={0,1,0,-1};
int dx2[]={-1,0,1,0},dy2[]={0,-1,0,1};
int main() {
	int X,Y;
	while(scanf("%d %d",&X,&Y),X) {
		int tx,ty,kx,ky;
		scanf("%d %d %d %d",&tx,&ty,&kx,&ky);
		tx--;ty--;kx--;ky--;
		for(int y=0;y<Y;y++) {
			for(int x=0;x<X;x++) {
				scanf("%d",&M[x][y]);
			}
		}
		set<_P> ST;
		ST.insert(_P(P_(tx,ty),P_(kx,ky)));
		queue<P> Q;
		Q.push(P(_P(P_(tx,ty),P_(kx,ky)),0));
		bool OK=false;
		while(!Q.empty()) {
			P p=Q.front();Q.pop();
			P_ T=p.first.first,K=p.first.second;
			if(p.second>=100)break;
			if(T.first==K.first&&T.second==K.second) {
					printf("%d\n",p.second);
					OK=true;
					break;
			}
			for(int i=0;i<4;i++) {
				int ntx=T.first+dx1[i],nty=T.second+dy1[i];
				int nkx=K.first+dx2[i],nky=K.second+dy2[i];
				if(0>ntx||ntx>=X||0>nty||nty>=Y||M[ntx][nty])
					ntx=T.first,nty=T.second;
				if(0>nkx||nkx>=X||0>nky||nky>=Y||M[nkx][nky])
					nkx=K.first,nky=K.second;
				if(ST.find(_P(P_(ntx,nty),P_(nkx,nky)))==ST.end()) {
					ST.insert(_P(P_(ntx,nty),P_(nkx,nky)));
					Q.push(P(_P(P_(ntx,nty),P_(nkx,nky)),p.second+1));
				}
			}
		}
		if(!OK)printf("NA\n");
	}
}