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] == inf) {
	    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] == inf) {
	    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++: #include<iostream>
#include<utility>
#include<queue>
#include<map>
using namespace std;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int main() {
	int W, H, tx, ty, kx, ky;
	bool d[52][52];
	map<pair<pair<int, int>, pair<int, int> >,bool> m;
	pair<pair<int, int>, pair<int, int> >num;
	pair<pair<int, int>, pair<int, int> >copy;
	while (true) {
		cin >> W >> H;
		if (W == 0)break;
		for (int i = 0; i < H+2; i++) {
			for (int j = 0; j < W+2; j++) {
				d[i][j] = 1;
			}
		}
		cin >> tx >> ty >> kx >> ky;
		for (int i = 1; i < H + 1; i++) {
			for (int j = 1; j < W + 1; j++) {
				cin >> d[j][i];
			}
		}
		num.first.first = tx;
		num.first.second = ty;
		num.second.first = kx;
		num.second.second = ky;
		queue<pair<pair<int, int>, pair<int, int> > > q;
		bool flg = true;
		q.push(num);
		int qsize = q.size();
		int loopcount = 0;
		while (!q.empty()) {
			num = q.front();
			q.pop();
			if (qsize == 0) {
				qsize = q.size()+1;
				loopcount++;
				if (loopcount >= 100) {
					cout << "NA" << endl;
					flg = false;
					break;
				}
			}
			qsize--;
			if (num.first.first == num.second.first && num.first.second == num.second.second) {
				cout << loopcount << endl;
				flg = false;
				break;
			}
			for (int i = 0; i < 4; i++) {
				copy.first.first = num.first.first+dx[i];
				copy.first.second = num.first.second+dy[i];
				if (d[copy.first.first][copy.first.second]) {
					copy.first.first -= dx[i];
					copy.first.second -= dy[i];
				}
				copy.second.first =num.second.first-dx[i];
				copy.second.second =num.second.second- dy[i];
				if (d[copy.second.first][copy.second.second]) {
					copy.second.first += dx[i];
					copy.second.second += dy[i];
				}
				if (!m[copy]) {
					m[copy] = true;
					q.push(copy);
				}
			}
		}
		if (flg) {
			cout << "NA" << endl;
		}
	}
	return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps=1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt"
int memo[52][52][52][52];
struct aa {
	int tx;
	int ty;
	int kx;
	int ky;
	int time;
};
const int dx[4] = { -1,0,1,0 };
const int dy[4] = { 0,1,0,-1 };
int main() {
	while (1) {
		for (int i = 0; i < 52; ++i) {
			for (int j = 0; j < 52; ++j) {
				for (int k = 0; k < 52; ++k) {
					for (int l = 0; l < 52; ++l) {
						memo[i][j][k][l] = 1e9;
					}
				}
			}
		}
		int W, H; cin >> W >> H;
		if (!W)break;
		int tx, ty, kx, ky; cin >> tx >> ty >> kx >> ky;
		vector<vector<int>>field(H+2, vector<int>(W+2,1));
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++j) {
				cin >> field[i+1][j+1];
			}
		}
		queue<aa>que;
		que.push(aa{ tx,ty,kx,ky });
		memo[tx][ty][kx][ky] = 0;
		int ans = -1;
		while (!que.empty()) {
			aa atop=que.front();
			que.pop();
			const int ntx = atop.tx;
			const int nty = atop.ty;
			const int nkx = atop.kx;
			const int nky = atop.ky;
			if (ntx == nkx&&nty == nky) {
				ans = atop.time;
				break;
			}
			for (int way = 0; way < 4; ++way) {
				int nexttx = ntx + dx[way];
				int nextty = nty + dy[way];
				way = (way + 2) % 4;
				int nextkx = nkx + dx[way];
				int nextky = nky + dy[way];
				way = (way + 2) % 4;
				if (field[nextty][nexttx]) {
					nexttx = ntx; nextty = nty;
				}
				if (field[nextky][nextkx]) {
					nextkx = nkx; nextky = nky;
				}
				if (memo[nexttx][nextty][nextkx][nextky]>atop.time + 1) {
					memo[nexttx][nextty][nextkx][nextky] = atop.time + 1;
					que.push(aa{ nexttx,nextty,nextkx,nextky,atop.time + 1 });
				}
			}

		}
		if (ans != -1) {
			cout << ans << endl;
		}
		else {
			cout << "NA" << endl;
		}
	}
	return 0;
}