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)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(102)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		//now := pq.Pop().(*Status)
		now := pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}

		if _, ok := memo[now.Person]; ok {
			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)
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		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++: #include<iostream>
#include<queue>
using namespace std;
const int N = 50;
#define dx(y, x) field[(y) + 5][(x) + 5]
#define dy(a, b, c, d) move[(a) + 5][(b) + 5][(c) + 5][(d) + 5]
#define FOR(a, b) for (int (a) = 0; (a) < (int)(b); ++(a))

int field[N + 25][N + 25] = {false};
bool move[N + 25][N + 25][N + 25][N + 25];

class C{
    public:
        int ty, tx, ky, kx, step;
        C(int tty, int ttx, int kky, int kkx, int s);
};

C::C(int tty, int ttx, int kky, int kkx, int s){
    ty = tty;
    tx = ttx;
    ky = kky;
    kx = kkx;
    step = s;
}

int main(){

    int w, h, stx, sty, skx, sky;
    while(cin >>w >>h){
        if(w == 0 && h == 0) break;

        FOR(i, (N + 25)){
            FOR(j, (N + 25)){
                field[i][j] = 1;
            }
        }

        cin >>stx >>sty >>skx >>sky;
        --stx; --sty; --skx; --sky;

        FOR(i, h){
            FOR(j, w){
                cin >>dx(i, j);
            }
        }

        queue<C> qu;
        C cls(sty, stx, sky, skx, 0);
        qu.push(cls);
        dy(sty, stx, sky, skx) = true;

        int cnt = 0;
        bool endFlg = false;
        int mx[] = {0, 1, 0, -1};
        int my[] = {-1, 0, 1, 0};

        while(!qu.empty()){
            C now = qu.front(); qu.pop();

            if(now.step >= 100) break;
            if(now.ty == now.ky && now.tx == now.kx){
                endFlg = true;
                cout <<now.step <<endl;
                break;
            }

            FOR(i, 4){
                FOR(j, 4){
                    int nty = now.ty + my[i];
                    int ntx = now.tx + mx[i];
                    int nky = now.ky + (my[i] * -1);
                    int nkx = now.kx + (mx[i] * -1);
                    if(!dy(nty, ntx, nky, nkx) && !(dx(nty, ntx) == 1 && dx(nky, nkx) == 1)){

                        if(dx(nty, ntx) == 1){
                            nty = now.ty; ntx = now.tx;
                        }
                        if(dx(nky, nkx) == 1){
                            nky = now.ky; nkx = now.kx;
                        }
                        if(dy(nty, ntx, nky, nkx)) continue;

                        C tmp2(nty, ntx, nky, nkx, now.step + 1);
                        qu.push(tmp2);
                        dy(nty, ntx, nky, nkx) = true;
                    }
                }
            }
        }

        if(!endFlg) cout <<"NA" <<endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

typedef pair<int,int> pi;
typedef pair<pi,pi> P;

const int INF=123456789;
int d[50][50];
int c[50][50][50][50];

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

void init()
{
    rep(i,50)rep(j,50)rep(k,50)rep(l,50) c[i][j][k][l]=INF;
}

int main()
{
    int w,h;
    while(scanf(" %d %d",&w,&h),w)
    {
        init();

        pi tk,kz;
        scanf(" %d %d", &tk.se, &tk.fi);
        scanf(" %d %d", &kz.se, &kz.fi);
        rep(i,h)rep(j,w) scanf(" %d", &d[i][j]);

        queue<P> que;
        que.push(P(tk,kz));
        c[tk.fi][tk.se][kz.fi][kz.se]=0;
        #define IN(x,y) (0<=x && x<w && 0<=y && y<h)
        while(!que.empty())
        {
            P now=que.front(); que.pop();
            pi a=now.fi, b=now.se;

            rep(i,4)
            {
                int ax=a.se+dx[i], ay=a.fi+dy[i];
                int bx=b.se+dx[i^2], by=b.fi+dy[i^2];

                if(!IN(ax,ay) || d[ay][ax]==1)
                {
                    ax=a.se;
                    ay=a.fi;
                }
                if(!IN(bx,by) || d[by][bx]==1)
                {
                    bx=b.se;
                    by=b.fi;
                }

                if(c[ay][ax][by][bx]>c[a.fi][a.se][b.fi][b.se]+1)
                {
                    c[ay][ax][by][bx]=c[a.fi][a.se][b.fi][b.se]+1;
                    que.push(P(pi(ay,ax),pi(by,bx)));
                }
            }
        }

        int ans=INF;
        rep(i,h)rep(j,w) ans=min(ans,c[i][j][i][j]);
        if(ans==INF) printf("NA\n");
        else printf("%d\n", ans);
    }
    return 0;
}