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)
	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)
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			continue
		}
		if ans<=now.Turn {
			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)
			}
		}
	}
	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++: // AOJ 0223
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>

using namespace std;

#define x first
#define y second
#define mp make_pair

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

typedef pair <int, int> Point;
typedef pair <Point, Point> kotori;
int x, y;

ostream &operator<<(ostream &os, const Point &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }

bool is_region(Point p)
{
	return (0 <= p.x && p.x < x && 0 <= p.y && p.y < y);
}

int main()
{
	while (cin >> x >> y, x || y){
		Point s1, s2;
		bool otonoki[64][64];
		cin >> s1.x >> s1.y;
		cin >> s2.x >> s2.y;
		s1.x--; s1.y--;
		s2.x--; s2.y--;
		for (int i = 0; i < y; i++){
			for (int j = 0; j < x; j++){
				cin >> otonoki[i][j];
			}
		}

		// cout << "in" << endl;

		map <kotori, bool> vst;
		queue <pair <kotori, int> > q;
		q.push(mp(mp(s1, s2), 0));
		bool f = false;
		while (!q.empty()){
			Point honoka = q.front().first.first, umi = q.front().first.second;
			int steps = q.front().second;
			q.pop();
			if (honoka == umi){
				cout << steps << endl;
				f = true;
				break;
			}
			if (vst[mp(honoka, umi)]) continue;
			vst[mp(honoka, umi)] = true;
			// cout << steps << " : " << honoka << " " << umi << endl;
			for (int i = 0; i < 4; i++){
				Point nh = honoka, nu = umi;
				nh.x += dx[i], nh.y += dy[i];
				nu.x -= dx[i], nu.y -= dy[i];

				// cout << nh << " " << nu << endl;
				// if (!is_region(nh) && !is_region(nu)) continue;
				if (vst[mp(nh, nu)]) continue;
				
				if (!is_region(nh)) nh.x -= dx[i], nh.y -= dy[i];
				if (!is_region(nu)) nu.x += dx[i], nu.y += dy[i];
				if (otonoki[nh.y][nh.x]) nh.x -= dx[i], nh.y -= dy[i];
				if (otonoki[nu.y][nu.x]) nu.x += dx[i], nu.y += dy[i];
				q.push(mp(mp(nh, nu), steps + 1));
			}
		}
		if (!f) cout << "NA" << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
typedef tuple<int, int, int, int, int> T2;

const ll MOD=1e9+7;
const ll INF=1e18;
const double pi=acos(-1);
const double eps=1e-10;

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

int main(){
    while(1){
        int w, h; cin>>w>>h;
        if(w == 0) return 0;

        int tx, ty, kx, ky; cin>>tx>>ty>>kx>>ky;

        vector<vector<int>> d(h+2, vector<int>(w+2, 1));
        for(int i=1; i<=h; i++){
            for(int j=1; j<=w; j++){
                cin>>d[i][j];
            }
        }

        map<T, bool> visited;
        visited[T(ty, tx, ky, kx)] = true;

        bool valid = false;
        queue<T2> que;
        que.push(T2(ty, tx, ky, kx, 0));
        while(que.size()){
            int cy1, cx1, cy2, cx2, cnt;
            tie(cy1, cx1, cy2, cx2, cnt) = que.front();
            que.pop();

            if(100 <= cnt) continue;

            if(cy1 == cy2 && cx1 == cx2){
                cout << cnt << endl;
                valid = true;
                break;
            }

            for(int i=0; i<4; i++){
                int ny1 = cy1 + dy[i];
                int nx1 = cx1 + dx[i];
                int ny2 = cy2 - dy[i];
                int nx2 = cx2 - dx[i];

                if(d[ny1][nx1] == 0 && d[ny2][nx2] == 0 && !visited[T(ny1, nx1, ny2, nx2)]){
                    visited[T(ny1, nx1, ny2, nx2)] = true;
                    que.push(T2(ny1, nx1, ny2, nx2, cnt + 1));
                }
                else if(d[ny1][nx1] == 0 && d[ny2][nx2] == 1 && !visited[T(ny1, nx1, cy2, cx2)]){
                    visited[T(ny1, nx1, cy2, cx2)] = true;
                    que.push(T2(ny1, nx1, cy2, cx2, cnt + 1));
                }
                else if(d[ny1][nx1] == 1 && d[ny2][nx2] == 0 && !visited[T(cy1, cx1, ny2, nx2)]){
                    visited[T(cy1, cx1, ny2, nx2)] = true;
                    que.push(T2(cy1, cx1, ny2, nx2, cnt + 1));
                }
            }
        }

        if(!valid){
            cout << "NA" << endl;
        }
    }
}