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 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)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(102)
	for len(pq) > 0 {
		now := &Status{}
		*now = *pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		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++
			if next.Turn <= 100 {
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		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 <cstdio>
#include <cstring>
#include <queue>
using namespace std;

struct S {
	int tx,ty;
	int kx,ky;
	int turn;
};

bool d[50][50];
bool vst[50][50][50][50];
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};

int main() {
	int X,Y;
	int tx,ty;
	int kx,ky;
	while(scanf("%d %d",&X,&Y),X||Y) {
		scanf("%d %d",&tx,&ty);
		scanf("%d %d",&kx,&ky);
		for(int j=0;j<Y;j++) {
			for(int i=0;i<X;i++) {
				scanf("%d",&d[i][j]);
			}
		}
		queue<S> q;
		bool ok=false;
		S s={tx-1,ty-1,kx-1,ky-1,0};
		q.push(s);
		memset(vst,false,sizeof(vst));
		while(!q.empty()) {
			S s=q.front();q.pop();
			vst[s.tx][s.ty][s.kx][s.ky]=true;
			if(s.turn>=100) break;
			if(s.tx==s.kx&&s.ty==s.ky) {
				printf("%d\n",s.turn);
				ok=true;
				break;
			}
			for(int i=0;i<4;i++) {
				int ntx=s.tx+dx[i],nty=s.ty+dy[i];
				int nkx=s.kx-dx[i],nky=s.ky-dy[i];
				if(0>ntx||ntx>=X||0>nty||nty>=Y||d[ntx][nty]) {
					ntx-=dx[i],nty-=dy[i];
				}
				if(0>nkx||nkx>=X||0>nky||nky>=Y||d[nkx][nky]) {
					nkx+=dx[i],nky+=dy[i];
				}
				if(!vst[ntx][nty][nkx][nky]) {
					S ns={ntx,nty,nkx,nky,s.turn+1};
					q.push(ns);
				}
			}
		}
		if(!ok) printf("NA\n");
	}
}

C++: #include<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct PP{
	int kx;
	int ky;
	int tx;
	int ty;
	int Z;
};
int w,h;
PP S;
bool A[53][53][53][53],D[53][53];
int main(){
	queue<PP> P;
	int d=0,i=0,j=0,l=-1;
	int tx[4]={ 1, 0,-1,0 };       
	int kx[4]={-1, 0, 1,0 };
	int ty[4]={ 0, 1, 0,-1 };
	int ky[4]={ 0, -1, 0,1};
	cin>>w>>h;
	while(w!=0||h!=0){
		memset(A,0,sizeof(A));
		for(i=0;i<=h+1;i++){
			for(j=0;j<=w+1;j++){
				D[i][j]=1;
			}
		}

		cin>>S.tx>>S.ty;
		cin>>S.kx>>S.ky;
		for(i=1;i<=h;i++){
			for(j=1;j<=w;j++){
				cin>>D[i][j];
			}
		}
		S.Z=0;
		P.push(S);
		if(S.tx==S.kx&&S.ty==S.ky){
			d=-1;
			cout<<S.Z<<endl;
		}
		while(d!=-1){
			l++;
			if(l==4){
				l=0;
				S=P.front();
				P.pop();
				if(P.empty()){
					cout<<"NA"<<endl;
					break;
				}
			}
			S=P.front();

			S.tx=S.tx+tx[l];
			S.ty=S.ty+ty[l];
			S.kx=S.kx+kx[l];
			S.ky=S.ky+ky[l];
			if(A[S.ty][S.tx][S.ky][S.kx]==1||(D[S.ty][S.tx]==1&&D[S.ky][S.kx]==1)){
				continue;
			}
			A[S.ty][S.tx][S.ky][S.kx]=1;

			if(D[S.ty][S.tx]==1){
				S.tx=S.tx-tx[l];
				S.ty=S.ty-ty[l];
			}
			if(D[S.ky][S.kx]==1){
				S.kx=S.kx-kx[l];
				S.ky=S.ky-ky[l];
			}
			//saka();
			S.Z++;
			P.push(S);
			if(S.tx==S.kx&&S.ty==S.ky){
				cout<<S.Z<<endl;
				break;
			}	
			if(S.Z==100){
				cout<<"NA"<<endl;
				break;
			}


		}
		while(!P.empty()){
			P.pop();
		}
		d=0;
		l=-1;
		cin>>w>>h;
	}	
	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;
typedef queue<int> qi;
typedef pair<int, int> pi;

int board[51][51], 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));

    map<pair<pi,pi>, bool>m; // t k
    queue<pii>tq, kq;
    tq.push(make_pair(ty, tx));
    kq.push(make_pair(ky, kx));
    m[make_pair(make_pair(ty, tx), make_pair(ky, kx))] = 1;
    int res = 1;
    while(!tq.empty()){
      if(res >= 100) break;
      //      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;
	  pair<pi, pi> next = make_pair(make_pair(nt.Y, nt.X), make_pair(nk.Y, nk.X));
	  if(m.count(next) == 1) continue;
	  if(nt == nk){
	    printf("%d\n", res);
	    //	    printf("%d %d %d %d\n", nt.Y, nt.X, nk.Y, nk.X);
	    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;
	  m[next] = 1;
	  tq.push(nt); kq.push(nk);
	}
      }
      res++;

    }
    //    printf("%d\n", (int)tq.size());
    puts("NA");
  end:;
  }
  return 0;
}