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

#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
const int inf = 1<<29;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int memo[50][50][50][50],mp[50][50];
int X,Y,tx,ty,kx,ky;

struct State{
  int tx,ty,kx,ky;
  State(int tx,int ty,int kx,int ky) : tx(tx), ty(ty), kx(kx), ky(ky) {;}
  State() {;}
};

inline bool range(int x,int m) {
  return (x >= 0 && x < m);
}

bool ok(int tx,int ty) {
  if(range(tx,X) && range(ty, Y) && mp[ty][tx] == 0) return true;
  return false;
}

int main() {
    int i,j,k,l,ans;
    while(cin>>X>>Y, X|Y) {
      cin>>tx>>ty>>kx>>ky;
      tx--,ty--,kx--,ky--;
      rep(i,50) rep(j,50) rep(k,50) rep(l,50) memo[i][j][k][l] = inf;
      ans = inf;
      memo[tx][ty][kx][ky] = 0;

      rep(i,Y) {
	rep(j,X) {
	  cin>>k;
	  mp[i][j] = k;
	}
      }

      queue<State> Q;
      Q.push(State(tx,ty,kx,ky));
      while(!Q.empty()) {

	State now = Q.front(); Q.pop();
	if(now.tx == now.kx && now.ty == now.ky) {
	  ans = memo[now.tx][now.ty][now.kx][now.ky];
	  break;
	}

	rep(i,4) {
	  int ntx = now.tx+dx[i],nty = now.ty+dy[i];
	  int nkx = now.kx-dx[i],nky = now.ky-dy[i];
	  if(ok(ntx,nty) && ok(nkx,nky) && memo[ntx][nty][nkx][nky] == inf) {
	    memo[ntx][nty][nkx][nky] = memo[now.tx][now.ty][now.kx][now.ky]+1;
	    Q.push(State(ntx,nty,nkx,nky));
	  }else if(ok(ntx,nty) && !ok(nkx,nky)) {
	    memo[ntx][nty][now.kx][now.ky] = memo[now.tx][now.ty][now.kx][now.ky]+1;
	    Q.push(State(ntx,nty,now.kx,now.ky));
	  }else if(ok(nkx,nky) && !ok(ntx,nty)) {
	    memo[now.tx][now.ty][nkx][nky] = memo[now.tx][now.ty][now.kx][now.ky]+1;
	    Q.push(State(now.tx,now.ty,nkx,nky));
	  }
	}
      }

      if(ans < inf) cout<<ans<<endl;
      else cout<<"NA"<<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[i], cy = a2 + dy[i];
			int ex = a3 - dx[i], ey = a4 - dy[i];
			if (x[cx][cy] == 1) { cx = a1; cy = a2; }
			if (x[ex][ey] == 1) { ex = a3; ey = a4; }
			if (dp[cx][cy][ex][ey] > dp[a1][a2][a3][a4] + 1) {
				dp[cx][cy][ex][ey] = dp[a1][a2][a3][a4] + 1;
				Q.push(make_tuple(cx, cy, ex, ey));
			}
		}
	}
	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] = 1;
		}
	}
}
int main() {
	while (true) {
		_memset();
		cin >> W >> H;
		if (H == 0 && W == 0) { break; }
		cin >> A2 >> A1 >> B2 >> B1;
		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;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;
typedef pair<P, P>PP;

int dx[]{ 1,-1,0,0 }, dy[]{ 0,0,1,-1 };
int mp[70][70];
int main() {
	int X, Y;
	while (scanf("%d%d", &X, &Y), X) {
		int tx, ty; scanf("%d%d", &tx, &ty); tx--; ty--;
		int kx, ky; scanf("%d%d", &kx, &ky); kx--; ky--;
		rep(i, Y)rep(j, X)scanf("%d", &mp[i][j]);
		map<PP, int>cnt;
		queue<PP>que;
		cnt[{ {tx, ty}, { kx,ky }}] = 1;
		que.push({ {tx,ty},{kx,ky} });
		while (!que.empty()) {
			PP p = que.front(); que.pop();
			if (cnt[p] > 100)continue;
			if (p.first == p.second) {
				printf("%d\n", cnt[p] - 1);
				goto goal;
			}
			rep(i, 4) {
				rep(j, 4) {
					int tnx = p.first.first + dx[i];
					int tny = p.first.second + dy[i];
					int knx = p.second.first - dx[i];
					int kny = p.second.second - dy[i];
					if (tnx < 0 || tnx >= X || tny < 0 || tny >= Y || mp[tnx][tny]) {
						tnx = p.first.first;
						tny = p.first.second;
					}
					if (knx < 0 || knx >= X || kny < 0 || kny >= Y || mp[knx][kny]) {
						knx = p.second.first;
						kny = p.second.second;
					}
					if (!cnt[{ {tnx, tny}, { knx,kny }}]) {
						cnt[{ {tnx, tny}, { knx,kny }}] = cnt[p] + 1;
						que.push({ { tnx, tny },{ knx,kny } });
					}
				}
			}
		}
		puts("NA");
	goal:;
	}
}