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 now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			continue
		}
		if ans<=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<algorithm>
using namespace std;
int h,w;
int map[100][100];
int qtx[1000000],qty[1000000],qkx[1000000],qky[1000000];
int ql[1000000];
int tail,head;
int ans;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
bool vis[100][100][100][100];
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++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(x,b) ((x)>=0&&(x)<(b))
#define Y first
#define X second
#define INF 1 << 30

typedef pair<int, int> pii;

int board[50][50], Y, X;
int dx[] = {0,1,0,-1}, dy[] = {1,0,-1,0};
bool f[51][51][51][51];

pii nextp1(pii now, int i){
  pii next = now;
  next.Y += dy[i];
  next.X += dx[i];
  //  printf("%d %d\n", next.Y, next.X);
  //  if(BW(next.Y, Y)) puts("YES");
  //  if(BW(next.X, X)) puts("YES");
  //  printf("%d\n", board[next.Y][next.X]);
  if(BW((next.Y), Y) && BW((next.X), X) && board[next.Y][next.X] == 0) return next;
  return now;
}

pii nextp2(pii now, int i){
  pii next = now;
  next.Y += -1 * dy[i];
  next.X += -1 * dx[i];
  if(BW(next.Y, Y) && BW(next.X, X) && board[next.Y][next.X] == 0) return next;
  return now;
}
     
int main(){
  while(scanf("%d%d", &X,  &Y) && X+Y){
    int tx, ty, kx, ky;
    scanf("%d%d%d%d", &tx, &ty, &kx, &ky); tx--; ty--; kx--; ky--;
    rep(i, X) rep(j, Y) scanf("%d", &board[i][j]);
    memset(f, 0, sizeof(f));

    queue<pii>tq, kq;
    tq.push(make_pair(ty, tx));
    kq.push(make_pair(ky, kx));
    f[ty][tx][ky][kx] = 1;
    int res = 1;
    while(!tq.empty()){
      //      printf("%d", res);
      int qsize = (int)tq.size();
      //      printf(" %d\n", qsize);
      rep(i, qsize){
	pii t = tq.front(); tq.pop();
	pii k = kq.front(); kq.pop();
	//	printf("%d %d %d %d\n", t.Y, t.X, k.Y, k.X);
	rep(j, 4){
	  pii nt = nextp1(t, j), nk = nextp2(k, j);
	  //	  printf("%d %d %d %d\n", nt.Y, nt.X, nk.Y, nk.X);

	  if(f[nt.Y][nt.X][nk.Y][nk.X]) continue;

	  if(nt == nk){
	    printf("%d\n", res);
	    goto end;
	  }
	  //	  fprintf(stderr, "%d %d %d %d\n", nt.Y, nt.X, nk.Y, nk.X);
	  f[nt.Y][nt.X][nk.Y][nk.X] = 1;
	  tq.push(nt); kq.push(nk);
	}
      }
      res++;
      if(res > 100) break;
    }
    //    printf("%d\n", (int)tq.size());
    puts("NA");
  end:;
  }
  return 0;
}