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(101)
	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 += 1
			if next.Turn < 100 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				pq = append(pq, next)
			}
		}
	}
	if ans == 101 {
		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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#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 <cstring>
#include <sstream>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int,int> pi;
#define rep(i,n) for(int i=0;i<n;i++)


int dx[]={0,-1,0,1};
int dy[]={-1,0,1,0};
bool past[50][50][50][50];
int d[50][50];
int x,y;
int tx,ty,kx,ky;


main(){
	while(cin>>x>>y,x){
		cin>>tx>>ty>>kx>>ky;
		--tx;--ty;--kx;--ky;
		rep(i,x)rep(j,y)cin>>d[i][j];
		memset(past,0,sizeof(past));

		past[tx][ty][kx][ky]=1;
		queue<pair<pair<pi,pi>,int> > state;
		state.push(make_pair(make_pair(make_pair(tx,ty),make_pair(kx,ky)),0));
		
		
		
		while(!state.empty()){
			tx=state.front().first.first.first;
			ty=state.front().first.first.second;
			kx=state.front().first.second.first;
			ky=state.front().first.second.second;
			
			int time=state.front().second;
			state.pop();
			
			
			rep(i,4){
				int ttx=tx+dx[i],tty=ty+dy[i],
					tkx=kx-dx[i],tky=ky-dy[i];
				
				if(ttx<0 || ttx>=x || tty<0 || tty>=y || d[ttx][tty]==1){
					ttx=tx;
					tty=ty;
				}
				if(tkx<0 || tkx>=x || tky<0 || tky>=y || d[tkx][tky]==1){
					tkx=kx;
					tky=ky;
				}
				if(past[ttx][tty][tkx][tky] || time>=99)continue;
				if(ttx==tkx && tty==tky){
					cout<<time+1<<endl;
					goto END;
				}
				pair<pair<int,int>,pair<int,int> > next=make_pair(make_pair(ttx,tty),make_pair(tkx,tky));
				
				past[ttx][tty][tkx][tky]=1;
				state.push(make_pair(next,time+1));
			}
		}
		
		puts("NA");END:;
	}
}

C++: #include<iostream>
#include<queue>
using namespace std;
struct P{
  int tax, tay;
  int kax, kay;
  int c;

  P(int _tax, int _tay, int _kax, int _kay, int _c) : tax(_tax), tay(_tay), kax(_kax), kay(_kay), c(_c) {};
};

int x, y;
int m[51][51];
int tx, ty, kx, ky;

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

int bfs(void){
  queue<P> que;
  que.push(P(tx, ty, kx, ky, 0));

  bool a[51][51][51][51];

  for(int i = 0;i < x; i++)
    for(int j = 0;j < y; j++)
      for(int k = 0;k < x; k++)
	for(int l = 0;l < y; l++) a[i][j][k][l] = false;

  int ans = 100;

  while(que.size()){
    P p = que.front(); que.pop();
    if(p.tax == p.kax && p.tay == p.kay || p.c > 100){
      ans = p.c;
      break;
    }

    for(int i = 0;i < 4; i++){
      int nx1 = p.tax + dx[i], ny1 = p.tay + dy[i];
      int nx2 = p.kax - dx[i], ny2 = p.kay - dy[i];

      if((0 > nx1 || 0 > ny1 || nx1 >= x || ny1 >= y || m[ny1][nx1] == 1) && (0 > nx2 || 0 > ny2 || nx2 >= x || ny2 >= y || m[ny2][nx2] == 1)) continue;

      if(0 > nx1 || 0 > ny1 || nx1 >= x || ny1 >= y || m[ny1][nx1] == 1)      nx1 = p.tax, ny1 = p.tay;
      else if(0 > nx2 || 0 > ny2 || nx2 >= x || ny2 >= y || m[ny2][nx2] == 1) nx2 = p.kax, ny2 = p.kay;
 
      if(a[nx1][ny1][nx2][ny2]) continue;

      a[nx1][ny1][nx2][ny2] = true;

      que.push(P(nx1, ny1, nx2, ny2, p.c + 1));
    }
  }
  return ans;
}

int main(void){

  for( ; ; ){
    cin >> x >> y;

    if(!x && !y) break;

    cin >> tx >> ty >> kx >> ky;
    tx--; ty--; kx--; ky--;

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

    int ans = bfs();
    if(ans >= 100) cout << "NA" << endl;
    else cout << ans << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
struct po{int x,y,a,b;};
int w,h;
int mp[51][51];
int tx,ty,kx,ky;
int dis[51][51][51][51];

po mkp(int a,int b,int c,int d){
  po res;
  res.x=a, res.y=b, res.a=c,res.b=d;
  return res;
}

int bfs(){
  int dx[]={0,0,-1,1};
  int dy[]={1,-1,0,0};

  memset(dis,0,sizeof(dis));
  queue <po> Q;
  Q.push(mkp(tx,ty,kx,ky));

  while(!Q.empty()){
    po t=Q.front();Q.pop();
    if(dis[t.y][t.x][t.b][t.a]>=100) return -1;
    if(t.x==t.a&&t.y==t.b) return dis[t.y][t.x][t.b][t.a];
    
    for(int i=0;i<4;i++){
      int nx=t.x+dx[i],ny=t.y+dy[i];
      int na=t.a-dx[i],nb=t.b-dy[i];
      if(nx<0||ny<0||nx>=w||ny>=h||mp[ny][nx])nx=t.x,ny=t.y;
      if(na<0||nb<0||na>=w||nb>=h||mp[nb][na])na=t.a,nb=t.b;
      if(dis[ny][nx][nb][na])continue;
      dis[ny][nx][nb][na]=dis[t.y][t.x][t.b][t.a]+1;
      Q.push(mkp(nx,ny,na,nb));
    }
  }
  return -1;
}

int main(){

  while(1){
  cin>>w>>h;
  cin>>tx>>ty>>kx>>ky;
  tx--,ty--,kx--,ky--;
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++) cin>>mp[i][j];
  int res=bfs();
  if(res==-1) cout << "NA"<<endl;
  else cout <<res<<endl;

    }
}