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 now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}

		if _, ok := memo[now.Person]; ok {
			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++
			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 <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <set>
using namespace std;

const int needleX[4] = {-1, 0, 1, 0};
const int needleY[4] = {0, -1, 0, 1};

pair<int, int> newPoint(pair<int, int>& nowPoint, int i, vector<vector<bool> >& depart, bool takayuki){
  pair<int, int> result;
  result.first = nowPoint.first + (needleX[i] * (takayuki ? 1 : -1));
  result.second = nowPoint.second + (needleY[i] * (takayuki ? 1 : -1));
  if(!depart[result.first][result.second]){ result = nowPoint; }
  return result;
}

int main(void){
  while(true){
    int w, h;
    cin >> w >> h;
    if(w == 0 && h == 0){ break; }
    pair<int, int> takayuki, kazuyuki;
    cin >> takayuki.second >> takayuki.first;
    cin >> kazuyuki.second >> kazuyuki.first;

    int input;
    vector<vector<bool> > depart(h + 2, vector<bool>(w + 2, false));
    for(int i = 1; i <= h; i++){
      for(int j = 1; j <= w; j++){
        cin >> input;
        if(input == 0){ depart[i][j] = true; }
      }
    }

    int ans = -1;
    set<pair<pair<int, int>, pair<int, int> > > used;
    queue<pair<int, pair<pair<int, int>, pair<int, int> > > > wait;
    used.insert(make_pair(takayuki, kazuyuki));
    wait.push(make_pair(0, make_pair(takayuki, kazuyuki)));
    while(!wait.empty()){
      int cost = wait.front().first;
      pair<int, int> t = wait.front().second.first;
      pair<int, int> k = wait.front().second.second;
      wait.pop();
      
      if(t == k){
        ans = cost;
        break;
      }

      for(int i = 0; i < 4; i++){
        pair<int, int> newt = newPoint(t, i, depart, true);
        pair<int, int> newk = newPoint(k, i, depart, false);
        if(used.count(make_pair(newt, newk)) == 0){
          used.insert(make_pair(newt, newk));
          wait.push(make_pair(cost + 1, make_pair(newt, newk)));
        }
      }
    }
    
    if(ans == -1){ cout << "NA" << endl; }
    else{ cout << ans << endl; }
  }
  
  return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype

template <class T>
int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount

const double EPS = 1e-8;
typedef long long ll;
typedef pair<int, int> pint;


int X, Y, depa[50][50];
int dx[] = { 0, 1, 0, -1 };
int dy[] = { 1, 0, -1, 0 };
void move(int x, int y, int dir, int* nx, int* ny)
{
	int tx = x + dx[dir];
	int ty = y + dy[dir];
	if (tx >= 0 && ty >= 0 && tx < X && ty < Y
		&& depa[ty][tx] == 0
		)
	{
		*nx = tx;
		*ny = ty;
	}
	else
	{
		*nx = x;
		*ny = y;
	}
}
int enc(int tx, int ty, int kx, int ky)
{
	return tx | ty << 6 | kx << 6*2 | ky << 6*3;
}
void dec(int e, int& tx, int& ty, int& kx, int &ky)
{
	const int mask = (1 << 6) - 1;
	tx = e & mask;
	ty = e >> 6 & mask;
	kx = e >> 6*2 & mask;
	ky = e >> 6*3 & mask;
}
map<int, int> memo;
int main()
{
	while (scanf("%d%d", &X, &Y), X|Y)
	{
		int tx, ty, kx, ky;
		scanf("%d%d%d%d", &tx, &ty, &kx, &ky);
		for (int i = 0; i < Y; ++i)
			for (int j = 0; j < X; ++j)
				scanf("%d", &depa[i][j]);
		memo.clear();

		queue<int> q;
		q.push(enc(tx, ty, kx, ky));
		memo[enc(tx, ty, kx, ky)] = 0;
		int res = -1;
		while (!q.empty())
		{
			int e = q.front(); q.pop();
			int time = memo[e];

			dec(e, tx, ty, kx, ky);
			if (tx == kx && ty == ky)
			{
				res = time;
				break;
			}

			if (time >= 100)
				continue;

			for (int i = 0; i < 4; ++i)
			{
				int ttx, tty, kkx, kky;
				move(tx, ty, i, &ttx, &tty);
				move(kx, ky, (i+2)%4, &kkx, &kky);

				int en = enc(ttx, tty, kkx, kky);
				if (!memo.count(en))
				{
					memo[en] = time + 1;
					q.push(en);
				}
			}
		}
		if (res != -1)
			printf("%d\n", res);
		else
			puts("NA");
	}

	return 0;
}