Go: package main

import (
	"container/heap"
	"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)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]struct{}, 0)
	for pq.Len() > 0 {
		now := heap.Pop(&pq).(*Status)
		if now.Person.Distance() == 0 {
			fmt.Println(now.Turn)
			return
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = struct{}{}
		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)
			}
		}
	}
	fmt.Println("NA")
}

func main() {
	var h, w int64
	for {
		fmt.Scan(&h, &w)
		if h == 0 && w == 0 {
			break
		}
		solve(h, w)
	}
}

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};

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

int search()
{
	queue<POS> que;
	
	for (int i = 0; i < 55; i++){
		for (int j = 0; j < 55; j++){
			for (int k = 0; k < 55; k++){
				for (int l = 0; l < 55; 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;
			}
			
			if (maze[now.tx + dx[i]][now.ty + dy[i]]){
				to.tx = now.tx;
				to.ty = now.ty;
			}
			else {
				to.tx = now.tx + dx[i];
				to.ty = now.ty + dy[i];
			}
			
			if (maze[now.kx - dx[i]][now.ky - dy[i]]){
				to.kx = now.kx;
				to.ky = now.ky;
			}
			else {
				to.kx = now.kx - dx[i];
				to.ky = now.ky - dy[i];
			}
			
			to.tx = now.tx + dx[i];
			to.ty = now.ty + dy[i];
			to.kx = now.kx - dx[i];
			to.ky = now.ky - dy[i];
			
			//printf("%d %d %d %d\n", to.tx, to.ty, to.kx, to.ky);
			
			if (d[to.tx][to.ty][to.kx][to.ky] == INF && d[now.tx][now.ty][now.kx][now.ky] < 99){
				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 < 100; i++){
			for (int j = 0; j < 100; j++){
				maze[i][j] = 1;
			}
		}
		
		for (int i = 1; i <= Y; i++){
			for (int j = 1; j <= X; j++){
				scanf("%d", &maze[j][i]);
			}
		}
		
		//for (int i = 0; i <= Y + 1; i++){
		//	for (int j = 0; j <= X + 1; j++){
		//		printf("%d ", maze[j][i]);
		//	}
		//	puts("");
		//}
		
		int r = search();
		if (r != -1) printf("%d\n", r);
		else puts("NA");
	}
	
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P ,P> PP;
constexpr ll MOD = ll(1e9) + 7;
constexpr int IINF = INT_MAX;
constexpr ll LLINF = LLONG_MAX;
constexpr int MAX_N = int(1e5) + 5;
constexpr double EPS = 1e-9;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i > 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define ALL(v) (v).begin(), (v).end()

int w, h, ai, aj, bi, bj;
int d[55][55], memo[55][55][55][55];
bool visited[55][55][55][55];

bool isOK(int i, int j){
    return i>=0 && i<h && j>=0 && j<w && d[i][j]==0;
}

int bfs(){
    for(int i0=0;i0<h;i0++)for(int j0=0;j0<w;j0++){
        for(int i1=0;i1<h;i1++)for(int j1=0;j1<w;j1++){
            memo[i0][j0][i1][j1] = IINF/3;
            visited[i0][j0][i1][j1] = false;
        }
    }
    queue<PP> que;
    que.push({{ai, aj}, {bi, bj}});
    visited[ai][aj][bi][bj] = true;
    memo[ai][aj][bi][bj] = 0;
    while(!que.empty()){
        P p = que.front().first, q = que.front().second;
        que.pop();
        int pi, pj, qi, qj;
        pi = p.first; pj = p.second;
        qi = q.first; qj = q.second;
        if(pi == qi && pj == qj) return memo[pi][pj][qi][qj];
        for(int k=0;k<4;k++){
            int ri = pi + di[k], rj = pj + dj[k];
            int si = qi - di[k], sj = qj - dj[k];
            if(!isOK(ri, rj)) ri = pi, rj = pj;
            if(!isOK(si, sj)) si = qi, sj = qj;
            if(visited[ri][rj][si][sj]) continue;
            visited[ri][rj][si][sj] = true;
            memo[ri][rj][si][sj] = memo[pi][pj][qi][qj] + 1;
            que.push({{ri, rj}, {si, sj}});
        }
    }

    return IINF/3;
}

int main() {
    while(cin >> w >> h, w){
        cin >> aj >> ai >> bj >> bi;
        ai--; aj--; bi--; bj--;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++) cin >> d[i][j];
        }

        int ans = bfs();
        if(ans < 100) cout << ans << endl;
        else cout << "NA" << endl;
    }
    return 0;
}