Go: package main

import (
	"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)
	//pq.Push(start)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		//now := pq.Pop().(*Status)
		now := pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			continue
		}
		memo[now.Person] = now.Turn
		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)
				//pq.Push(next)
				pq = append(pq, next)
			}
		}
	}
	if ans == 101 {
		fmt.Println("NA")
	} else {
		fmt.Println(ans)
	}
}

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(1){
      int N,M;
      cin>>N>>M;
      if(N==0&&M==0)return 0;
      int o_tx,o_ty;
      int o_kx,o_ky;
      cin>>o_tx>>o_ty;
      cin>>o_kx>>o_ky;
      int F[102][102];
      for(int y=0;y<=N+1;y++){
        for(int x=0;x<=M+1;x++){
          F[y][x]=1;
        }
      }


      for(int y=1;y<=N;y++){
        for(int x=1;x<=M;x++){
          cin>>F[y][x];
        }
      }

      int D[102][102];
      for(int y=1;y<=N;y++){
        for(int x=1;x<=M;x++){
          D[y][x]=INF;
        }
      }
      queue<Point> que;
      Point p;
      p.tx=o_tx;p.ty=o_ty;
      p.kx=o_kx;p.ky=o_ky;
      que.push(p);
      D[p.ty][p.tx]=0;

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

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

        }
        if(F[p.ty+1][p.tx]!=1 && F[p.ky-1][p.kx]!=1 && D[p.ty+1][p.tx]==INF){
          Point q;
          q.tx=p.tx;q.ty=p.ty+1;
          q.kx=p.kx;q.ky=p.ky-1;
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
        if(F[p.ty][p.tx-1]!=1 && F[p.ky][p.kx+1]!=1 && D[p.ty][p.tx-1]==INF){
          Point q;
          q.tx=p.tx-1;q.ty=p.ty;
          q.kx=p.kx+1;q.ky=p.ky;
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
        if(F[p.ty][p.tx+1]!=1 && F[p.ky][p.kx-1]!=1 && D[p.ty][p.tx+1]==INF){
          Point q;
          q.tx=p.tx+1;q.ty=p.ty;
          q.kx=p.kx-1;q.ky=p.ky;
          que.push(q);
          D[q.ty][q.tx]=D[p.ty][p.tx]+1;
        }
      }
      if(p.tx!=p.kx || p.ty!=p.ky){
        cout<<"NA\n";
      }
    }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 1 << 25;
int dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };

int b[50][50];
int dist[50][50][50][50];

int W, H;

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

struct S {
	int x1, y1, x2, y2, d;
};

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	while(cin >> W >> H, W + H) {
		int sx[2], sy[2];
		for(int i = 0; i < 2; i++) {
			cin >> sx[i] >> sy[i];
			sx[i]--, sy[i]--;
		}
		for(int i = 0; i < H; i++) {
			for(int j = 0; j < W; j++) {
				cin >> b[i][j];
			}
		}

		fill((int*)begin(dist), (int*)end(dist), INF);
		dist[sy[0]][sx[0]][sy[1]][sx[1]];
		queue<S> q;
		q.push({ sx[0], sy[0], sx[1], sy[1], 0 });
		while(q.size()) {
			int x[2] = { q.front().x1, q.front().x2 };
			int y[2] = { q.front().y1, q.front().y2 };
			int d = q.front().d;
			q.pop();
			if(dist[y[0]][x[0]][y[1]][x[1]] < d) continue;
			for(int k = 0; k < 4; k++) {
				int nx[2] = { x[0] + dx[k], x[1] - dx[k] };
				int ny[2] = { y[0] + dy[k], y[1] - dy[k] };
				for(int i = 0; i < 2; i++) {
					if(nx[i] < 0 || W <= nx[i] || b[ny[i]][nx[i]]) nx[i] = x[i];
					if(ny[i] < 0 || H <= ny[i] || b[ny[i]][nx[i]]) ny[i] = y[i];
				}
				if(dist[ny[0]][nx[0]][ny[1]][nx[1]] > d + 1) {
					dist[ny[0]][nx[0]][ny[1]][nx[1]] = d + 1;
					q.push({ nx[0], ny[0], nx[1], ny[1], d + 1 });
				}
			}
		}

		int ans = INF;
		for(int y = 0; y < H; y++) {
			for(int x = 0; x < W; x++) {
				ans = min(ans, dist[x][y][x][y]);
			}
		}
		if(ans != INF) {
			cout << ans << endl;
		}
		else {
			cout << "NA" << endl;
		}
	}
}