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(102)
	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++
			if next.Turn <= 100 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		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<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() {
	while (true) {
		int W, H;
		cin >> W >> H;
		if (W == 0 && H == 0)
			break;
		bool d[52][52];
		for (int i = 0; i < H + 2; i++) {
			for (int j = 0; j < W + 2; j++) {
				d[i][j] = 1;
			}
		}
		state num;
		cin >> num.tx >> num.ty >> num.kx >> num.ky;
		for (int i = 1; i < H + 1; i++) {
			for (int j = 1; j < W + 1; j++) {
				cin >> d[j][i];
			}
		}
		num.time = 0;
		queue<state> q;
		q.push(num);
		map<state, bool> m;
		m[num] = true;
		while (true) {
			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++) {
				state copy;
				copy.tx = num.tx + dx[i];
				copy.ty = num.ty + dy[i];
				copy.kx = num.kx - dx[i];
				copy.ky = num.ky - dy[i];
				if (d[copy.ty][copy.tx]) {
					copy.tx = num.tx;
					copy.ty = num.ty;
				}
				if (d[copy.ky][copy.kx]) {
					copy.kx = num.kx;
					copy.ky = num.ky;
				}
				if (m.find(copy)==m.end()) {
					copy.time = num.time + 1;
					q.push(copy);
					m[copy] = true;
				}
			}
			if (q.empty()) {
				cout << "NA" << endl;
				break;
			}
		}
	}
	return 0;
}

C++: 
#include<cstdio>
#include <queue>
#include <utility>
#include <cstring>
#include <vector>

using namespace std;

int brd[55][55];
int inpb[55][55];
int ta,yo,x1,x2,y1,y2,i,j;
int tyux,tyuy;

/*
typedef struct{
int xx;
int yy;
}zah;
*/
typedef pair<int,int> zah;
typedef pair<int,zah> mp;

int muki[4][2]={
	{1,0},
	{0,1},
	{-1,0},
	{0,-1}
};


int main(void){

while(1){
scanf("%d%d",&yo,&ta);
if(yo==0)break;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
memset(inpb,-1,sizeof(inpb));
memset(brd,-1,sizeof(brd));
for(i=1;i<=yo;i++){
for(j=1;j<=ta;j++){
scanf("%d",&(inpb[i][j]));
brd[i][j]=inpb[i][j];
}
}


if(x1%2!=x2%2 || y1%2!=y2%2){
printf("NA\n");
continue;
}
tyux=(x1+x2)/2;
tyuy=(y1+y2)/2;

int x,y;
for(i=1;i<=yo;i++){
for(j=1;j<=ta;j++){
x=tyux*2-i;y=tyuy*2-j;
if(x>0 && x<=yo && y>0 && y<=ta){
if(brd[x][y]==0){
brd[x][y]=inpb[i][j];
}
}
}
}

mp pa,pb;
pa.first=0;
pa.second.first=x1;
pa.second.second=y1;
priority_queue<mp,vector<mp>,greater<mp> > qu;

qu.push(pa);

int bol[55][55]={};
bol[x1][y1]=1;
int cl=0;
while(!qu.empty()){
	pa=qu.top();
	qu.pop();
	if(pa.first>=100){
		break;
	}
	if(pa.second.first==tyux && pa.second.second==tyuy){
		printf("%d\n",pa.first);
		cl=1;
		break;
	}
	for(i=0;i<4;i++){
		x=pa.second.first+muki[i][0];
		y=pa.second.second+muki[i][1];
		if(brd[x][y]==0 && bol[x1][y1]==0){
			bol[x][y]=1;
			pb.first=pa.first+1;
			pb.second.first=x;
			pb.second.second=y;
			qu.push(pb);
		}
	}
}
if(cl==0){
	printf("NA\n");
}
}
return 0;
}

C++: #include <iostream>
using namespace std;
int DP[52][52][52][52];
int map[52][52]={};
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
const int INF=2<<20;
int search(int tx,int ty,int kx,int ky,int times){
	
	int minim=INF;
	
	if(tx==kx && ty==ky)
		return 0;
	if(DP[tx][ty][kx][ky]!=-1)
	return DP[tx][ty][kx][ky];
	DP[tx][ty][kx][ky]=INF;
	for(int i=0;i<4;i++){
		int ttx=tx,tty=ty,kkx=kx,kky=ky;
		if(!map[tx+dx[i]][ty+dy[i]]){
			ttx+=dx[i];
			tty+=dy[i];
		}
		if(!map[kx-dx[i]][ky-dy[i]]){
			kkx-=dx[i];
			kky-=dy[i];
		}
	minim=min(minim,search(ttx,tty,kkx,kky,times+1));
			
	}
//	if(tx==3 && ty==3)
//	cout << tx <<" " <<  ty <<" " <<  kx << " " <<  ky <<  " " << minim << endl;
	DP[tx][ty][kx][ky]=minim+1;
	return DP[tx][ty][kx][ky];
}
int main() {
	// your code goes here
	int x,y,tx,ty,kx,ky,ans;
	while(cin >> x >> y && x!=0){
		for(int i=0;i<52;i++)
			for(int j=0;j<52;j++)
				for(int k=0;k<52;k++)
					for(int l=0;l<52;l++)
						DP[i][j][k][l]=-1;
		for(int i=0;i<52;i++){
		map[i][0]=1;
		map[i][y+1]=1;
		map[0][i]=1;
		map[x+1][i]=1;
		}
		cin >> tx >> ty >> kx >> ky;
		for(int i=1;i<=y;i++)
			for(int j=1;j<=x;j++)
				cin >> map[j][i];
		ans=search(tx,ty,kx,ky,0);
	
	if(ans>=100)
	cout << "NA" << endl;
	else 
	cout << ans << endl;
	
	}
	return 0;
}