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)
	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<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[50][50];
short int  dp[50][50][50][50];

short int solve(int tx, int ty, int kx, int ky){
  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) + 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[i][j]);
	dp[i][j][i][j] = 0;
      }
    }
    short int ans = solve(tx - 1, ty - 1, kx - 1, ky - 1);
    if(ans > 100)
      puts("NA");
    else
      printf("%d\n", ans);
  }
}

C++: #include<iostream>
#include<queue>
using namespace std;
struct xy{
  int tx,ty;
  int kx,ky;
  int ti;
};
int x,y;
xy tk;
int m[51][51],v[51][51][51][51]={};
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};


bool g(int a,int b){
  if(a<1 || a>x || b<1 || b>y) return 0;
  return 1;
}

int bfs(){
  queue<xy> q;
  xy t,tmp;
  int ta,tb,ka,kb,ans=10000,tim,cnt=0;
  q.push(tk);
  while(!q.empty()){
    t=q.front(),q.pop();
        for(int i=0;i<4;i++){
      ta=t.tx+dx[i],tb=t.ty+dy[i],ka=t.kx-dx[i],kb=t.ky-dy[i],tim=t.ti+1;
      if(g(ta,tb) || g(ka,kb)){
	cnt++;
	if(!g(ta,tb))ta=t.tx,tb=t.ty;
	if(!g(ka,kb))ka=t.kx,kb=t.ky;

	if(m[ta][tb]==1) tmp.tx=t.tx,tmp.ty=t.ty;
	else tmp.tx=ta,tmp.ty=tb;
	
	if(m[ka][kb]==1) tmp.kx=t.kx,tmp.ky=t.ky;
	else tmp.kx=ka,tmp.ky=kb;
	
	if(v[tmp.tx][tmp.ty][tmp.kx][tmp.ky]==1)continue;
	if(m[ka][kb]==1 && m[ta][tb]==1)continue;
		tmp.ti=tim;
		v[tmp.tx][tmp.ty][tmp.kx][tmp.ky]=1;
	if(tmp.tx==tmp.kx && tmp.ty==tmp.ky){
	  if(ans>tmp.ti) ans=tmp.ti;
	  continue;
	}
	
       	if(tmp.ti>=100) break;
	q.push(tmp);
      }
    }
  }
  return ans;
}

int main(){
  while(1){
    int ans;
    cin>>x>>y;
    if(x+y==0) break;
    cin>>tk.tx>>tk.ty>>tk.kx>>tk.ky;
    for(int i=1;i<=x;i++)
      for(int j=1;j<=y;j++)
	for(int k=1;k<=x;k++)
	  for(int l=1;l<=y;l++) v[i][j][k][l]=0;
      v[tk.tx][tk.ty][tk.kx][tk.ky]=1;
    tk.ti=0;
    for(int i=1;i<=y;i++)
      for(int j=1;j<=x;j++)
	cin>>m[j][i];
      
       ans=bfs();
    if(ans<100) cout<<ans<<endl;
    else cout<<"NA"<<endl;
  }
  
  return 0;
}

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[50][50];
short int  dp[50][50][50][50];

short int solve(int tx, int ty, int kx, int ky, int depth){
  if(depth > 400)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[i][j][i][j] = 0;
      }
    }
    short int ans = solve(tx - 1, ty - 1, kx - 1, ky - 1, 0);
    if(ans >= 100)
      puts("NA");
    else
      printf("%d\n", ans);
  }
}