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 <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <complex>
#include <queue>
#include <deque>
#include <cmath>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
#define FORE(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
typedef complex<int> cl;
typedef pair<cl,cl> pr;
typedef pair<pr,int> ppr;
typedef vector<pr> vpr;
const int INF=1<<30;
const int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
bool reached[52][52][52][52]={};
ppr pprs(cl a,cl b,int c){ return ppr(pr(a,b),c);}
int main() {
	// your code goes here
	int X,Y,tmp,tmpb;
	while(cin >> X >> Y && X){
	bool maps[52][52]={};
	cl t,k;
	cin >> tmp>> tmpb;
	t=cl(tmpb,tmp);
	cin >> tmp>> tmpb;
	k=cl(tmpb,tmp);
	REP(i,Y+2)
		REP(j,X+2)
			if(!j || !i || i==Y+1 || j==X+1)
				maps[i][j]=1;
	FORE(i,1,Y)
		FORE(j,1,X)
			cin >> maps[i][j];
	queue<ppr> qu;
	qu.push(pprs(t,k,0));
	int ans=-1;
	while(!qu.empty()){
		cl a=qu.front().first.first,b=qu.front().first.second;
		int t=qu.front().second;
		qu.pop();
		if(a==b){
			ans=t;
			break;
		}
		if(reached[a.real()][a.imag()][b.real()][b.imag()]) continue;
		reached[a.real()][a.imag()][b.real()][b.imag()]=1;

		REP(i,4){
			
			cl na=cl(a),nb=cl(b);
			if(!maps[a.real()+dy[i]][a.imag()+dx[i]])
				na+=cl(dy[i],dx[i]);
			if(!maps[b.real()-dy[i]][b.imag()-dx[i]])
				nb-=cl(dy[i],dx[i]);
			if(!reached[na.real()][na.imag()][nb.real()][nb.imag()])
			qu.push(pprs(na,nb,t+1));
		}
	}
	if(ans==-1)
	cout << "NA" << endl;
	else 
	cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CLR(a) memset(a,0,sizeof(a))

typedef long long int ll;

using namespace std;
int dx[] = {-1,0,0,1};
int dy[] = {0,1,-1,0};
int xs,ys,tx,ty,kx,ky;


int main(){
    while(true){
	cin >> xs >> ys;
	if(xs == 0 && ys == 0) break;
	cin >> tx >> ty;
	cin >> kx >> ky;
	tx--;
	ty--;
	kx--;
	ky--;
	if(tx==kx&&ty==ky){
	    cout << 0 << endl;
	    continue;
	}
	vector< vector<int> > map(ys,vector<int>(xs));
	REP(i,ys)REP(j,xs) cin >> map[i][j];

	queue<int> qtx;
	queue<int> qty;
	queue<int> qkx;
	queue<int> qky;
	queue<int> qn;
	set< pair< pair<int,int> , pair<int,int> > > used;
	int ans = 100;
	qtx.push(tx);
	qty.push(ty);
	qkx.push(kx);
	qky.push(ky);
	qn.push(1);
	while(!qtx.empty()){
	    int x1 = qtx.front();
	    int y1 = qty.front();
	    int x2 = qkx.front();
	    int y2 = qky.front();
	    int n = qn.front();
	    if(n >= 100){
		ans = min(ans,100);
		break;
	    }
	    qtx.pop();
	    qty.pop();
	    qkx.pop();
	    qky.pop();
	    qn.pop();
	    REP(i,4){
		int ntx = x1 + dx[i];
		int nty = y1 + dy[i];
		int nkx = x2 - dx[i];
		int nky = y2 - dy[i];
		if(ntx<0 || xs <= ntx) ntx = x1;
		if(nty<0 || ys <= nty) nty = y1;
		if(nkx<0 || xs <= nkx) nkx = x2;
		if(nky<0 || ys <= nky) nky = y2;
		if(map[nty][ntx] == 1) {
		    ntx = x1;
		    nty = y1;
		}
		if(map[nky][nkx] == 1) {
		    nkx = x2;
		    nky = y2;
		}
		pair< pair<int,int> , pair<int,int> > pp(pair<int,int>(ntx,nty),pair<int,int>(nkx,nky));
		if(used.find(pp) != used.end()) continue;
		used.insert(pp);

		if(ntx==nkx&&nty==nky){
		    ans = min(ans,n);
		    break;
		}
		qtx.push(ntx);
		qty.push(nty);
		qkx.push(nkx);
		qky.push(nky);
		qn.push(n+1);
	    }
	    if(ans < 100) break;
	}
	if(ans>=100) cout << "NA" << endl;
	else cout << ans << endl;
    }
    return 0;
}