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 <iostream>
#include <queue>

using namespace std;

#define fst first
#define scd second
#define mp make_pair
#define rep(i,x) for(int i=0;i<(int)x;++i)
#define rep1(i,x) for(int i=1;i<=(int)x;++i)

class P {
public:
    int x, y;
    P (int x0,int y0) {
        x=x0,y=y0;
    };
};

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

int d[53][53];
int memo[53][53][53][53];
bool used[53][53][53][53];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int X, Y;
    while (cin >> X >> Y, X || Y) {
        int tx, ty; cin >> tx >> ty;
        int kx, ky; cin >> kx >> ky;
        fill(d[0], d[Y+2], 1);
        rep1(i, Y) rep1(j, X) cin >> d[i][j];

        //rep(i, Y + 2) {
        //    rep(j, X + 2) {
        //        if (j) cout << ' ';
        //        cout << d[i][j];
        //    }
        //    cout << '\n';
        //}

        queue<pair<P, P> > q;

        q.push(mp(P(tx, ty), P(kx, ky)));
        memo[ty][tx][ky][kx] = 0;
        used[ty][tx][ky][kx] = true;

        int ans = -1;

        while (q.size()) {
            pair<P, P> r = q.front(); q.pop();
            P f = r.fst, s = r.scd;

            if (memo[f.y][f.x][s.y][s.x] >= 100) break;

            if (f.x == s.x && f.y == s.y) {
                ans = memo[f.y][f.x][s.y][s.x];
                break;
            }

            rep(i, 4) {
                int nfx = f.x + dx[i], nfy = f.y + dy[i];
                int nsx = s.x - dx[i], nsy = s.y - dy[i];
                if (d[nfy][nfx] == 1 && d[nsy][nsx] == 1) continue;
                if (d[nfy][nfx] == 1) nfx = f.x, nfy = f.y;
                if (d[nsy][nsx] == 1) nsx = s.x, nsy = s.y;
                if (!used[nfy][nfx][nsy][nsx]) {
                    used[nfy][nfx][nsy][nsx] = true;
                    memo[nfy][nfx][nsy][nsx] = memo[f.y][f.x][s.y][s.x] + 1;
                    q.push(mp(P(nfx, nfy), P(nsx, nsy)));
                }
            }
        }

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

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P1;
typedef pair<P1,P1> P2;
typedef pair<int,P2> P3;
int d[50][51];
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
bool used[50][50][50][50];
int main() {
	int X,Y;
	while(scanf("%d %d",&X,&Y),X) {
		int tx,ty,kx,ky;
		scanf("%d %d",&tx,&ty);
		scanf("%d %d",&kx,&ky);
		for(int i=0;i<Y;i++) {
			for(int j=0;j<X;j++) scanf("%d",&d[i][j]);
		}
		queue<P3> Q;
		Q.push(P3(0,P2(P1(tx-1,ty-1),P1(kx-1,ky-1))));
		int cur=0;
		bool NA=1;
		while(!Q.empty()) {
			P3 p3=Q.front();Q.pop();
			int tx=p3.second.first.first;
			int ty=p3.second.first.second;
			int kx=p3.second.second.first;
			int ky=p3.second.second.second;
			if(p3.first>=100) break;
			if(tx==kx&&ty==ky) {
				printf("%d\n",p3.first);
				NA=0;
				break;
			}
			for(int i=0;i<4;i++) {
				int ntx=tx+dx[i],nty=ty+dy[i];
				int nkx=kx-dx[i],nky=ky-dy[i];
				if(0>ntx||ntx>=X||0>nty||nty>=Y||0>nkx||nkx>=X||0>nky||nky>=Y) continue;
				if(d[nty][ntx]) ntx=tx,nty=ty;
				if(d[nky][nkx]) nkx=kx,nky=ky;
				if(!used[ntx][nty][nkx][nky]) {
					used[ntx][nty][nkx][nky]=1;
					Q.push(P3(p3.first+1,P2(P1(ntx,nty),P1(nkx,nky))));
				}
			}
		}
		if(NA) printf("NA\n");
	}
}

C++: #include <queue>
#include <vector>
#include <cstring>
#include <iostream>
using namespace std;
int H, W, ax, ay, bx, by, x[52][52], dp[52][52][52][52];
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int main() {
	while(~scanf("%d%d%d%d%d%d", &W, &H, &ax, &ay, &bx, &by)) {
		for(int i = 0; i < H + 2; i++) {
			for(int j = 0; j < W + 2; j++) {
				x[i][j] = 1;
				if(i && i != H + 1 && j && j != W + 1) scanf("%d", &x[i][j]);
			}
		}
		memset(dp, -1, sizeof(dp)); dp[ay][ax][by][bx] = 0;
		queue<vector<int> > que; que.push({ax, ay, bx, by});
		bool flag = false;
		while(!que.empty()) {
			vector<int> v1 = que.front(); que.pop();
			for(int i = 0; i < 4; i++) {
				vector<int> v2 = v1;
				if(!x[v1[1] + dy[i]][v1[0] + dx[i]]) v2[0] += dx[i], v2[1] += dy[i];
				if(!x[v1[3] - dy[i]][v1[2] - dx[i]]) v2[2] -= dx[i], v2[3] -= dy[i];
				if(v2[0] == v2[2] && v2[1] == v2[3]) {
					flag = true; break;
				}
				if(dp[v2[1]][v2[0]][v2[3]][v2[2]] == -1) {
					dp[v2[1]][v2[0]][v2[3]][v2[2]] = dp[v1[1]][v1[0]][v1[3]][v1[2]] + 1;
					que.push(v2);
				}
			}
			if(flag) {
				cout << dp[v1[1]][v1[0]][v1[3]][v1[2]] + 1 << endl; break;
			}
		}
		if(!flag) cout << "NA" << endl;
	}
}