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)
	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 ans <= now.Turn {
			continue
		}
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		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 <iostream>
#include <queue>
using namespace std;

struct state{ int lx,ly,rx,ry; };

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

int main(){
	int h,w;
	while(cin >> w >> h,w){
		int ax,ay,bx,by,mi = 101;
		bool used[50][50][50][50] = {},field[50][50];
		cin >> ax >> ay >> bx >> by; ax--;ay--;bx--;by--;
		for(int i = 0;i < h;i++){
			for(int j = 0;j < w;j++) cin >> field[i][j];
		}
		queue<state> que;
		que.push({ax,ay,bx,by});
		used[ax][ay][bx][by] = true;
		for(int i = 0;i <= 100;i++){
			int siz = que.size();
			if(!siz) break;
			for(int j = 0;j < siz;j++){
				state s = que.front();que.pop();
				if(s.lx == s.rx && s.ly == s.ry) mi = min(i,mi);
				for(int k = 0;k < 4;k++){
					int nlx = s.lx + dx[k],nly = s.ly + dy[k],nrx = s.rx + dx[(k + 2) % 4],nry = s.ry + dy[(k + 2) % 4];
					bool move = false;
					if(nlx >= 0 && nlx < h && nly >= 0 && nly < w && !field[nlx][nly]) move = true;
					else{
						nlx = s.lx;
						nly = s.ly;
					}
					if(nrx >= 0 && nrx < h && nry >= 0 && nry < w && !field[nrx][nry]) move = true;
					else{
						nrx = s.rx;
						nry = s.ry;
					}
					if(move && !used[nlx][nly][nrx][nry]){
						used[nlx][nly][nrx][nry] = true;
						que.push({nlx,nly,nrx,nry});
					}
				}
			}
		}
		if(mi == 101) cout << "NA" << endl;
		else cout << mi << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int h,w;
int map[100][100];
int qtx[800000],qty[800000],qkx[800000],qky[800000];
int ql[800000];
int tail,head;
int ans;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
bool vis[60][60][60][60];
bool bend;
void BFS(int tx,int ty,int kx,int ky,int len){
	if(len==100)return;
	if(tx==kx&&ty==ky){
		ans=len;
		bend=true;
		return;
	}
	for(int i=0;i<4;i++){
		bool mt=false,mk=false;
		if(tx+dx[i]>=0&&tx+dx[i]<w&&ty+dy[i]>=0&&ty+dy[i]<h){
			if(map[ty+dy[i]][tx+dx[i]]==0){
				mt=true;
			}
		}
		if(kx-dx[i]>=0&&kx-dx[i]<w&&ky-dy[i]>=0&&ky-dy[i]<h){
			if(map[ky-dy[i]][kx-dx[i]]==0){
				mk=true;
			}
		}
		qtx[tail]=tx+mt*dx[i],qty[tail]=ty+mt*dy[i];
		qkx[tail]=kx-mk*dx[i],qky[tail]=ky-mk*dy[i];
		ql[tail]=len+1;
		tail++;
	}
}
int main(){
	while(true){
	cin>>w>>h;
	if(w==0&&h==0)break;
	for(int i=0;i<60;i++){
		for(int j=0;j<60;j++){
			for(int k=0;k<60;k++){
				for(int r=0;r<60;r++){
					vis[i][j][k][r]=false;
				}
			}
		}
	}
	int tx,ty,kx,ky;
	cin>>tx>>ty>>kx>>ky;
	tx--,ty--,kx--,ky--;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			cin>>map[i][j];
		}
	}
	ans=869121;
	qtx[0]=tx,qty[0]=ty,qkx[0]=kx,qky[0]=ky;
	ql[0]=0;
	tail=1,head=0;
	bend=false;
	while(true){
		if(tail==head)break;
		if(!vis[qtx[head]][qty[head]][qkx[head]][qky[head]]){
		vis[qtx[head]][qty[head]][qkx[head]][qky[head]]=true;
		BFS(qtx[head],qty[head],qkx[head],qky[head],ql[head]);
		}
		if(bend)break;
		head++;
	}
	if(ans==869121)cout<<"NA"<<endl;
	else cout<<ans<<endl;
	}
	return 0;
}

C++: /*
 * src.cpp
 *
 *  Created on: 2016/08/04
 *      Author: joi
 */

#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

const int MAX_SIZE=50;

int X,Y;
int tx,ty,kx,ky;
int de[MAX_SIZE][MAX_SIZE];

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

bool flg[50][50][50][50];

struct P{
	int x1,y1,x2,y2;
	int t;
	P(int x1=0,int y1=0,int x2=0,int y2=0,int t=0):x1(x1),y1(y1),x2(x2),y2(y2),t(t){};
};

int bfs(){
	queue<P> q;
	memset(flg,0,sizeof(flg));
	q.push(P(tx,ty,kx,ky,0));
	flg[tx][ty][kx][ky]=true;
	while (!q.empty()){
		P p=q.front();
		q.pop();
		if (p.t>=100){
			return -1;
		}
		if (p.x1==p.x2 && p.y1==p.y2){
			return p.t;
		}
		REP(i,4){
			int x1,y1,x2,y2;
			x1=p.x1+dx[i];
			y1=p.y1+dy[i];
			x2=p.x2+dx[(i+2)%4];
			y2=p.y2+dy[(i+2)%4];
			if (x1<0 || x1>=X || y1<0 || y1>=Y || de[y1][x1]==1){
				x1=p.x1;
				y1=p.y1;
			}
			if (x2<0 || x2>=X || y2<0 || y2>=Y || de[y2][x2]==1){
				x2=p.x2;
				y2=p.y2;
			}
			if (!flg[x1][y1][x2][y2]){
				q.push(P(x1,y1,x2,y2,p.t+1));
				flg[x1][y1][x2][y2]=true;
			}
		}
	}
	return -1;
}

int main(){
	do{
		scanf("%d %d",&X,&Y);
		if (X || Y){
			scanf("%d %d",&tx,&ty);
			scanf("%d %d",&kx,&ky);
			tx--;
			ty--;
			kx--;
			ky--;
			REP(i,Y){
				REP(j,X){
					scanf("%d",&de[i][j]);
				}
			}
			int ans=bfs();
			if (ans!=-1){
				printf("%d\n",ans);
			}else{
				printf("NA\n");
			}
		}
	}while(X || Y);
	return 0;
}