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 ans <= now.Turn {
			continue
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = now.Turn

		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = 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<iostream>
#include<queue>
using namespace std;

const int INF =100000000;

class Point{
public:
  int tx;
  int ty;
  int kx;
  int ky;
};

int main(){
  while(1){
      int N,M;
      cin>>N>>M;
      if(N==0&&M==0)return 0;
      int o_tx,o_ty;
      int o_kx,o_ky;
      cin>>o_tx>>o_ty;
      cin>>o_kx>>o_ky;
      int F[102][102];
      for(int y=0;y<=N+1;y++){
        for(int x=0;x<=M+1;x++){
          F[y][x]=1;
        }
      }


      for(int y=1;y<=N;y++){
        for(int x=1;x<=M;x++){
          cin>>F[y][x];
        }
      }

      int D[102][102];
      for(int y=1;y<=N;y++){
        for(int x=1;x<=M;x++){
          D[y][x]=INF;
        }
      }
      queue<Point> que;
      Point p;
      p.tx=o_tx;p.ty=o_ty;
      p.kx=o_kx;p.ky=o_ky;
      que.push(p);
      D[p.ty][p.tx]=0;

      while(!que.empty()){
        p=que.front();que.pop();
        cout<<D[p.ty][p.tx]<<endl;
        if(D[p.ty][p.tx]>=15)break;
        if(p.tx==p.kx&&p.ty==p.ky){
          cout<<D[p.ty][p.tx]<<endl;
          break;
        }
        if(F[p.ty-1][p.tx]!=1 || F[p.ky+1][p.kx]!=1){
          Point q;
          if(F[p.ty-1][p.ty]!=1){
            q.tx=p.tx;q.ty=p.ty-1;
          }
          if(F[p.ky+1][p.kx]!=1){
            q.kx=p.kx;q.ky=p.ky+1;
          }
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;

        }
        if(F[p.ty+1][p.tx]!=1 || F[p.ky-1][p.kx]!=1){
          Point q;
          if(F[p.ty+1][p.tx]!=1){
            q.tx=p.tx;q.ty=p.ty+1;
          }
          if(F[p.ky-1][p.kx]!=1){
            q.kx=p.kx;q.ky=p.ky-1;
          }
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
        if(F[p.ty][p.tx-1]!=1 || F[p.ky][p.kx+1]!=1){
          Point q;
          if(F[p.ty][p.tx-1]!=1){
            q.tx=p.tx-1;q.ty=p.ty;
          }
          if(F[p.ky][p.kx+1]!=1){
            q.kx=p.kx+1;q.ky=p.ky;
          }
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
        if(F[p.ty][p.tx+1]!=1 || F[p.ky][p.kx-1]!=1){
          Point q;
          if(F[p.ty][p.tx+1]!=1){
            q.tx=p.tx+1;q.ty=p.ty;
          }
          if(F[p.ky][p.kx-1]!=1){
            q.kx=p.kx-1;q.ky=p.ky;
          }
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
      }
      if(p.tx!=p.kx || p.ty!=p.ky){
        cout<<"NA\n";
      }
    }
  return 0;
}

C++: using namespace std;
#include <iostream>
#include <string>
#include <set>
#include <functional>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <queue>
#define INF 10000
typedef pair<int,int> p;
typedef pair<p,p> pp;
int dp[51][51][51][51],stx,sty,skx,sky,X,Y;
int dx[]={-1,0,0,1};
int dy[]={0,-1,1,0};
bool map[51][51];
class state{
public:
	int tx,ty,kx,ky;
	state(){}
	void inp(int tx_,int ty_,int kx_,int ky_){
		tx=tx_;
		ty=ty_;
		kx=kx_;
		ky=ky_;
		return;
	}
	void fix(int X,int Y){
		if(tx<1)tx=1;
		else if(X<tx)tx=X;
		if(ty<1)ty=1;
		else if(Y<ty)ty=Y;
		if(kx<1)kx=1;
		else if(X<kx)kx=X;
		if(ky<1)ky=1;
		else if(Y<ky)ky=Y;
		return;
	}
	void show(){
		//printf("dp[%d][%d][%d][%d]:%d\n",tx,ty,kx,ky,dp[tx][ty][kx][ky]);
		return;
	}
};
queue<state> task;
int bfs();
int main()
{
	while(cin>>X>>Y&&(X||Y)){
		fill(dp[0][0][0],dp[51][0][0],INF);
		cin>>stx>>sty>>skx>>sky;
		for(int y=1;y<=Y;y++)
			for(int x=1;x<=X;x++)cin>>map[x][y];
		int ans=bfs();
		if(ans==-1)cout<<"NA"<<endl;
		else cout<<ans<<endl;
	}
    return 0;
}
int bfs(){
	while(!task.empty())task.pop();
	state s;s.inp(stx,sty,skx,sky);task.push(s);
	dp[stx][sty][skx][sky]=0;
	while(!task.empty()){
		state t=task.front();task.pop();
		t.show();
		if(t.tx==t.kx&&t.ty==t.ky)return dp[t.tx][t.ty][t.kx][t.ky];
		if(dp[t.tx][t.ty][t.kx][t.ky]>=100)return -1;
		for(int i=0;i<4;i++){
			int ttx=t.tx+dx[i];
			int tty=t.ty+dy[i];
			int tkx=t.kx-dx[i];
			int tky=t.ky-dy[i];
			state a;a.inp(ttx,tty,tkx,tky);
			a.fix(X,Y);
			if(map[a.tx][a.ty]){a.tx=t.tx;a.ty=t.ty;}
			if(map[a.kx][a.ky]){a.kx=t.kx;a.ky=t.ky;}
			if(dp[a.tx][a.ty][a.kx][a.ky]==INF){
				dp[a.tx][a.ty][a.kx][a.ky]=dp[t.tx][t.ty][t.kx][t.ky]+1;
				task.push(a);
				a.show();
			}
		}
	}
	return -1;
}