Go: package main

import (
	"fmt"
	"math"
	"container/heap"
)

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)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		now := heap.Pop(&pq).(*Status)
		//now := pq.Pop().(*Status)
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			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)
			}
		}
	}
	if ans == 101 {
		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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <sstream>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int,int> pi;
#define rep(i,n) for(int i=0;i<n;i++)


int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
bool past[50][50][50][50];
int d[50][50];
int x,y;
int tx,ty,kx,ky;


main(){
	while(cin>>x>>y,x){
		cin>>tx>>ty>>kx>>ky;
		--tx;--ty;--kx;--ky;
		rep(i,x)rep(j,y)cin>>d[i][j];
		memset(past,0,sizeof(past));

		past[tx][ty][kx][ky]=1;
		queue<pair<pair<pi,pi>,int> > state;
		state.push(make_pair(make_pair(make_pair(tx,ty),make_pair(kx,ky)),0));
		
		
		bool na=true;
		
		while(!state.empty()){
			tx=state.front().first.first.first;
			ty=state.front().first.first.second;
			kx=state.front().first.second.first;
			ky=state.front().first.second.second;
			
			int time=state.front().second;
			state.pop();
			
			if(tx==kx && ty==ky){
				na=false;
				cout<<time<<endl;
				break;
			}
			
			rep(i,4){
				int ttx=tx+dx[i],tty=ty+dy[i],
					tkx=kx-dx[i],tky=ky-dy[i];
				
				if(ttx<0 || ttx>=x || tty<0 || tty>=y || d[ttx][tty]==1){
					ttx=tx;
					tty=ty;
				}
				if(tkx<0 || tkx>=x || tky<0 || tky>=y || d[tkx][tky]==1){
					tkx=kx;
					tky=ky;
				}
				if(past[ttx][tty][tkx][tky] || time>=99)continue;
				if(ttx==tkx && tty==tky){
					cout<<time+1<<endl;
					goto END;
				}
				pair<pair<int,int>,pair<int,int> > next=make_pair(make_pair(ttx,tty),make_pair(tkx,tky));
				
				past[ttx][tty][tkx][tky]=1;
				state.push(make_pair(next,time+1));
			}
			if(!na)break;
		}
		
		if(na)puts("NA");END:;
	}
}

C++: #include<stdio.h>
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
struct PP{
	int kx;
	int ky;
	int tx;
	int ty;
	int Z;
};
int A[50][50][50][50];
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("1");
		}
	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.tx][S.ty][S.kx][S.ky]==1){
			continue;
		}
		A[S.tx][S.ty][S.kx][S.ky]=1;

		if(D[S.tx][S.ty]==1){
		S.tx=S.tx-tx[l];
		S.ty=S.ty-ty[l];
		}
		if(D[S.kx][S.ky]==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();
	}
	l=-1;
	scanf("%d %d",&w,&h);
	}	
	return 0;

}

C++: #include<queue>
#include<stdio.h>

using namespace std;

class T{
	public:
	int x1,x2,y1,y2,count;
	T(int x1,int y1,int x2,int y2,int count):x1(x1),y1(y1),x2(x2),y2(y2),count(count){}
};

char check[55][55][55][55];
int board[55][55];

int main(){
	while(1){
		for(int i=0;i<55;i++){
			for(int j=0;j<55;j++){
				for(int k=0;k<55;k++){
					for(int p=0;p<55;p++){
						check[i][j][k][p]=0;
					}
				}
			}
		}
		
		int w,h;
		int sx1,sx2,sy1,sy2;
		
		scanf("%d%d",&w,&h);
		if(w==0 && h==0)break;
		
		scanf("%d%d%d%d",&sx1,&sy1,&sx2,&sy2);
		
		for(int i=0;i<h;i++){
			for(int j=0;j<w;j++){
				scanf("%d",&board[i][j]);
			}
		}
		
		
		queue<T> que;
		que.push(T(sx1,sy1,sx2,sy2,0));
		
		while(1){
			if(que.empty())break;
			
			T u = que.front();
			que.pop();
			
			if(check[u.x1][u.y1][u.x2][u.y2]==1)continue;
			check[u.x1][u.y1][u.x2][u.y2]=1;
			
			if(u.count>100)break;
			if(u.x1 == u.x2 && u.y1 == u.y2){
				printf("%d\n",u.count);
				goto A;
			}
			
			int dx[4] = {0,1,0,-1};
			int dy[4] = {1,0,-1,0};
			for(int i=0;i<4;i++){
				int nx1 = u.x1 + dx[i];
				int ny1 = u.y1 + dy[i];
				
				int nx2 = u.x2 - dx[i];
				int ny2 = u.y2 - dy[i];
				
				if(nx1<0 || ny1<0 || nx1>=w || ny1>=h || board[ny1][nx1]==1){
					nx1=u.x1;
					ny1=u.y1;
					continue;
				}
				if(nx2<0 || ny2<0 || nx2>=w || ny2>=h || board[ny2][nx2]==1){
					nx2=u.x2;
					ny2=u.y2;
					continue;
				}
				que.push(T(nx1,ny1,nx2,ny2,u.count+1));
			}
		}
		
		printf("NA\n");
		A:;
	}
}