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.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 {
		heap.Init(&pq)
		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 <iostream>
#include <cstring>
#include <queue>
using namespace std;

class State{
public:
  int x1,y1,x2,y2,cost;

  State(int tx1,int ty1,int tx2,int ty2,int tcost){
    x1 = tx1;
    y1 = ty1;
    x2 = tx2;
    y2 = ty2;
    cost = tcost;
  }
};

int w,h;
bool t[52][52];
bool closed[52][52][52][52];

int dx1[] = {-1,1,0,0};
int dx2[] = {1,-1,0,0};
int dy1[] = {0,0,1,-1};
int dy2[] = {0,0,-1,1};

int main(void){
  while(cin>>w>>h && (w||h)){
    int x1,y1,x2,y2;
    cin>>x1>>y1>>x2>>y2;
    x1--; y1--; x2--; y2--;

    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
        cin>>t[i][j];
      }
    }

    int ans = -1;
    queue<State> open;

    memset(closed,0,sizeof(closed));
    closed[x1][y1][x2][y2] = true;
    open.push(State(x1,y1,x2,y2,0));

    while(!open.empty()){
      State st = open.front(); open.pop();
      if(st.cost >= 100) break;

      if(st.x1 == st.x2 && st.y1 == st.y2){
        ans = st.cost;
        break;
      }

      for(int i=0;i<4;i++){
        int nx1 = st.x1 + dx1[i];
        int ny1 = st.y1 + dy1[i];
        int nx2 = st.x2 + dx2[i];
        int ny2 = st.y2 + dy2[i];
        State nst = st;
        nst.cost++;

        if(nx1>=0 && nx1<w && ny1>=0 && ny1<h && !t[ny1][nx1]){
          nst.x1 = nx1;
          nst.y1 = ny1;
        }
        if(nx2>=0 && nx2<w && ny2>=0 && ny2<h && !t[ny2][nx2]){
          nst.x2 = nx2;
          nst.y2 = ny2;
        }

        if(!closed[nst.x1][nst.y1][nst.x2][nst.y2]){
          closed[nst.x1][nst.y1][nst.x2][nst.y2] = true;
          open.push(nst);
        }
      }
    }

    if(ans == -1)
      cout<<"NA\n";
    else
      cout<<ans<<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 < 50; ++i) {
			for (int j = 0; j < 50; ++j) {
				for (int k = 0; k < 50; ++k) {
					for (int l = 0; l < 50; ++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;
}

C++: #include <iostream>
#include <queue>

typedef std::pair<int, int> P; //(x,y)
typedef std::pair<P, P> PP;
typedef std::pair<PP, int> D;

int x, y;
int map[51][51];
bool visit[51][51][51][51];

int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};

bool back(P p){
	if(map[p.second][p.first])return true;
	else if(p.second < 0 || p.second >= y || p.first < 0 || p.first >= x)return true;
	else return false;
}

int main(){
	while(true){
		for(int i = 0; i < 51; ++i)for(int j = 0; j < 51; ++j)for(int k = 0; k < 51; ++k)for(int l = 0; l < 51; ++l)visit[i][j][k][l] = false;
		
		std::cin >> x >> y;
		if(x == 0 && y == 0)break;
		
		P t, k;
		std::cin >> t.first >> t.second;
		std::cin >> k.first >> k.second;
		--t.first, --t.second;
		--k.first, --k.second;

		for(int i = 0; i < y; ++i){
			for(int j = 0; j < x; ++j){
				std::cin >> map[i][j];
			}
		}

		bool f = false;

		std::queue<D> que;
		que.push(D(PP(t, k), 0));
		
		visit[t.first][t.second][k.first][k.second] = true;

		while(!que.empty()){
			D d = que.front();
			que.pop();
			
			P ct = d.first.first, ck = d.first.second;
			
			if(d.second >= 100){
				break;
			}
			if(ct == ck){
				f = true;
				std::cout << d.second << std::endl;
				break;
			}
			
			for(int i = 0; i < 4; ++i){
				P nt = ct, nk = ck;
				nt.first += dx[i]; nt.second += dy[i];
				nk.first -= dx[i]; nk.second -= dy[i];
				
				if(back(nt))nt = ct;
				if(back(nk))nk = ck;
				
				if(!visit[nt.first][nt.second][nk.first][nk.second]){
					visit[nt.first][nt.second][nk.first][nk.second] = true;	
					que.push(D(PP(nt, nk), d.second + 1));
				}
			}
		}
		
		if(!f)std::cout << "NA" << std::endl;
	}
	return 0;
}