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 <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define INF (2000000000)
#define MOD (1000000007)
using namespace std;

typedef vector<int> VI;
typedef vector<int>::iterator VII;
typedef vector<double> VD;
typedef vector<double>::iterator VDI;
typedef pair<int, int> P;


typedef struct
{
	int tx, ty, kx, ky;
} POS;

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

bool maze[100][100];
int X, Y;
POS f;
int d[55][55][55][55];

int search()
{
	queue<POS> que;
	
	for (int i = 0; i < 55; i++){
		for (int j = 0; j < 55; j++){
			for (int k = 0; k < 55; k++){
				for (int l = 0; l < 55; l++){
					d[i][j][k][l] = INF;
				}
			}
		}
	}
	
	que.push(f);
	d[f.tx][f.ty][f.kx][f.ky] = 0;
	
	while (que.size()){
		POS now = que.front();
		que.pop();
		
		//printf("%d %d %d %d\n", now.tx, now.ty, now.kx, now.ky);
		
		if (now.tx == now.kx && now.ty == now.ky){
			return (d[now.tx][now.ty][now.kx][now.ky]);
		}
		
		for (int i = 0; i < 4; i++){
			POS to;
			if (maze[now.tx + dx[i]][now.ty + dy[i]] && maze[now.kx - dx[i]][now.ky - dy[i]]){
				continue;
			}
			
			if (maze[now.tx + dx[i]][now.ty + dy[i]]){
				to.tx = now.tx;
				to.ty = now.ty;
			}
			else {
				to.tx = now.tx + dx[i];
				to.ty = now.ty + dy[i];
			}
			
			if (maze[now.kx - dx[i]][now.ky - dy[i]]){
				to.kx = now.kx;
				to.ky = now.ky;
			}
			else {
				to.kx = now.kx - dx[i];
				to.ky = now.ky - dy[i];
			}
			
			to.tx = now.tx + dx[i];
			to.ty = now.ty + dy[i];
			to.kx = now.kx - dx[i];
			to.ky = now.ky - dy[i];
			
			if (d[to.tx][to.ty][to.kx][to.ky] == INF && d[now.tx][now.ty][now.kx][now.ky] < 99){
				que.push(to);
				d[to.tx][to.ty][to.kx][to.ky] = d[now.tx][now.ty][now.kx][now.ky] + 1;
			}
		}
	}
	
	return (-1);
}

int main()
{
	while (scanf("%d %d", &X, &Y), X + Y){
		scanf("%d %d", &f.tx, &f.ty);
		scanf("%d %d", &f.kx, &f.ky);
		
		for (int i = 0; i < 100; i++){
			for (int j = 0; j < 100; j++){
				maze[i][j] = true;
			}
		}
		
		for (int i = 1; i <= Y; i++){
			for (int j = 1; j <= X; j++){
				scanf("%d", &maze[j][i]);
			}
		}
		
		int r = search();
		if (r != -1) printf("%d\n", r);
		else puts("NA");
	}
	
	return 0;
}

C++: //2015/7/
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

bool che[50][50][50][50];

struct Person{ int x, y; };

struct Twin{ Person T, K; int cnt; };

bool isOK(Twin t){
	if (t.T.x == t.K.x && t.T.y == t.K.y){
		return true;
	}
	return false;
}

void initCheck(Twin t){
	for (int a = 0; a < 50; a++){
		for (int b = 0; b < 50; b++){
			for (int c = 0; c < 50; c++){
				for (int d = 0; d < 50; d++){
					che[a][b][c][d] = false;
				}
			}
		}
	}
	che[t.T.x - 1][t.T.y - 1][t.K.x - 1][t.K.y - 1] = true;
}

bool Check(Twin t){
	if (che[t.T.x - 1][t.T.y - 1][t.K.x - 1][t.K.y - 1]){
		return false;
	}
	che[t.T.x - 1][t.T.y - 1][t.K.x - 1][t.K.y - 1] = true;
	return true;
}

int main(){
	int x,y,d[52][52];
	Twin tw;
	while (cin >> x >> y){
		if (x == 0 && y == 0){
			break;
		}

		cin >> tw.T.x >> tw.T.y >> tw.K.x >> tw.K.y;

		tw.cnt = 0;
		for (int i = 0; i < y + 2; i++){
			for (int j = 0; j < x + 2; j++){
				d[j][i] = 1;
			}
		}

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

		queue<Twin> que;
		que.push(tw);

		initCheck(tw);

		while (1){
			if (que.empty()){
				cout << "NA\n";
				break;
			}
			Twin T = que.front();
			que.pop();

			if (T.cnt >= 100){
				cout << "NA\n";
				break;
			}
			if (isOK(T)){
				cout << T.cnt << endl;
				break;
			}
			T.cnt += 1;
			/*for (int i = 0; i < y + 2; i++){
				for (int j = 0; j < x + 2; j++){
					if (j == T.T.x && i == T.T.y){
						cout << "T";
					}
					else if (j == T.K.x&&i == T.K.y){
						cout << "K";
					}
					else
						cout << d[j][i];
				}
				cout << endl;
			}*/

			//T??????,K??????
			Twin tmp = T;
			if (d[tmp.T.x][tmp.T.y - 1] == 0)
			{
				tmp.T.y -= 1;
			}
			if (d[tmp.K.x][tmp.K.y + 1] == 0){
				tmp.K.y += 1;
			}
			if (Check(tmp)){
				que.push(tmp);
			}

			//T??????,K??????
			tmp = T;
			if (d[tmp.T.x][tmp.T.y + 1] == 0)
			{
				tmp.T.y += 1;
			}
			if (d[tmp.K.x][tmp.K.y - 1] == 0){
				tmp.K.y -= 1;
			}
			if (Check(tmp)){
				que.push(tmp);
			}

			//T??±???,K?\????
			tmp = T;
			if (d[tmp.T.x + 1][tmp.T.y] == 0)
			{
				tmp.T.x += 1;
			}
			if (d[tmp.K.x - 1][tmp.K.y] == 0){
				tmp.K.x -= 1;
			}
			if (Check(tmp)){
				que.push(tmp);
			}

			//T?\????,K??±???
			tmp = T;
			if (d[tmp.T.x - 1][tmp.T.y] == 0)
			{
				tmp.T.x -= 1;
			}
			if (d[tmp.K.x + 1][tmp.K.y] == 0){
				tmp.K.x += 1;
			}
			if (Check(tmp)){
				que.push(tmp);
			}

		}
	}
	return 0;
}