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.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 {
		heap.Init(&pq)
		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 <bits/stdc++.h>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;

constexpr int INF = 1e9;

int main() {
    using state = tuple<int, int, int, int, int>;

    int W, H;
    while(cin >> W >> H, W) {
        int tx, ty, kx, ky;
        cin >> tx >> ty >> kx >> ky;
        tx--; ty--; kx--; ky--;
        vector<vector<int>> v(H, vector<int>(W));
        for(int i=0; i<H; ++i) {
            for(int j=0; j<W; ++j) {
                cin >> v[i][j];
            }
        }
        vector<vector<vvi>> d(H, vector<vvi>(W, vvi(H, vi(W, INF))));
        d[ty][tx][ky][kx] = 0;
        priority_queue<state, vector<state>, greater<state>> que;
        que.push(make_tuple(0, ty, tx, ky, kx));
        int dx[4] = {0, -1, 0, 1},
            dy[4] = {1, 0, -1, 0};
        auto check = [&v, W, H](int y, int x) {
            return 0 <= y && y < H && 0 <= x && x < W && v[y][x] == 0;
        };
        while(!que.empty()) {
            int cd, y1, x1, y2, x2;
            tie(cd, y1, x1, y2, x2) = que.top();
            que.pop();
            if(d[y1][x1][y2][x2] > cd) {
                continue;
            }
            for(int i=0; i<4; ++i) {
                int ny1 = y1+dy[i], nx1 = x1+dx[i];
                if(!check(ny1, nx1)) {
                    ny1 = y1;
                    nx1 = x1;
                }
                int ny2 = y2-dy[i], nx2 = x2-dx[i];
                if(!check(ny2, nx2)) {
                    ny2 = y2;
                    nx2 = x2;
                }
                if(d[ny1][nx1][ny2][nx2] > cd + 1) {
                    d[ny1][nx1][ny2][nx2] = cd + 1;
                    que.push(make_tuple(cd+1, ny1, nx1, ny2, nx2));
                }
            }
        }
        int res = INF;
        for(int i=0; i<H; ++i) {
            for(int j=0; j<W; ++j) {
                res = min(res, d[i][j][i][j]);
            }
        }
        if(res == INF) {
            cout << "NA" << endl;
        } else {
            cout << res << endl;
        }
    }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
 
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;

int field[50][50];
int visit[50][50][50][50];

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

int w, h;

bool canmove(int x, int y){
	if(x < 0 || x >= w || y < 0 || y >= h) return false;
	if(field[y][x]) return false;
	return true;
}

int main(){

	while(cin >> w >> h, w|h){
		int tx, ty, kx, ky;
		cin >> tx >> ty >> kx >> ky;
		rep(i, h) rep(j, w) cin >> field[i][j];

		memset(visit, 0, sizeof(visit));

		queue<pair<pair<P, P>, int> > q;
		q.push(MP(MP(MP(tx, ty), MP(kx, ky)), 0));

		int ans = -1;
		while(!q.empty()){
			P t, k;
			t = q.front().first.first;
			k = q.front().first.second;
			int time = q.front().second;
			q.pop();

			if(visit[t.X][t.Y][k.X][k.Y]) continue;
			visit[t.X][t.Y][k.X][k.Y] = 1;

			if(t == k){
				ans = time;
				break;
			}

			rep(i, 4){
				int ntx = t.X + dx[i];
				int nty = t.Y + dy[i];
				int nkx = k.X - dx[i];
				int nky = k.Y - dy[i];
				if(!canmove(ntx, nty)) ntx = t.X, nty = t.Y;
				if(!canmove(nkx, nky)) nkx = k.X, nky = k.Y;
				q.push(MP(MP(MP(ntx, nty), MP(nkx, nky)), time+1));
			}
		}

		if(ans == -1) cout << "NA" << endl;
		else cout << ans << endl;
	}


	return 0;
}