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<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;


struct S{
  S(){};
  int tx,ty,kx,ky;
};
int X,Y;
S s;
vector<vector<int> > f;

bool input(){
  f.clear();
  s=S();
  cin>>X>>Y;
  if(X==0&&Y==0)return false;
  cin>>s.tx>>s.ty;
  cin>>s.kx>>s.ky;
  //swap(s.tx,s.ty);
  //swap(s.kx,s.ky);
  vector<int> kabe;
  for(int i=0;i<X+2;i++){
    kabe.push_back(1);
  }
  f.push_back(kabe);
  for(int i=0;i<Y;i++){
    vector<int> tt;
    tt.push_back(1);
    for(int j=0;j<X;j++){
      int tmp;
      cin>>tmp;
      tt.push_back(tmp);
    }
    tt.push_back(1);
    f.push_back(tt);
  }
  f.push_back(kabe);
  return true;
}

int vx[]={0,0,1,-1};
int vy[]={1,-1,0,0};
int used[60][60][60][60];
queue<S> q;
int bfs(S pos){
  memset(used,-1,(60*60*60*60));
  q = queue<S>();
  q.push(pos);
  used[pos.tx][pos.ty][pos.kx][pos.ky]=0;
  while(!q.empty()){
    S now = q.front();q.pop();
    if(used[now.tx][now.ty][now.kx][now.ky]>=100){
      return -1;
    }
    if(now.tx==now.kx&&now.ty==now.ky){
      return used[now.tx][now.ty][now.kx][now.ky];
    }
    for(int i=0;i<4;i++){
      S tmp = now;
      bool a,b;
      if(a=(f[tmp.tx+vx[i]][tmp.ty+vy[i]]!=1)){
        tmp.tx += vx[i];
        tmp.ty += vy[i];
      }
      if(b=(f[tmp.kx-vx[i]][tmp.ky-vy[i]]!=1)){
        tmp.kx -= vx[i];
        tmp.ky -= vy[i];
      }
      if((!(a||b))||(used[tmp.tx][tmp.ty][tmp.kx][tmp.ky]!=-1)){
        continue;
      }
      used[tmp.tx][tmp.ty][tmp.kx][tmp.ky]=used[now.tx][now.ty][now.kx][now.ky]+1;
      q.push(tmp);
    }
  }
  return -1;
}

int solve(){
  return bfs(s);
}

int main(){
  while(input()){
    int ans = solve();
    if(ans>=0){
      cout<<ans<<endl;
    }else{
      cout<<"NA"<<endl;
    }
  }
}

C++: #include<iostream>
#include<queue>
#include<map>
using namespace std;
const int INF=(1<<21);
typedef pair<int,int> P;
int x,y;
int tx,ty;
int kx,ky;
int t_check[50][50];
int k_check[50][50];
int depart[50][50];
int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int ans=0;

int bfs(){
  queue<P> t_que;
  queue<P> k_que;

  for(int i=0;i<y;i++){
    for(int j=0;j<x;j++){
      t_check[i][j]=k_check[i][j]=INF;
    }
  }

  t_check[ty][tx]=0;
  k_check[ky][kx]=0;

  t_que.push(P(ty,tx));
  k_que.push(P(ky,kx));

  while(t_que.size()){
    P tp=t_que.front();t_que.pop();
    P kp=k_que.front();k_que.pop();
    if(tp.first==kp.first && tp.second==kp.second){
      return t_check[tp.first][tp.second];
    }

    for(int i=0;i<4;i++){
      int tnx=tp.second+dx[i];
      int tny=tp.first+dy[i];
      int knx=kp.second-(dx[i]);
      int kny=kp.first-(dy[i]);

      if(0<=tnx && tnx<x && 0<=tny && tny<y && depart[tny][tnx]!=1 && t_check[tny][tnx]==INF  &&  0<=knx && knx<x && 0<=kny && kny<y && depart[kny][knx]!=1 && k_check[kny][knx]==INF){

	t_que.push(P(tny,tnx));
	k_que.push(P(kny,knx));
	t_check[tny][tnx]=t_check[tp.first][tp.second]+1;
	k_check[kny][knx]=k_check[kp.first][kp.second]+1;

      }
    }
    if(!t_que.size()){
      return 0;
    }
  }
}
int main(){
  while(1){
    cin>> x>> y;
  if(x==0 && y==0){
    break;
  }
  cin>> tx>> ty;
  cin>> kx>> ky;
  for(int i=0;i<y;i++){
    for(int j=0;j<x;j++){
      cin>> depart[i][j];
    }
  }
  ans=bfs();
  if(ans==0){
    cout<< "NA"<<endl;
  }else{
    cout<< ans<< endl;
  }
  }
}

C++: //1.includes
#include<iostream>
#include<queue>
#include<tuple>
#include<algorithm>
using namespace std;
//2.defines
#define MAX_N 60
#define INF 1000000000
//3.variables
int dp[MAX_N][MAX_N][MAX_N][MAX_N];
int H, W, A1, A2, B1, B2;
int x[MAX_N][MAX_N];
queue<tuple<int, int, int, int>>Q;
//4.functions
int solve() {
	dp[A1][A2][B1][B2] = 0;
	Q.push(make_tuple(A1, A2, B1, B2));
	while (!Q.empty()) {
		tuple<int, int, int, int>tup = Q.front();
		Q.pop();
		int a1 = get<0>(tup);
		int a2 = get<1>(tup);
		int a3 = get<2>(tup);
		int a4 = get<3>(tup);
		int dx[4] = { 1,0,-1,0 };
		int dy[4] = { 0,-1,0,1 };
		for (int i = 0; i < 4; i++) {
			int cx = a1 + dx[4], cy = a2 + dy[4];
			int ex = a3 - dx[4], ey = a4 - dy[4];
			if (x[cx][cy] == 1) { cx = a1; cy = a2; }
			if (x[ex][ey] == 1) { ex = a3; ey = a4; }
			if (dp[cx][cy][ex][ey] == INF) {
				dp[cx][cy][ex][ey] = dp[a1][a2][a3][a4] + 1;
			}
		}
	}
	int minx = INF;
	for (int i = 1; i <= H; i++) {
		for (int j = 1; j <= W; j++) {
			minx = min(minx, dp[i][j][i][j]);
		}
	}
	return minx;
}
void _memset() {
	for (int i = 0; i < MAX_N; i++) {
		for (int j = 0; j < MAX_N; j++) {
			for (int k = 0; k < MAX_N; k++) {
				for (int l = 0; l < MAX_N; l++) {
					dp[i][j][k][l] = INF;
				}
			}
		}
	}
	for (int i = 0; i < MAX_N; i++) {
		for (int j = 0; j < MAX_N; j++) {
			x[i][j] = 0;
		}
	}
}
int main() {
	while (true) {
		_memset();
		cin >> H >> W;
		if (H == 0 && W == 0) { break; }
		cin >> A1 >> A2 >> B1 >> B2;
		for (int i = 1; i <= H; i++) {
			for (int j = 1; j <= W; j++) {
				cin >> x[i][j];
			}
		}
		int v = solve();
		if (v >= 100) { cout << "NA" << endl; }
		else { cout << v << endl; }
	}
	return 0;
}