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-1 {
				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 <queue>
#include <algorithm>

using namespace std;

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

#define MAX 51
#define INF 1e9

int H, W, tx, ty, kx, ky;
int field[MAX][MAX];
const int ttx[] = {-1,0,0,1};
const int tty[] = {0,-1,1,0};
const int kkx[] = {1,0,0,-1};
const int kky[] = {0,1,-1,0};

bool inField(int y, int x){
  return 0 <= y && y < H && 0 <= x && x < W;
}

int bfs(){
  bool vis[MAX][MAX][MAX][MAX];
  memset(vis, false, sizeof(vis));
  vis[ty][tx][ky][kx] = true;
  queue<State> Q;
  Q.push(State(tx,ty,kx,ky));
  queue<int> cnt;
  cnt.push(0);

  int res = INF;
  while(!Q.empty()){
    State s = Q.front(); Q.pop();
    int _cnt = cnt.front(); cnt.pop();

    if(_cnt == 100) break;
    if(s.tx == s.kx && s.ty == s.ky){
      res = min(res, _cnt);
      break;
    }

    for(int i = 0 ; i < 4 ; i++){
      int ntx = s.tx + ttx[i], nty = s.ty + tty[i];
      int nkx = s.kx + kkx[i], nky = s.ky + kky[i];

      if(!inField(nty, ntx) || field[nty][ntx] == 1){
        ntx = s.tx, nty = s.ty;
      }
      if(!inField(nky, nkx) || field[nky][nkx] == 1){
        nkx = s.kx, nky = s.ky;
      }

      if(vis[nty][ntx][nky][nkx]) continue;
      vis[nty][ntx][nky][nkx] = true;
      Q.push(State(ntx, nty, nkx, nky));
      cnt.push(_cnt+1);
    }
  }
  return res;
}

int main(){
  while(cin >> W >> H, (W | H)){
    cin >> tx >> ty >> kx >> ky;
    tx--, ty--, kx--, ky--;
    for(int i = 0 ; i < H ; i++){
      for(int j = 0 ; j < W ; j++){
        cin >> field[i][j];
      }
    }
    int res = bfs();
    if(res == INF){
      cout << "NA" << endl;
    }else{
      cout << res << endl;
    }
  }

  return 0;
}

C++: #include<stdio.h>
#define QUEUE_MAX 1000
typedef struct {
    int x;
	int y;
} queue_t;
queue_t t[QUEUE_MAX],k[QUEUE_MAX];
int thead=0,khead=0,tnum=0,knum=0;
int tpush( int vx, int vy ) {
	if(thead+tnum<QUEUE_MAX){
		t[thead+tnum].x=vx;
		t[thead+tnum].y=vy;
		tnum++;
		return 0;
	}
}
int tpop( int *vx, int *vy ) {
	if( tnum > 0 ){
		*vx = t[thead].x;
		*vy = t[thead].y;
		tnum--;
		thead++;
		return 0;
	}
}
int kpush( int vx, int vy ) {
	if(khead+knum<QUEUE_MAX){
		k[khead+knum].x=vx;
		k[khead+knum].y=vy;
		knum++;
		return 0;
	}
}
int kpop( int *vx, int *vy ) {
	if( knum > 0 ){
		*vx = k[khead].x;
		*vy = k[khead].y;
		knum--;
		khead++;
		return 0;
	}
}
int main(){
	while(1){
		int x,y,d[50][50],i,j,tlx[4]={0,1,0,-1},tly[4]={-1,0,1,0},cnt=0,tfx,tfy,kfx,kfy,klx[4]={0,-1,0,1},kly[4]={1,0,-1,0},tc[50][50]={},kc[50][50]={},tm[50][50]={},km[50][50]={},mx,my,f=0,h[50][50]={};
		thead=0;
		khead=0;
		tnum=0;
		knum=0;
		scanf("%d %d",&mx,&my);
			if(mx==0&&my==0){
				break;
			}
		scanf("%d %d",&tfx,&tfy);
		scanf("%d %d",&kfx,&kfy);
		tpush(tfx-1,tfy-1);
		kpush(kfx-1,kfy-1);
		for(i=0;i<my;i++){
			for(j=0;j<mx;j++){
					scanf("%d",&d[i][j]);
			}
		}
		while(1){
			while(1){
				tpop(&tfx,&tfy);
				kpop(&kfx,&kfy);
				if(tfx!=1000&&tfy!=1000&&kfx!=1000&&kfy!=1000){
					break;
				}
			}
			if(tfx==kfx&&tfy==kfy){
				break;
			}
			tm[tfy][tfx]=1;
			km[kfy][kfx]=1;
			for(i=0;i<4;i++){
				if(d[tfy+tly[i]][tfx+tlx[i]]==0&&tm[tfy+tly[i]][tfx+tlx[i]]==0&&(tfx+tlx[i])>=0&&(tfx+tlx[i])<mx&&(tfy+tly[i])>=0&&(tfy+tly[i])<my){
					tpush(tfx+tlx[i],tfy+tly[i]);
					tc[tfy+tly[i]][tfx+tlx[i]]=tc[tfy][tfx]+1;
					h[tfy+tly[i]][tfx+tlx[i]]=1;
				}
				else{
					tpush(1000,1000);
				}
				if(d[kfy+kly[i]][kfx+klx[i]]==0&&km[kfy+kly[i]][kfx+klx[i]]==0&&(kfx+klx[i])>=0&&(kfx+klx[i])<mx&&(kfy+kly[i])>=0&&(kfy+kly[i])<my){
					kpush(kfx+klx[i],kfy+kly[i]);
					kc[kfy+kly[i]][kfx+klx[i]]=kc[kfy][kfx]+1;
					h[kfy+kly[i]][kfx+klx[i]]=1;
				}
				else{
					kpush(1000,1000);
				}
			}
			f=0;
			for(i=0;i<my;i++){
				for(j=0;j<mx;j++){
					if(d[i][j]==0&&h[i][j]==0){
						f=1;
					}
				}
			}
			if(f==0){
				break;
			}
		}
		if(tfx==kfx&&tfy==kfy){
				printf("%d\n",tc[tfy][tfx]);
		}
		else{
			printf("NA\n");
		}
	}
	return 0;
}