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 <= 100 {
				//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<iostream>
#include<queue>
#include<string.h>
using namespace std;
struct Y{
int hx,hy,rx,ry,tim;
};
int mp[52][52],c[52][52][52][52],vmp[52][52];
int main(){
int n,w,h,i,j,a[2]={1,-1},b[2],g,k;
Y e;
while(1){
queue<Y> q;
	g=0;
	k=0;
	cin>>w>>h;
	if(w==0&&h==0)break;
	cin>>e.hx>>e.hy>>e.rx>>e.ry;
	e.tim=0;
	q.push(e);
	memset(mp,0,sizeof(mp));
	memset(c,0,sizeof(c));
	memset(vmp,0,sizeof(vmp));
	for(i=0;i<=h+1;i++){
		mp[i][0]=1;
		mp[i][w+1]=1;
	}
	for(i=0;i<=w+1;i++){
		mp[0][i]=1;
		mp[h+1][i]=1;
	}
	for(i=1;i<=h;i++){
		for(j=1;j<=w;j++){
			cin>>mp[j][i];
			if(mp[j][i]==1)k++;
		}
	}
	while(1){
		e=q.front();
		q.pop();
		c[e.hy][e.hx][e.ry][e.rx]=4;
		if(vmp[e.hy][e.hx]==0){
			vmp[e.hy][e.hx]=1;
			g++;
		}
		if(vmp[e.ry][e.rx]==0){
			vmp[e.ry][e.rx]=1;
			g++;
		}
		if(e.tim>=100||e.hx==e.rx&&e.hy==e.ry||g==w*h-k)break;
		e.tim++;
		for(i=0;i<2;i++){
			if(mp[e.hy+a[i]][e.hx]!=1&&c[e.hy+a[i]][e.hx][e.ry-a[i]][e.rx]!=1&&mp[e.ry-a[i]][e.rx]!=1&&c[e.hy+a[i]][e.hx][e.ry-a[i]][e.rx]!=4||c[e.hy][e.hx][e.ry-a[i]][e.rx]!=3&&mp[e.ry-a[i]][e.rx]!=1&&c[e.hy][e.hx][e.ry-a[i]][e.rx]!=4||mp[e.hy+a[i]][e.hx]!=1&&c[e.hy+a[i]][e.hx][e.ry][e.rx]!=2&&c[e.hy+a[i]][e.hx][e.ry][e.rx]!=4){
				b[0]=0;																										
				b[1]=0;																																		
				if(mp[e.hy+a[i]][e.hx]!=1){																											
					e.hy+=a[i];																																			
					b[0]=1;																																					
				}																																													
				if(mp[e.ry-a[i]][e.rx]!=1){																																										
					e.ry-=a[i];																																		
					b[1]=1;																																																														
				}		
				if(b[0]==b[1])c[e.hy][e.hx][e.ry][e.rx]=1;
				else if(b[0]==1)c[e.hy][e.hx][e.ry][e.rx]=2;
				else c[e.hy][e.hx][e.ry][e.rx]=3;																																																																															
				if(vmp[e.hy][e.hx]==0){																												
					vmp[e.hy][e.hx]=1;																																	
					g++;																																									
				}																														
				if(vmp[e.ry][e.rx]==0){																																				
					vmp[e.ry][e.rx]=1;																																					
					g++;																																													
				}																																			
				q.push(e);																											
				if(b[0]==1)e.hy-=a[i];																														
				if(b[1]==1)e.ry+=a[i];																											
			}																																																												
			if(mp[e.hy][e.hx+a[i]]!=1&&mp[e.ry][e.rx-a[i]]!=1&&c[e.hy][e.hx+a[i]][e.ry][e.rx-a[i]]!=1&&c[e.hy][e.hx+a[i]][e.ry][e.rx-a[i]]!=4||mp[e.hy][e.hx+a[i]]!=1&&c[e.hy][e.hx+a[i]][e.ry][e.rx]!=2&&c[e.hy][e.hx+a[i]][e.ry][e.rx]!=4||mp[e.ry][e.rx-a[i]]!=1&&c[e.hy][e.hx][e.ry][e.rx-a[i]]!=3&&c[e.hy][e.hx][e.ry][e.rx-a[i]]!=4){
				b[0]=0;
				b[1]=0;
				if(mp[e.hy][e.hx+a[i]]!=1){
					e.hx+=a[i];
					b[0]=1;
				}
				if(mp[e.ry][e.rx-a[i]]!=1){
					e.rx-=a[i];
					b[1]=1;
				}
				if(b[0]==b[1])c[e.hy][e.hx][e.ry][e.rx]=1;
				else if(b[0]==1)c[e.hy][e.hx][e.ry][e.rx]=2;
				else c[e.hy][e.hx][e.ry][e.rx]=3;
				if(vmp[e.hy][e.hx]==0){
					vmp[e.hy][e.hx]=1;
					g++;
				}
				if(vmp[e.ry][e.rx]==0){
					vmp[e.ry][e.rx]=1;
					g++;
				}
				q.push(e);
				if(b[0]==1)e.hx-=a[i];
				if(b[1]==1)e.rx+=a[i];
			}
		}
		e.tim--;
	}
	if(e.tim>=100||q.empty()||g==w*h-k)printf("NA\n");
	else cout<<e.tim<<endl;
}
return 0;
}

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

typedef pair<int,int> __P;
typedef pair<__P,__P> _P;
typedef pair<_P,int> P;

#define C(A,B) (0<=(A)&&(A)<(B))

int main() {
	queue<P> que;
	int X,Y;
	int tx,ty;
	int kx,ky;
	int count;
	int d[50][50];
	int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
	while(true) {
		scanf("%d %d",&X,&Y);
		if(X==0&&Y==0) break;
		scanf("%d %d",&tx,&ty);
		scanf("%d %d",&kx,&ky);
		tx--;ty--;kx--;ky--;
		for(int i=0;i<Y;i++) {
			for(int j=0;j<X;j++) {
				scanf("%d",&d[j][i]);
			}
		}
		que.push(P(_P(__P(tx,ty),__P(kx,ky)),0));
		count=-1;
		while(que.size()) {
			P& p=que.front();
			tx=p.first.first.first;
			ty=p.first.first.second;
			kx=p.first.second.first;
			ky=p.first.second.second;
			if(p.second>=100) {
				break;
			}
			if(tx==kx&&ty==ky) {
				count=p.second;
				break;
			}
			bool b=false;
			for(int i=0;i<4;i++) {
				int ntx=tx,nty=ty,nkx=kx,nky=ky;
				if(C(ntx+dx[i],X)&&C(nty+dy[i],Y)&&!d[ntx+dx[i]][ty+dy[i]]) {
					ntx+=dx[i],nty+=dy[i];
					b=true;
				}
				if(C(nkx-dx[i],X)&&C(nky-dy[i],Y)&&!d[kx-dx[i]][ky-dy[i]]) {
					nkx-=dx[i],nky-=dy[i];
					b=true;
				}
				que.push(P(_P(__P(ntx,nty),__P(nkx,nky)),p.second+1));
			}
			if(!b) break;
			que.pop();
		}
		if(count!=-1) {
			printf("%d\n",count);
		}else {
			printf("NA\n");
		}
	}
}