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<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;
	while (true) {
		cin >> W >> H;
		if (W == 0)break;
		for (int i = 0; i < 52; i++) {
			for (int j = 0; j < 52; 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];
			}
		}
		pair<pair<int, int>, pair<int, int> >num;
		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;
		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;
					break;
				}
			}
			qsize--;
			m[num] = true;
			if (num.first.first == num.second.first && num.first.second == num.second.second) {
				cout << loopcount << endl;
				break;
			}
			for (int i = 0; i < 4; i++) {
				pair<pair<int, int>, pair<int, int> >copy;
				copy = num;
				copy.first.first += dx[i];
				copy.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 -=dx[i];
				copy.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]) {
					q.push(copy);
				}
			}
			if (q.empty()) {
				cout << "NA" << endl;
			}
		}
	}
	return 0;
}

C++: #include<iostream>
#include<map>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int> P;

int w,h,ans;
int depart[50][50];
bool d[50][50][50][50];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
struct cost{
  P tp,kp;
  int cnt;
};

void solve(struct cost c){
  queue<struct cost> q;
  q.push(c);
  ans=-1;
  for(int i=0;i<h;i++){
    for(int j=0;j<w;j++){
      for(int k=0;k<h;k++){
	for(int l=0;l<w;l++){
	  d[i][j][k][l]=false;
	}
      }
    }
  }

  while(!q.empty()){
    struct cost now=q.front(),next;
    q.pop();
    int tx=now.tp.second;
    int ty=now.tp.first;
    int kx=now.kp.second; 
    int ky=now.kp.first;
    next.cnt=now.cnt+1;
    if(d[ty][tx][ky][kx]){
      continue;
    }else{
      d[ty][tx][ky][kx]=true;
    }
    if(now.cnt==100){
      break;
    }
    if(tx==kx && ty==ky){
      ans=now.cnt;
      break;
    }
    
    for(int i=0;i<4;i++){
      int tnx=tx+dx[i];
      int tny=ty+dy[i];
      int knx=kx-dx[i];
      int kny=ky-dy[i];
      if(tnx<0 || tny<0 || tnx>=w || tny>=h || depart[tny][tnx]){
	P tp(ty,tx);
	next.tp=tp;
      }else{
	P tp(tny,tnx);
	next.tp=tp;
      }
      if(knx<0 || kny<0 || knx>=w || kny>=h || depart[kny][knx]){
	P kp(ky,kx);
	next.kp=kp;
      }else{
	P kp(kny,knx);
	next.kp=kp;
      }
      q.push(next);
    }
  }
}

int main(){
  while(cin>> w>> h,w||h){
    int tx,ty,kx,ky;
    cin>> tx>> ty;
    cin>> kx>> ky;
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	cin>> depart[i][j];
      }
    }
    
    struct cost c;
    P tp(ty-1,tx-1),kp(ky-1,kx-1);
    c.tp=tp;
    c.kp=kp;
    c.cnt=0;
    solve(c);
    if(ans==-1){
      cout<< "NA"<< endl;
    }else{
      cout<< ans<< endl;
    }
  }
}