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 <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin(a),end(a)
#define MS(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
const ll INF = 114514810;
const ll MOD = 1000000007;
const double EPS = 1e-8;
const double PI = acos(-1.0);
struct edge
{
	int from, to, cost;
	bool operator < (const edge& e) const { return cost < e.cost; }
	bool operator >(const edge& e) const { return cost > e.cost; }
};
int dx[] = { -1, 0, 0, 1 }; int dy[] = { 0, -1, 1, 0 };
bool valid(int x, int y, int h, int w) { return (x >= 0 && y >= 0 && x < h&&y < w); }
///*************************************************************************************///
///*************************************************************************************///
///*************************************************************************************///

int main()
{
	int h, w;
	while (cin >> h >> w, h)
	{
		int tx, ty, kx, ky;
		cin >> tx >> ty >> kx >> ky;
		int fld[50][50];
		REP(i, h)REP(j, w) cin >> fld[i][j];
		queue<pair<P, int>> que;
		set<P> used;
		P beg = P(tx*w + ty, kx*w + ky);
		que.push(make_pair(beg, 0));
		used.insert(beg);
		bool f = true;
		while (que.size())
		{
			auto tmp = que.front();
			que.pop();
			if (tmp.second >= 100) break;
			if (tmp.first.first == tmp.first.second)
			{
				f = false;
				cout << tmp.second << endl;
				break;
			}
			int tmptx = tmp.first.first / w, tmpty = tmp.first.first % w;
			int tmpkx = tmp.first.second / w, tmpky = tmp.first.second % w;
			REP(i, 4)
			{
				int ntx, nty, nkx, nky;
				ntx = tmptx + dx[i], nty = tmpty + dy[i];
				if (!valid(ntx, nty, h, w) || fld[ntx][nty] == 1)
				{
					ntx = tmptx, nty = tmpty;
				}
				nkx = tmpkx - dx[i], nky = tmpky - dy[i];
				if (!valid(nkx, nky, h, w) || fld[nkx][nky] == 1)
				{
					nkx = tmpkx, nky = tmpky;
				}
				int a = ntx*w + nty;
				int b = nkx*w + nky;
				if (used.find(P(a, b)) == used.end())
				{
					used.insert(P(a, b));
					que.push(make_pair(P(a, b), tmp.second + 1));
				}
			}
		}
		if (f) puts("NA");
	}
		return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define INF (2000000000)
#define MOD (1000000007)
using namespace std;

typedef vector<int> VI;
typedef vector<int>::iterator VII;
typedef vector<double> VD;
typedef vector<double>::iterator VDI;
typedef pair<int, int> P;


typedef struct
{
	int tx, ty, kx, ky;
} POS;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};

bool maze[100][100];
int X, Y;
POS f;
int d[52][52][52][52];

int search()
{
	queue<POS> que;
	
	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++){
					d[i][j][k][l] = INF;
				}
			}
		}
	}
	
	que.push(f);
	d[f.tx][f.ty][f.kx][f.ky] = 0;
	
	while (que.size()){
		POS now = que.front();
		que.pop();
		
		//printf("%d %d %d %d\n", now.tx, now.ty, now.kx, now.ky);
		
		if (now.tx == now.kx && now.ty == now.ky){
			return (d[now.tx][now.ty][now.kx][now.ky]);
		}
		
		for (int i = 0; i < 4; i++){
			POS to;
			if (maze[now.tx + dx[i]][now.ty + dy[i]] || maze[now.kx - dx[i]][now.ky - dy[i]]){
				continue;
			}
			else {
				to.tx = now.tx + dx[i];
				to.ty = now.ty + dy[i];
				to.kx = now.kx - dx[i];
				to.ky = now.ky - dy[i];
			}
			
			if (d[to.tx][to.ty][to.kx][to.ky] == INF /* && d[now.tx][now.ty][now.kx][now.ky] < 100 */){
				que.push(to);
				d[to.tx][to.ty][to.kx][to.ky] = d[now.tx][now.ty][now.kx][now.ky] + 1;
			}
		}
	}
	
	return (-1);
}

int main()
{
	while (scanf("%d %d", &X, &Y), X + Y){
		scanf("%d %d", &f.tx, &f.ty);
		scanf("%d %d", &f.kx, &f.ky);
		
		for (int i = 0; i < 52; i++){
			for (int j = 0; j < 52; j++){
				maze[i][j] = true;
			}
		}
		
		for (int i = 1; i <= Y; i++){
			for (int j = 1; j <= X; j++){
				scanf("%d", &maze[j][i]);
			}
		}
		
		int r = search();
		if (r != -1 || r <= 100) printf("%d\n", r);
		else puts("NA");
	}
	
	return 0;
}