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 <queue>
using namespace std;

const int INF=100000000;

class Point{
public:
  int tx;
  int ty;
  int kx;
  int ky;
};

int main(){
  while(true){
    int X,Y;
    cin>>X>>Y;
    if(X==0&&Y==0){
      break;
    }
    char F[X+2][Y+2];
    int D[X+1][Y+1];
    for(int x=1;x<=X;x++){
      for(int y=1;y<=Y;y++){
        D[x][y]=INF;
      }
    }
    int tx,ty,kx,ky;
    cin>>tx>>ty;
    cin>>kx>>ky;
    D[tx][ty]=0;
    D[kx][ky]=0;

    for(int x=0;x<=X+1;x++){
      for(int y=0;y<=Y+1;y++){
        F[x][y]=1;
      }
    }
    int a;
    for(int x=1;x<=X;x++){
      for(int y=1;y<=Y;y++){
        cin>>a;
        F[x][y]=a;
      }
    }


    queue<Point> que;

    Point p;
    p.tx=tx;
    p.ty=ty;
    p.kx=kx;
    p.ky=ky;
    que.push(p);

    while(!que.empty()){
      p=que.front();
      que.pop();

      if(p.tx==p.kx&&p.ty==p.ky){
        if(D[p.tx][p.ty]>100){
          cout<<"NA"<<endl;
          break;
        }
        cout<<D[p.tx][p.ty]<<endl;
        break;
      }

      if(D[p.tx-1][p.ty]==INF&&D[p.kx+1][p.ky]==INF){
        Point q;
        q.tx=p.tx-1;
        q.ty=p.ty;
        q.kx=p.kx+1;
        q.ky=p.ky;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx+1][p.ty]==INF&&D[p.kx-1][p.ky]==INF){
        Point q;
        q.tx=p.tx+1;
        q.ty=p.ty;
        q.kx=p.kx-1;
        q.ky=p.ky;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx][p.ty+1]==INF&&D[p.kx][p.ky-1]==INF){
        Point q;
        q.tx=p.tx;
        q.ty=p.ty+1;
        q.kx=p.kx;
        q.ky=p.ky-1;
        que.push(q);
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx][p.ty-1]==INF&&D[p.kx][p.ky+1]==INF){
        Point q;
        q.tx=p.tx;
        q.ty=p.ty-1;
        q.kx=p.kx;
        q.ky=p.ky+1;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

    }
  }

  return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF (1 << 30)

int xs[] = {0, 1, 0, -1}, ys[] = {1, 0, -1, 0};
int x, y;
int field[55][55];
int dp[50][50][50][50];

int solve(int tx, int ty, int kx, int ky){
  int ntx, nty, nkx, nky;
  if(dp[tx][ty][kx][ky] != -1){
    return dp[tx][ty][kx][ky];
  }
  dp[tx][ty][kx][ky] = INF;
  for(int i = 0;i < 4;i++){
    ntx = tx + xs[i];
    nty = ty + ys[i];
    nkx = kx - xs[i];
    nky = ky - ys[i];
    if(ntx < 0 || ntx >= x || nty < 0 || nty >= y || field[ntx][nty] == 1){
      ntx = tx;
      nty = ty;
    }
    if(nkx < 0 || nkx >= x || nky < 0 || nky >= y || field[nkx][nky] == 1){
      nkx = kx;
      nky = ky;
    }
    dp[tx][ty][kx][ky] = min(dp[tx][ty][kx][ky], solve(ntx, nty, nkx, nky) + 1);
  }
  return dp[tx][ty][kx][ky];
}

int main(){
  int tx, ty, kx, ky;
  while(true){
    scanf("%d%d", &x, &y);
    memset(dp, -1, sizeof(dp));
    if(x == 0 && y == 0) return 0;
    scanf("%d%d", &tx, &ty);
    scanf("%d%d", &kx, &ky);
    for(int i = 0;i < y;i++){
      for(int j = 0;j < x;j++){
	scanf("%d", &field[x][y]);
	dp[i][j][i][j] = 0;
      }
    }
    int ans = solve(tx - 1, ty - 1, kx - 1, ky - 1);
    if(ans > 100)
      puts("NA");
    else
      printf("%d\n", ans);
  }
}