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(101)
	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
			break
		}
		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 == 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<cstring>
#include<queue>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
const int inf = 1<<29;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int memo[50][50][50][50],mp[50][50];
int X,Y,tx,ty,kx,ky;

struct State{
  int tx,ty,kx,ky;
  State(int tx,int ty,int kx,int ky) : tx(tx), ty(ty), kx(kx), ky(ky) {;}
  State() {;}
};

bool ok(int tx,int ty,int kx,int ky) {
  if(tx >= 0 && tx < X && ty >= 0 && ty < Y
     && kx >= 0 && kx < X && ky >= 0 && ky < Y) 
       if(mp[ty][tx] == 0 && mp[ky][kx] == 0) return true;
       return false;
}

int main() {
    int i,j,k,l,ans;
    while(cin>>X>>Y, X|Y) {
      cin>>tx>>ty>>kx>>ky;
    tx--,ty--,kx--,ky--;
    rep(i,50) rep(j,50) rep(k,50) rep(l,50) memo[i][j][k][l] = inf;
    ans = inf;
    memo[tx][ty][kx][ky] = 0;

    rep(i,Y) {
      rep(j,X) {
	cin>>k;
	mp[i][j] = k;
      }
    }

    queue<State> Q;
    Q.push(State(tx,ty,kx,ky));
    while(!Q.empty()) {

      State now = Q.front(); Q.pop();
      if(now.tx == now.kx && now.ty == now.ky) {
	ans = min(ans,memo[now.tx][now.ty][now.kx][now.ky]);
	break;
      }

      rep(i,4) {
	int ntx = now.tx+dx[i],nty = now.ty+dy[i];
	int nkx = now.kx-dx[i],nky = now.ky-dy[i];
	if(ok(ntx,nty,nkx,nky) && memo[ntx][nty][nkx][nky] == inf) {
	  memo[ntx][nty][nkx][nky] = memo[now.tx][now.ty][now.kx][now.ky]+1;
	  Q.push(State(ntx,nty,nkx,nky));
	}
      }


    }
    if(ans < inf) cout<<ans<<endl;
    else cout<<"NA"<<endl;
  }
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 1<<10

int xs[] = {0, 1, 0, -1}, ys[] = {1, 0, -1, 0};
int x, y;
int field[55][55];
short int  dp[55][55][55][55];

short int solve(int tx, int ty, int kx, int ky, int depth){
  if(depth > INF)return INF;
  int ntx, nty, nkx, nky;
  if(dp[tx][ty][kx][ky] != -1){
    return dp[tx][ty][kx][ky];
  }
  dp[tx][ty][kx][ky] = INF;
  for(int i = 0;i < 4;i++){
    ntx = tx + xs[i];
    nty = ty + ys[i];
    nkx = kx - xs[i];
    nky = ky - ys[i];
    if(ntx < 0 || ntx >= x || nty < 0 || nty >= y || field[ntx][nty] == 1){
      ntx = tx;
      nty = ty;
    }
    if(nkx < 0 || nkx >= x || nky < 0 || nky >= y || field[nkx][nky] == 1){
      nkx = kx;
      nky = ky;
    }
    dp[tx][ty][kx][ky] = min(dp[tx][ty][kx][ky], (short int) (solve(ntx, nty, nkx, nky, depth + 1) + 1));
  }
  return dp[tx][ty][kx][ky];
}

int main(){
  int tx, ty, kx, ky;
  while(true){
    scanf("%d%d", &x, &y);
    memset(dp, -1, sizeof(dp));
    if(x == 0 && y == 0) return 0;
    scanf("%d%d", &tx, &ty);
    scanf("%d%d", &kx, &ky);
    for(int i = 0;i < y;i++){
      for(int j = 0;j < x;j++){
	scanf("%d", &field[j][i]);
	dp[j][i][j][i] = 0;
      }
    }
    short int ans = solve(tx - 1, ty - 1, kx - 1, ky - 1, 0);
    if(ans >= 100)
      puts("NA");
    else
      printf("%d\n", ans);
  }
}