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)
	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>
#include<string.h>
using namespace std;
struct l{
	int tx;
	int ty;
	int kx;
	int ky;
	int cnt;
};
queue<l> p;
bool ps[50][50][50][50]={};
int main(){
	int x,y,tlx,tly,klx,kly,d[50][50],i,j,cl,tmx[4]={0,1,0,-1},tmy[4]={-1,0,1,0},kmx[4]={0,-1,0,1},kmy[4]={1,0,-1,0},k,z;
	l v;
	while(1){
		cin>>x>>y;
		if(x==0&&y==0)break;
		cin>>tlx>>tly;
		cin>>klx>>kly;
		for(i=0;i<y;i++){
			for(j=0;j<x;j++){
				cin>>d[i][j];
			}
		}
		memset(ps,0,sizeof(ps));
		v.tx=tlx-1;
		v.ty=tly-1;
		v.kx=klx-1;
		v.ky=kly-1;
		v.cnt=0;
		p.push(v);
		while(1){
			tlx=p.front().tx;
			tly=p.front().ty;
			klx=p.front().kx;
			kly=p.front().ky;
			cl=p.front().cnt;
			p.pop();
			if(tlx==klx&&tly==kly||cl>=100){
				while(!p.empty()){
					p.pop();
				}
				break;
			}
			if(ps[tlx][tly][klx][kly]){
				if (!p.empty())
					continue;
				else
					break;
			}
			else{
				ps[tlx][tly][klx][kly]=true;
			}
			for(i=0;i<4;i++){
				if(d[tly+tmy[i]][tlx+tmx[i]]==0&&(tlx+tmx[i])>=0&&(tlx+tmx[i])<x&&(tly+tmy[i])>=0&&(tly+tmy[i])<y){
					v.tx=tlx+tmx[i];
					v.ty=tly+tmy[i];
				}
				else{
					v.tx=tlx;
					v.ty=tly;
				}
				if(d[kly+kmy[i]][klx+kmx[i]]==0&&(klx+kmx[i])>=0&&(klx+kmx[i])<x&&(kly+kmy[i])>=0&&(kly+kmy[i])<y){
					v.kx=klx+kmx[i];
					v.ky=kly+kmy[i];
				}
				else{
					v.kx=klx;
					v.ky=kly;
				}
				v.cnt=cl+1;
				p.push(v);
			}
			
		}
		if(tlx==klx&&tly==kly&&cl!=0){
			cout<<cl<<endl;
		}
		else{
			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);
        --tk.fi; --tk.se;
        --kz.fi; --kz.se;

        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;
}

C++: #include<cstdio>
#include<iostream>
#include<queue>
#include<string.h>
#include<cstring>
using namespace std;
struct PP{
	int kx;
	int ky;
	int tx;
	int ty;
	int Z;
};
int A[52][52][52][52];
int main(){
	PP S;
	queue<PP> P;
	int  w,h;
	int d=0,i=0,j=0,l=-1,D[52][52];
	int tx[4]={ 1, 0,-1,0 };       
	int kx[4]={-1, 0, 1,0 };
	int ty[4]={ 0, 1, 0,-1 };
	int ky[4]={ 0, -1, 0,1};
	scanf("%d %d",&w,&h);
	while(w!=0||h!=0){
	memset(A,0,sizeof(A));
		for(i=0;i<=h+1;i++){
		for(j=0;j<=w+1;j++){
		D[i][j]=1;
		}
	}

	scanf("%d %d",&S.tx,&S.ty);
	scanf("%d %d",&S.kx,&S.ky);
	for(i=1;i<=h;i++){
		for(j=1;j<=w;j++){
		scanf("%d",&D[i][j]);
		}
	}
	S.Z=0;
	P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			d=-1;
			printf("%d\n",S.Z);
		}
	while(d!=-1){
		l++;
		if(l==4){
		l=0;
		S=P.front();
		P.pop();
		if(P.empty()){
			printf("NA\n");
		break;
		}
		}
		S=P.front();
		
		S.tx=S.tx+tx[l];
		S.ty=S.ty+ty[l];
		S.kx=S.kx+kx[l];
		S.ky=S.ky+ky[l];
		if(A[S.ty][S.tx][S.ky][S.kx]==1){
			continue;
		}
		A[S.ty][S.tx][S.ky][S.kx]=1;

		if(D[S.ty][S.tx]==1){
		S.tx=S.tx-tx[l];
		S.ty=S.ty-ty[l];
		}
		if(D[S.ky][S.kx]==1){
		S.kx=S.kx-kx[l];
		S.ky=S.ky-ky[l];
		}
		S.Z++;
		P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			printf("%d\n",S.Z);
			break;
		}	
		if(S.Z==100){
			printf("NA\n");
		break;
		}
	
		
	}
	while(!P.empty()){
	P.pop();
	}
	d=0;
	l=-1;
	scanf("%d %d",&w,&h);
	}	
	return 0;

}