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 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)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(102)
	for len(pq) > 0 {
		now := &Status{}
		*now = *pq[0]
		pq = pq[1:]
		if ans <= now.Turn {
			continue
		}
		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = now.Turn

		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = 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++
			if next.Turn <= 100 {
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		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 <bits/stdc++.h>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)

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

bool in_range(int x, int mn, int mx) { return mn <= x && x < mx; }
bool in_range(int x, int y, int w, int h) { return in_range(x, 0, w) && in_range(y, 0, h); }

struct State { int step, x1, y1, x2, y2; };

int W, H, tx, ty, kx, ky, grid[55][55];
int dst[55][55][55][55];

void solve() {
	memset(dst, -1, sizeof(dst));
	
	queue< State > que;
	que.push(State{0, tx, ty, kx, ky});
	dst[ty][tx][ky][kx] = 0;
	
	while (!que.empty()) {
		State s = que.front(); que.pop();
		
		if (s.step >= 100) break;
				
		if (s.x1 == s.x2 && s.y1 == s.y2) {
			cout << s.step << endl;
			return;
		}
		
		for_(d,0,4) {
			int nx1 = s.x1 + dx[d], ny1 = s.y1 + dy[d];
			int nx2 = s.x2 + dx[(d + 2) % 4], ny2 = s.y2 + dy[(d + 2) % 4];
			
			if (!in_range(nx1, ny1, W, H)) { nx1 = s.x1; ny1 = s.y1; }
			if (grid[ny1][nx1] == 1) { nx1 = s.x1; ny1 = s.y1; }
			
			if (!in_range(nx2, ny2, W, H)) { nx2 = s.x2; ny2 = s.y2; }
			if (grid[ny2][nx2] == 1) { nx2 = s.x2; ny2 = s.y2; }
			
			if (dst[ny1][nx1][ny2][nx2] == -1) {
				dst[ny1][nx1][ny2][nx2] = s.step + 1;
				que.push(State{s.step + 1, nx1, ny1, nx2, ny2});
			}
		}
	}
	
	cout << "NA" << endl;
}

int main() {
	while (cin >> W >> H, W) {
		cin >> tx >> ty;
		--tx; --ty;
		cin >> kx >> ky;
		--kx; --ky;
		for_(i,0,H) for_(j,0,W) cin >> grid[i][j];
		solve();
	}
}

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

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

int mk(Point2 p)
{
  return (((p.tx-1)*50+(p.ty-1))*50+(p.kx-1))*50+(p.ky-1);
}

int main()
{
  while(true){
    int W, H;
    cin >> W >> H;

    if(W==0 && H==0)
      break;

    Point2 p;
    cin >> p.tx >> p.ty;
    cin >> p.kx >> p.ky;

    int d[52][52];
    for(int y=0; y<=H+1; y++){
      for(int x=0; x<=W+1; x++){
	d[y][x] = 1;
      }
    }

    for(int y=1; y<=H; y++){
      for(int x=1; x<=W; x++){
	cin >> d[y][x];
      }
    }

    queue<Point2> que;
    que.push(p);

    map<int, int> n;
    n[mk(p)] = 0;

    while(true){
      if(que.empty()){
	cout << "NA" << endl;
	break;
      }

      p = que.front(); que.pop();

      if(n[mk(p)]>=100){
	cout << "NA" << endl;
	break;
      }

      if(p.tx==p.kx && p.ty==p.ky){
	cout << n[mk(p)] << endl;
	break;
      }

      Point2 q;

      //東
      q = p;
      if(d[q.ty][q.tx+1]==0){
	q.tx = q.tx+1;
      }
      if(d[q.ky][q.kx-1]==0){
	q.kx = q.kx-1;
      }
      if(n.find(mk(q))==n.end()){
	que.push(q);
	n[mk(q)] = n[mk(p)]+1;
      }

      //西
      q = p;
      if(d[q.ty][q.tx-1]==0){
	q.tx = q.tx-1;
      }
      if(d[q.ky][q.kx+1]==0){
	q.kx = q.kx+1;
      }
      if(n.find(mk(q))==n.end()){
	que.push(q);
	n[mk(q)] = n[mk(p)]+1;
      }

      //南
      q = p;
      if(d[q.ty+1][q.tx]==0){
	q.ty = q.ty+1;
      }
      if(d[q.ky-1][q.kx]==0){
	q.ky = q.ky-1;
      }
      if(n.find(mk(q))==n.end()){
	que.push(q);
	n[mk(q)] = n[mk(p)]+1;
      }

      //北
      q = p;
      if(d[q.ty-1][q.tx]==0){
	q.ty = q.ty-1;
      }
      if(d[q.ky+1][q.kx]==0){
	q.ky = q.ky+1;
      }
      if(n.find(mk(q))==n.end()){
	que.push(q);
	n[mk(q)] = n[mk(p)]+1;
      }
    }
  }

  return 0;
}