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 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)
	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 len(pq) > 0 {
		now := &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 {
				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<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,l*/;
Y e;
while(1){
queue<Y> q;
	/*l=1;
	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(!q.empty()){
		e=q.front();
		q.pop();
		/*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]==0&&mp[e.ry-a[i]][e.rx]!=1||mp[e.ry-a[i]][e.rx]!=1&&c[e.hy][e.hx][e.ry-a[i]][e.rx]==0&&mp[e.hy+a[i]][e.hx]==1||mp[e.hy+a[i]][e.hx]!=1&&mp[e.ry-a[i]][e.rx]==1&&c[e.hy+a[i]][e.hx][e.ry][e.rx]==0){
				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;																																																														
				}		
				c[e.hy][e.hx][e.ry][e.rx]=1;																																																																															
				/*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]]==0||mp[e.hy][e.hx+a[i]]!=1&&c[e.hy][e.hx+a[i]][e.ry][e.rx]==0&&mp[e.ry][e.rx-a[i]]==1||mp[e.ry][e.rx-a[i]]!=1&&mp[e.hy][e.hx+a[i]]==1&&c[e.hy][e.hx][e.ry][e.rx-a[i]]==0){
				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;
				}
				c[e.hy][e.hx][e.ry][e.rx]=1;
				/*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.hy==e.ry&&e.hx==e.rx)cout<<e.tim<<endl;
	else printf("NA\n");
}
return 0;
}

C++: #include <iostream>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define INF 1e9
#define rep(i,n) for(int i=0;i<n;i++)

struct C{
	int tx,ty,kx,ky;
	C(int tx,int ty,int kx,int ky):
	tx(tx),ty(ty),kx(kx),ky(ky) {}
};

int X,Y,tx,ty,kx,ky,m[51][51],dx[]={1,0,-1,0},dy[]={0,1,0,-1},d[51][51][51][51];

int bfs(int tx,int ty,int kx,int ky){
	queue<C> q;
	rep(i,X)rep(j,Y)rep(k,X)rep(l,Y)d[i][j][k][l]=INF;
	q.push(C(tx,ty,kx,ky));
	d[tx][ty][kx][ky]=0;
	while(!q.empty()){
		C c=q.front();q.pop();
		//cout<<c.tx<<" "<<c.ty<<" "<<c.kx<<" "<<c.ky<<" : "<<d[c.tx][c.ty][c.kx][c.ky]<<endl;
		if(d[c.tx][c.ty][c.kx][c.ky]==100)return -1;
		if(c.tx==c.kx&&c.ty==c.ky)return d[c.tx][c.ty][c.kx][c.ky];
		rep(i,4){
			int ntx=c.tx+dx[i],nty=c.ty+dy[i],nkx=c.kx-dx[i],nky=c.ky-dy[i];
			if(ntx<0||ntx>=X||nty<0||nty>=Y||m[nty][ntx]){ntx=c.tx;nty=c.ty;}
			if(nkx<0||nkx>=X||nky<0||nky>=Y||m[nky][nkx]){nkx=c.kx;nky=c.ky;}
			if(d[ntx][nty][nkx][nky]==INF){
				//cout<<ntx<<" "<<nty<<" "<<nkx<<" "<<nky<<endl;
				q.push(C(ntx,nty,nkx,nky));
				d[ntx][nty][nkx][nky]=d[c.tx][c.ty][c.kx][c.ky]+1;
			}
		}
	}
	return -1;
}

int main(){
	while(cin>>X>>Y&&X){
		cin>>tx>>ty>>kx>>ky;
		tx--;ty--;kx--;ky--;
		rep(i,Y)rep(j,X)cin>>m[i][j];
		int ans=bfs(tx,ty,kx,ky);
		if(ans>=0)cout<<ans<<endl;
		else cout<<"NA"<<endl;
	}
}