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 <bits/stdc++.h>
using namespace std;

int dist[52][52][52][52];
int fie[52][52];


int W, H;
int tx, ty;
int kx, ky;

struct A {
  int a;
  int b;
  int c;
  int d;
};

int& acc(A a) {
  return dist[a.a][a.b][a.c][a.d];
}

int dd[] = {1, 0, -1, 0};

A mv(A a, int d) {
  A b = a;
  if(fie[a.a + dd[d]][a.b + dd[d ^ 1]] == 0) {
    b.a = a.a + dd[d];
    b.b = a.b + dd[d ^ 1];
  }
  if(fie[a.c + dd[d ^ 2]][a.d + dd[d ^ 3]] == 0) {
    b.c = a.c + dd[d ^ 2];
    b.d = a.d + dd[d ^ 3];
  }
  return b;
}

int solve() {
  cin >> W >> H;
  if(W == 0 && H == 0) return 0;
  cin >> tx >> ty;
  swap(tx, ty);
  cin >> kx >> ky;
  swap(kx, ky);
  for(int i = 0;i <= H + 1;i++) for(int j = 0;j <= W + 1;j++) fie[i][j] = 1;
  for(int i = 1;i <= H;i++) for(int j = 1;j <= W;j++) cin >> fie[i][j];

  for(auto& w: dist) for(auto& x: w) for(auto& y: x) for(auto& z: y) z = -1;

  queue<A> que;
  que.push({tx, ty, kx, ky});
  acc({tx, ty, kx, ky}) = 0;

  while(!que.empty()) {
    A v = que.front();
    if(v.a == v.c && v.b == v.d) {
      cout << acc(v) << endl;
      return 1;
    }
    que.pop();
    for(int i = 0;i < 4;i++) {
      A u = mv(v, i);
      if(acc(u) == -1) {
        acc(u) = acc(v) + 1;
        que.push(u);
      }
    }
  }
  cout << "NA" << endl;
  return 1;
}

int main() {
  while(solve());
}

C++: #include <iostream>
#include <queue>
#include <cstring>
using namespace std;
 
 
int H,W;
bool F[52][52]; //障害物
bool D[52][52][52][52]; //探索済みかの判定用

int inc_tx[4] = {1,-1,0,0}; //方向
int inc_ty[4] = {0,0,1,-1};
int inc_kx[4] = {-1,1,0,0};
int inc_ky[4] = {0,0,-1,1};
 
class Point{
public:
  int tx; //タカユキの座標
  int ty;
  int kx; //カズユキの座標
  int ky;
  int d; //ターン回数
  void set(int a,int b,int c,int d){
    tx = a;
    ty = b;
    kx = c;
    ky = d;
  }
};
 
bool is_out_of_area(int y,int x) //座標が有効範囲内か確認する関数
{
  return x < 1 || x > W || y < 1 || y > H || F[y][x];
}
 
int main(){
 
  while(1){
 
    Point p,q;
    int tx,ty,kx,ky;
    queue<Point> qa;
    cin >> W >> H;
    if(W == 0 && H == 0)
    break;
    cin >> tx >> ty >> kx >> ky;
    memset(F,1,sizeof(F));
    for(int y=1;y<=H;y++){
      for(int x=1;x<=W;x++){
        cin >> F[y][x];
      }
    }
    memset(D,1,sizeof(D));
    p.set(tx,ty,kx,ky);
    D[ty][tx][ky][kx] = 0;
    p.d = 0;
    qa.push(p);
    while(1){
      if(qa.empty()){
        cout << "NA" <<endl;
        break;
      }
      p = qa.front();
      qa.pop();
      if(p.d >= 100){
        cout << "NA" << endl;
        break;
      }
      if(p.tx == p.kx && p.ty == p.ky){
        cout << p.d << endl;
        break;
      }
      for(int i=0;i<4;i++){
        q.tx = p.tx + inc_tx[i]; q.ty = p.ty + inc_ty[i];
        q.kx = p.kx + inc_kx[i]; q.ky = p.ky + inc_ky[i];
 
        if(is_out_of_area(q.ty ,q.tx) == 0 || is_out_of_area(q.ky ,q.kx) == 0){ //タカ,カズともに範囲内なら
          if(is_out_of_area(q.ty ,q.tx)){ //範囲外なら戻る
            q.ty = p.ty; q.tx = p.tx;
          }
          if(is_out_of_area(q.ky ,q.kx)){ //範囲外なら戻る
            q.ky = p.ky; q.kx = p.kx;
          }
          if(D[q.ty][q.tx][q.ky][q.kx]){ //未探索ならキューにプッシュ
            q.d = p.d + 1;
            qa.push(q);
            D[q.ty][q.tx][q.ky][q.kx] = 0;
          }
        }
 
      }
    }
 
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;

bool d[50][50][50][50];
int X, Y, tx, ty, kx, ky;
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0}, mem[50][50];

bool check(int x, int y)
{
  return x >= 0 && x < X && y >= 0 && y < Y;
}

int main()
{
loop:
  cin >> X >> Y;
  if(!X)
    return 0;
  cin >> tx >> ty >> kx >> ky;
  tx--; ty--; kx--; ky--;
  for(int y = 0; y < Y; y++)
  {
    for(int x = 0; x < X; x++)
    {
      int a;
      cin >> a;
      mem[y][x] = a;
    }
  }

  fill_n((bool*)d, 50 * 50 * 50 * 50, false);
  
  queue<int> q;
  q.push(tx);
  q.push(ty);
  q.push(kx);
  q.push(ky);
  q.push(0);
  while(!q.empty())
  {
    int x1 = q.front(); q.pop();
    int y1 = q.front(); q.pop();
    int x2 = q.front(); q.pop();
    int y2 = q.front(); q.pop();
    int n = q.front(); q.pop();
    
    if(n > 100)
    {
      cout << "NA" << endl;
      break;
    }
    
    if(y1 == y2 && x1 == x2)
    {
      cout << n << endl;
      goto loop;
    }

    for(int i = 0; i < 4; i++)
    {
      int tx1 = x1 + dx[i];
      int ty1 = y1 + dy[i];
      int tx2 = x2 - dx[i];
      int ty2 = y2 - dy[i];

      if(check(tx1, ty1) && mem[ty1][tx1])
      {
        tx1 = x1;
        ty1 = y1;
      }
      if(check(tx2, ty2) && mem[ty2][tx2])
      {
        tx2 = x2;
        ty2 = y2;
      }
      if(!check(tx1, ty1) || !check(tx2, ty2) || d[tx1][ty1][tx2][ty2])
        continue; 

      d[tx1][ty1][tx2][ty2] = true;
      q.push(tx1);
      q.push(ty1);
      q.push(tx2);
      q.push(ty2);
      q.push(n + 1);
    }
  }
  cout << "NA" << endl;
  goto loop;
}