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 <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <string.h>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define REP(i,e) for (int i = 0; i != int(e); i++)
#define FORIT(i, A) for (auto i : A)
#define ISEQ(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << endl
#define SZ(x) ((int)(x).size())

int depart[50][50];
int W, H;

struct Position
{
	Position(int x, int y): x(x), y(y) {}
	int x, y;
};
std::vector<Position> memo[50][50];

struct State
{
	State(int x1, int y1, int x2, int y2) : p1(x1, y1), p2(x2, y2), num(0) {}
	Position p1, p2;
	int num;
};

bool move(State& s, int dir)
{
	State orig = s;
	bool move = false;
	int x1, x2, y1, y2;
	if (s.num >= 99) return false;
	switch (dir)
	{	
		case 0: // up
			y1 = (s.p1.y > 0     && depart[s.p1.y-1][s.p1.x] == 0) ? s.p1.y-1 : s.p1.y;
			y2 = (s.p2.y < (H-1) && depart[s.p2.y+1][s.p2.x] == 0) ? s.p2.y+1 : s.p2.y;
			if (s.p1.y == y1 && s.p2.y == y2) return false;
			s.p1.y = y1;
			s.p2.y = y2;
		break;
		case 1: // right
			x1 = (s.p1.x < (W-1) && depart[s.p1.y][s.p1.x+1] == 0) ? s.p1.x+1 : s.p1.x;		
			x2 = (s.p2.x > 0     && depart[s.p2.y][s.p2.x-1] == 0) ? s.p2.x-1 : s.p2.x;
			if (s.p1.x == x1 && s.p2.x == x2) return false;
			s.p1.x = x1;
			s.p2.x = x2;
		break;
		case 2: // down
			y1 = (s.p1.y < (H-1) && depart[s.p1.y+1][s.p1.x] == 0) ? s.p1.y+1 : s.p1.y;
			y2 = (s.p2.y > 0     && depart[s.p2.y-1][s.p2.x] == 0) ? s.p2.y-1 : s.p2.y;		
			if (s.p1.y == y1 && s.p2.y == y2) return false;
			s.p1.y = y1;
			s.p2.y = y2;			
		break;
		case 3: // left
			x1 = (s.p1.x > 0     && depart[s.p1.y][s.p1.x-1] == 0) ? s.p1.x-1 : s.p1.x;
			x2 = (s.p2.x < (W-1) && depart[s.p2.y][s.p2.x+1] == 0) ? s.p2.x+1 : s.p2.x;		
			if (s.p1.x == x1 && s.p2.x == x2) return false;
			s.p1.x = x1;
			s.p2.x = x2;
		break;
	}
	vector<Position>& mem = memo[s.p1.y][s.p1.x];
	REP(i, SZ(mem))
	{
		if (mem[i].x == s.p2.x && mem[i].y == s.p2.y)
		{
			return false;
		}
	}
	s.num++;
	return true;
}

int main(int argc, char const *argv[])
{
	while(1)
	{
		scanf("%d %d", &W, &H);
		if (W == 0 && H == 0) break;
		int x1, y1, x2, y2;
		scanf("%d %d", &x1, &y1);
		scanf("%d %d", &x2, &y2);
		State s(x1-1, y1-1, x2-1, y2-1);
		memset(depart, 0, 50*50);
		REP(i, 50) REP(j, 50) memo[i][j].clear();
		REP(i, H)
			REP(j, W)
			{
				int m;
				scanf("%d", &m);
				depart[i][j] = m;
			}
		queue<State> q;
		q.push(s);
		bool success = false;
		while(!q.empty() && !success)
		{
			State s = q.front();
			q.pop();
			if (s.num >= 100)
				continue;
			REP(i,4)
			{
				State next = s;
				if (move(next, i))
				{
					// printf("State:(%d, %d) (%d, %d)\n", next.p1.x, next.p1.y, next.p2.x, next.p2.y);
					if (next.p1.x == next.p2.x && next.p1.y == next.p2.y)
					{
						printf("%d\n", next.num);
						success = true;
						break;
					}
					else
					{
						memo[next.p1.y][next.p1.x].push_back(Position(next.p2.x, next.p2.y));
						q.push(next);
					}
				}
			}
		}
		if (!success)
		{
			printf("NA\n");
		}
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
struct P{
  int tx,ty;
  int kx,ky;
  int cost;
  P(int _tx, int _ty, int _kx, int _ky, int _cost) : tx(_tx), ty(_ty), kx(_kx), ky(_ky), cost(_cost) {};
};
int hx,hy,rx,ry;
int X,Y;
int mas[110][110];
bool d[51][51][51][51];
int dx[4] = {0,1,0,-1},dy[4] = {1,0,-1,0};
int bfs();
int main(){
  while(1){
    scanf("%d %d",&X,&Y);
    if(X == 0 && Y == 0)break;
    scanf("%d %d",&hx,&hy);
    scanf("%d %d",&rx,&ry);
    for(int i = 1; i <= Y; i++){
      for(int j = 1; j <= X; j++){
	scanf("%d",&mas[i][j]);
      }
    }
    int ans = bfs();
    if(ans == -1)cout << "NA" << endl;
    else cout << ans << endl;
  }
}
int bfs(){
  queue<P> que;
  memset(d,0,sizeof(d));
  que.push(P(hx,hy,rx,ry,0));
  d[hx][hy][rx][ry] = 0;
  while(!que.empty()){
    P p = que.front();
    que.pop();
    if(p.cost >= 100)return -1;
    if(p.tx == p.kx && p.ty == p.ky){
      return p.cost;
    }
    for(int i = 0; i < 4; i++){
      int nx = p.tx + dx[i], ny = p.ty + dy[i];
      int ux = p.kx - dx[i], uy = p.ky - dy[i];
      if(nx > 0 && ny > 0 && ux > 0 && uy > 0 && nx <= X && ny <= Y && ux <= X && uy <= Y && mas[ny][nx] != 1 && mas[uy][ux] != 1 && d[nx][ny][ux][uy] == 0){
	que.push(P(nx,ny,ux,uy,p.cost + 1));
	d[nx][ny][ux][uy] =  1;
      }
      else if((nx <= 0 || nx > X || ny <= 0 || ny > Y || mas[ny][nx] == 1) && ux <= X && uy <= Y && ux > 0 && uy > 0 && mas[uy][ux] != 1 && d[p.tx][p.ty][ux][uy] == 0){
	que.push(P(p.tx,p.ty,ux,uy,p.cost + 1));
	d[p.tx][p.ty][ux][uy] = 1;
      }
      else if((ux <= 0 || ux > X || uy <= 0 || uy > Y || mas[uy][ux] == 1) && nx <= X && ny <= Y && nx > 0 && ny > 0 && mas[ny][nx] != 1 && d[nx][ny][p.kx][p.ky] == 0){
	que.push(P(nx,ny,p.kx,p.ky,p.cost + 1));
	d[nx][ny][p.kx][p.ky] = 1;
      }
    }
  }
  return -1;
}