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 <iostream>
#include <queue>
using namespace std;

const unsigned char INF = 255;
int H,W;
class Point{
public:
  int tx;
  int ty;
  int kx;
  int ky;
  void set(int a,int b,int c,int d){
    tx = a;
    ty = b;
    kx = c;
    ky = d;
  }
};

int is_out_of_area(int y,int x){
  return x < 1 || x > W || y < 1 || y > H;
}
int main(){
  char F[52][52];
  unsigned char D[52][52][52][52];


  while(1){
    queue<Point> qa;
    Point p;
    int tx,ty,kx,ky;
    cin >> W >> H;
    if(W == 0 && H == 0)
    break;
    cin >> tx >> ty >> kx >> ky;

    for(int y=0;y<=H+1;y++){
      for(int x=0;x<=W+1;x++){
        F[y][x] = 1;
      }
    }
    for(int y=1;y<=H;y++){
      for(int x=1;x<=W;x++){
        int a;
        cin >> a;
        F[y][x] = a;
        for(int i=1;i<=H;i++){
          for(int j=1;j<=W;j++){
            D[y][x][i][j] = INF;
          }
        }
      }
    }

    p.set(tx,ty,kx,ky);
    qa.push(p);
    D[p.ty][p.tx][p.ky][p.kx] = 0;
    int counter=0;
    while(1){
      if(qa.empty()){
        cout << "NA" << counter<<endl;
        break;
      }
      p = qa.front();
      qa.pop();
      if(D[p.ty][p.tx][p.ky][p.kx] >= 99){
        cout << "NA" << endl;
        break;
      }
      if(p.tx == p.kx && p.ty == p.ky){
        cout << (int)D[p.ty][p.tx][p.ky][p.kx] << endl;
        break;
      }
      counter++;
      if(D[p.ty-1][p.tx][p.ky+1][p.kx] == INF){
          //cout << "a" << counter;
          int inc_ty = -1 , inc_ky = 1;
          if(is_out_of_area(p.ty-1,p.tx) || F[p.ty-1][p.tx]){
            inc_ty = 0;
          } else if(is_out_of_area(p.ky+1,p.kx) || F[p.ky+1][p.kx]){
            inc_ky = 0;
          }

          if(inc_ty  | inc_ky){
            Point q;
            q.set(p.tx,p.ty + inc_ty,p.kx,p.ky+inc_ky);
            qa.push(q);
            D[p.ty + inc_ty][p.tx][p.ky + inc_ky][p.kx] = D[p.ty][p.tx][p.ky][p.kx] + 1;
          }
      }

      if(D[p.ty+1][p.tx][p.ky-1][p.kx] == INF){
          //cout << "b" << counter;
          int inc_ty = 1 , inc_ky = -1;
          if(is_out_of_area(p.ty+1,p.tx) || F[p.ty+1][p.tx]){
            inc_ty = 0;
          } else if(is_out_of_area(p.ky-1,p.kx) || F[p.ky-1][p.kx]){
            inc_ky = 0;
          }

          if(inc_ty  | inc_ky){
            Point q;
            q.set(p.tx,p.ty + inc_ty,p.kx,p.ky+inc_ky);
            qa.push(q);
            D[p.ty + inc_ty][p.tx][p.ky + inc_ky][p.kx] = D[p.ty][p.tx][p.ky][p.kx] + 1;
          }
      }

      if(D[p.ty][p.tx-1][p.ky][p.kx+1] == INF){
          //cout << "c" << counter;
          int inc_tx = -1 , inc_kx = 1;
          if(is_out_of_area(p.ty,p.tx + inc_tx) || F[p.ty][p.tx + inc_tx]){
            inc_tx = 0;
          } else if(is_out_of_area(p.ky,p.kx + inc_kx) || F[p.ky][p.kx + inc_kx]){
            inc_kx = 0;
          }

          if(inc_tx  | inc_kx){
            Point q;
            q.set(p.tx + inc_tx,p.ty,p.kx + inc_kx,p.ky);
            qa.push(q);
            D[p.ty][p.tx + inc_tx][p.ky][p.kx + inc_kx] = D[p.ty][p.tx][p.ky][p.kx] + 1;
          }
      }
      if(D[p.ty][p.tx+1][p.ky][p.kx-1] == INF){
          //cout << "d" << counter;
          int inc_tx = 1 , inc_kx = -1;
          if(is_out_of_area(p.ty,p.tx + inc_tx) || F[p.ty][p.tx + inc_tx]){
            inc_tx = 0;
          } else if(is_out_of_area(p.ky,p.kx + inc_kx) || F[p.ky][p.kx + inc_kx]){
            inc_kx = 0;
          }

          if(inc_tx  | inc_kx){
            Point q;
            q.set(p.tx + inc_tx,p.ty,p.kx + inc_kx,p.ky);
            qa.push(q);
            D[p.ty][p.tx + inc_tx][p.ky][p.kx + inc_kx] = D[p.ty][p.tx][p.ky][p.kx] + 1;
          }
      }
    }
  }
  return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};
struct state{ int ay,ax,by,bx,cnt; };
int H,W;
int t[50][50];
int visited[50][50][50][50];
bool inField(int y,int x){
  if(y<0||y>=H)return false;
  if(x<0||x>=W)return false;
  if(t[y][x]==1)return false;
  return true;
}
void solve(state s){
  queue < state > Q;
  Q.push(s);
  visited[s.ay][s.ax][s.by][s.bx]=true;
  while(!Q.empty()){
    state now = Q.front(); Q.pop();
    int ay=now.ay,ax=now.ax,by=now.by,bx=now.bx;
    if(now.cnt>100)continue;
    if(ay==by&&ax==bx){ cout<<now.cnt<<endl; return; }
    for(int i=0;i<4;i++){
      int nay=ay+dy[i],nax=ax+dx[i];
      int nby=by-dy[i],nbx=bx-dx[i];
      if(!inField(nay,nax))nay=ay,nax=ax;
      if(!inField(nby,nbx))nby=by,nbx=bx;
      if(visited[nay][nax][nby][nbx])continue;
      visited[nay][nax][nby][nbx]=true;
      Q.push( (state){nay,nax,nby,nbx,now.cnt+1} );
    }
  }
  cout<<"NA"<<endl;
}

int main(){
  while(1){
    cin>>W>>H;
    if(W==0&&H==0)break;
    state s;
    cin>>s.ax>>s.ay>>s.bx>>s.by;
    s.ay--,s.ax--,s.by--,s.bx--;
    s.cnt=0;
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
	cin>>t[i][j];
	for(int k=0;k<H;k++){
	  for(int l=0;l<W;l++){
	    visited[i][j][k][l]=false;
	  }
	}
      }
    }
    solve(s);
  }
}