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<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<string.h>
#include<string>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
struct X
{
	int tx, ty, t, kx, ky;
};
int java[51][51][51][51] = { 0 };
int main()
{
	int w, h, map[52][52] = { 0 };
		int mx[4] = { 0,1,0,-1 }, my[4] = { 1,0,-1,0 };
		while (1)
		{
			queue<X> que;
			X c;
			cin >> w >> h;
			if (w == 0 && h == 0)
				break;
			memset(java, 0, sizeof(java));
			cin >> c.tx >> c.ty >> c.kx >> c.ky;
			c.t = 0;
			que.push(c);
			rep1(i, h)
			{
				rep1(j, w)
				{
					cin >> map[i][j];
				}
			}
			/*?£???????*/
			rep(i, h + 2)//n???????????°,m????¨??????°
			{
				map[i][0] = 1;
				map[i][w + 1] = 1;
			}
			rep(i, w + 2)
			{
				map[0][i] = 1;
				map[h + 1][i] = 1;
			}
			while (!que.empty())
			{
				c = que.front();
				que.pop();
				java[c.tx][c.ty][c.kx][c.ky] = 1;
				if (c.tx == c.kx&&c.ty == c.ky||c.t >= 100)
				{
					break;
				}
				c.t++;
				rep(i, 4)
				{
					if (java[c.tx + mx[i]][c.ty + my[i]][c.kx - mx[i]][c.ky - my[i]] == 0 && map[c.tx + mx[i]][c.ty + my[i]] == 0 && map[c.kx - mx[i]][c.ky - my[i]] == 0)
					{
						c.tx += mx[i];
						c.ty += my[i];
						c.kx -= mx[i];
						c.ky -= my[i];
						que.push(c);
						java[c.tx][c.ty][c.kx][c.ky] = 1;
						c.tx -= mx[i];
						c.ty -= my[i];
						c.kx += mx[i];
						c.ky += my[i];
					}
					else if (java[c.tx][c.ty][c.kx - mx[i]][c.ky - my[i]] == 0 && map[c.tx + mx[i]][c.ty + my[i]] != 0 && map[c.kx - mx[i]][c.ky - my[i]] == 0)
					{
						c.kx -= mx[i];
						c.ky -= my[i];
						que.push(c);
						java[c.tx][c.ty][c.kx][c.ky] = 1;
						c.kx += mx[i];
						c.ky += my[i];
					}
					else if (java[c.tx + mx[i]][c.ty + my[i]][c.kx][c.ky] == 0 && map[c.tx + mx[i]][c.ty + my[i]] == 0 && map[c.kx - mx[i]][c.ky - my[i]] != 0)
					{
						c.tx += mx[i];
						c.ty += my[i];
						que.push(c);
						java[c.tx][c.ty][c.kx][c.ky] = 1;
						c.tx -= mx[i];
						c.ty -= my[i];
					}
				}
			}
			if (c.tx == c.kx&&c.ty == c.ky)
				cout << c.t << endl;
			else
				cout << "NA" << endl;
		}
	return 0;
}

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

typedef struct{
	int xx;
	int yy;
}zah;

int ix,iy;
zah ma,mb;
int maps[52][52]={};

typedef struct{
	int kyo;
	zah zaa;
	zah zab;
}forq;

zah muki[4]={
	{1,0},{0,1},{-1,0},{0,-1}
};
	
char me[50][50][50][50]={};
int main(void){
	int a,b,c,i,j;
	while(1){
		scanf("%d%d",&ix,&iy);
		if(ix==0)break;

		scanf("%d%d%d%d",&ma.xx,&ma.yy,&mb.xx,&mb.yy);
		memset(maps,-1,sizeof(maps));
		memset(me,0,sizeof(me));
		for(i=1;i<=iy;i++){
			for(j=1;j<=ix;j++){
				scanf("%d",&a);
				if(a==0)maps[j][i]=0;
				else maps[j][i]=-1;
			}
		}


		queue<forq> que;

		forq fa,fb;
		fa.kyo=0;
		fa.zaa=ma;
		fa.zab=mb;

		me[ma.xx-1][ma.yy-1][mb.xx-1][mb.yy-1]=1;
		que.push(fa);

		while(!que.empty()){
			fa=que.front();
			que.pop();

			//printf("%d %d %d %d %d\n",fa.kyo,fa.zaa.xx,fa.zaa.yy,fa.zab.xx,fa.zab.yy);
			if(fa.kyo>=100){
				printf("NA\n");
				goto nexq;
			}

			fb.kyo=fa.kyo+1;
			for(i=0;i<4;i++){
				if(maps[fa.zaa.xx+muki[i].xx][fa.zaa.yy+muki[i].yy]==0){
					fb.zaa.xx=fa.zaa.xx+muki[i].xx;
					fb.zaa.yy=fa.zaa.yy+muki[i].yy;
				}
				else{
					fb.zaa.xx=fa.zaa.xx;
					fb.zaa.yy=fa.zaa.yy;
				}

				if(maps[fa.zab.xx-muki[i].xx][fa.zab.yy-muki[i].yy]==0){
					fb.zab.xx=fa.zab.xx-muki[i].xx;
					fb.zab.yy=fa.zab.yy-muki[i].yy;
				}
				else{
					fb.zab.xx=fa.zab.xx;
					fb.zab.yy=fa.zab.yy;
				}

				if(fb.zaa.xx==fb.zab.xx && fb.zaa.yy==fb.zab.yy){
					printf("%d\n",fb.kyo);
					goto nexq;
				}
				if(me[fb.zaa.xx-1][fb.zaa.yy-1][fb.zab.xx-1][fb.zab.yy-1]!=1){
					me[fb.zaa.xx-1][fb.zaa.yy-1][fb.zab.xx-1][fb.zab.yy-1]=1;
					que.push(fb);
				}
			}
		}
		printf("NA\n");
		nexq:;
	}
return 0;
}