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(102)
	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 _, 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 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				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<queue>
using namespace std;
struct l{
	int tx;
	int ty;
	int kx;
	int ky;
	int cnt;
};
queue<l> p;
int ps[50505050]={};
int main(){
	int x,y,tlx,tly,klx,kly,d[50][50],i,j,cl,tmx[4]={0,1,0,-1},tmy[4]={-1,0,1,0},kmx[4]={0,-1,0,1},kmy[4]={1,0,-1,0},k,z;
	l v;
	while(1){
		cin>>x>>y;
		if(x==0&&y==0)break;
		cin>>tlx>>tly;
		cin>>klx>>kly;
		for(i=0;i<y;i++){
			for(j=0;j<x;j++){
				cin>>d[i][j];
			}
		}
		v.tx=tlx-1;
		v.ty=tly-1;
		v.kx=klx-1;
		v.ky=kly-1;
		v.cnt=0;
		p.push(v);
		while(1){
			tlx=p.front().tx;
			tly=p.front().ty;
			klx=p.front().kx;
			kly=p.front().ky;
			cl=p.front().cnt;
			p.pop();
			if(tlx==klx&&tly==kly||cl>=100){
				while(!p.empty()){
					p.pop();
				}
				for(i=0;i<50505050;i++){
					ps[i]=0;
				}
				break;
			}
			if(ps[tlx*1000000+tly*10000+klx*100+kly]==1){
				if (!p.empty())
					continue;
				else
					break;
			}
			else{
				ps[tlx*1000000+tly*10000+klx*100+kly]=1;
			}
			for(i=0;i<4;i++){
				if(d[tly+tmy[i]][tlx+tmx[i]]==0&&(tlx+tmx[i])>=0&&(tlx+tmx[i])<x&&(tly+tmy[i])>=0&&(tly+tmy[i])<y){
					v.tx=tlx+tmx[i];
					v.ty=tly+tmy[i];
				}
				else{
					v.tx=tlx;
					v.ty=tly;
				}
				if(d[kly+kmy[i]][klx+kmx[i]]==0&&(klx+kmx[i])>=0&&(klx+kmx[i])<x&&(kly+kmy[i])>=0&&(kly+kmy[i])<y){
					v.kx=klx+kmx[i];
					v.ky=kly+kmy[i];
				}
				else{
					v.kx=klx;
					v.ky=kly;
				}
				v.cnt=cl+1;
				p.push(v);
			}
			
		}
		if(tlx==klx&&tly==kly&&cl!=0){
			cout<<cl<<endl;
		}
		else{
			cout<<"NA"<<endl;
		}
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
#include <string.h>
#include <complex>
using namespace std;

const int INF = 1<<29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int,int> P;

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

struct node{
    int d,tx,ty,kx,ky;
    bool operator<(const node& right) const{
        return d > right.d;
    }
};

int d[50][50][50][50];
int field[50][50];

int main(){
    while(1){
        int X,Y;
        scanf("%d%d",&X,&Y);
        if(!X)break;

        int tx,ty,kx,ky;
        scanf("%d%d%d%d",&tx,&ty,&kx,&ky);
        tx--;ty--;kx--;ky--;

        for(int i=0;i<Y;i++){
            for(int j=0;j<X;j++){
                scanf("%d",&field[i][j]);
            }
        }

        for(int i=0;i<Y;i++){
            for(int j=0;j<X;j++){
                for(int k=0;k<Y;k++){
                    for(int l=0;l<X;l++){
                        d[i][j][k][l] = INF;
                    }
                }
            }
        }
        priority_queue<node> que;
        d[tx][ty][kx][ky] = 0;
        que.push((node){0,tx,ty,kx,ky});
        bool not_reach = true;
        while(que.size()){
            node p = que.top(); que.pop();
            if(d[p.tx][p.ty][p.kx][p.ky] < p.d) continue;
            if(p.tx==p.kx&&p.ty==p.ky){
                cout << p.d << endl;
                not_reach = false;
                break;
            }
            if(p.d==100){
                break;
            }
            for(int i=0;i<4;i++){
                int n_tx = p.tx+dx[i], n_ty = p.ty+dy[i];
                int n_kx = p.kx-dx[i], n_ky = p.ky-dy[i];
                if(n_tx<0||X<=n_tx||n_ty<0||Y<=n_ty||field[n_tx][n_ty]){
                    n_tx = p.tx; n_ty = p.ty;
                }
                if(n_kx<0||X<=n_kx||n_ky<0||Y<=n_ky||field[n_kx][n_ky]){
                    n_kx = p.kx; n_ky = p.ky;
                }
                if(d[n_tx][n_ty][n_kx][n_ky]>p.d+1){
                    d[n_tx][n_ty][n_kx][n_ky] = p.d+1;
                    que.push((node){p.d+1,n_tx,n_ty,n_kx,n_ky});
                }
            }
        }
        if(not_reach)cout << "NA" << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#define P pair<int,int>
using namespace std;

bool c[52][52];
int d[52][52];
int x[4] = { -1,0,0,1 }, y[4] = { 0,-1,1,0 };
int main() {
	int a, b;
	while (cin >> a >> b, a | b) {
		memset(c, true, sizeof(c));
		memset(d,-1,sizeof(d));
		int e, f, g, h; cin >> e >> f >> g >> h;
		for (int i = 0; i < b; i++) {
			for (int j = 0; j < a; j++) {
				cin >> c[j + 1][i + 1];
			}
		}
		if (((e + g) & 1) == ((f + h) & 1)) {
		queue<P>Q;
		Q.push(P(e,f));
		d[e][f] = 0;
		while (Q.size()) {
			P o = Q.front(); Q.pop();
			for (int i = 0; i < 4; i++) {
				if (!c[o.first + x[i]][o.second + y[i]]&&!c[e+g-(o.first + x[i])][f+h-(o.second + y[i])]&& d[o.first + x[i]][o.second + y[i]] ==-1) {
					d[o.first + x[i]][o.second + y[i]] = d[o.first][o.second] + 1;
					Q.push(P(o.first + x[i], o.second + y[i]));
				}
			}
		}
		if (d[(e + g) / 2][(f + h) / 2] == -1|| d[(e + g) / 2][(f + h) / 2]>99)puts("NA");
		else cout << d[(e + g) / 2][(f + h) / 2] << endl;
		}
		else puts("NA");
	}
}