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<string.h>
using namespace std;
struct Y{
int hx,hy,rx,ry,tim;
};
int mp[52][52],vh[52][52],vr[52][52];
int main(){
int n,w,h,i,j,a[2]={1,-1},b[2],g,k;
Y e;
queue<Y> q;
while(1){
	g=0;
	k=0;
	cin>>w>>h;
	if(w==0&&h==0)break;
	cin>>e.hx>>e.hy>>e.rx>>e.ry;
	e.tim=0;
	q.push(e);
	memset(mp,0,sizeof(mp));
	memset(vr,0,sizeof(vr));
	memset(vh,0,sizeof(vh));
	for(i=0;i<=h+1;i++){
		mp[i][0]=1;
		mp[i][w+1]=1;
	}
	for(i=0;i<=w+1;i++){
		mp[0][i]=1;
		mp[h+1][i]=1;
	}
	for(i=1;i<=h;i++){
		for(j=1;j<=w;j++){
			cin>>mp[j][i];
			if(mp[j][i]==1)k++;
		}
	}
	while(1){
		e=q.front();
		q.pop();
				if(vh[e.hy][e.hx]!=1)g++;
				if(vr[e.ry][e.rx]!=1)g++;
				vh[e.hy][e.hx]=1;
				vr[e.ry][e.rx]=1;
		if(e.tim>=100||e.hx==e.rx&&e.hy==e.ry||g==(w*h-k)*2)break;
		e.tim++;
		for(i=0;i<2;i++){
			if(mp[e.hy+a[i]][e.hx]!=1&&vh[e.hy+a[i]][e.hx]!=1||mp[e.ry-a[i]][e.rx]!=1&&vr[e.ry-a[i]][e.rx]!=1){
				b[0]=0;
				b[1]=0;
				if(mp[e.hy+a[i]][e.hx]!=1){
					e.hy+=a[i];
					b[0]=1;
				}
				if(mp[e.ry-a[i]][e.rx]!=1){
					e.ry-=a[i];
					b[1]=1;
				}
				if(vh[e.hy][e.hx]!=1)g++;
				if(vr[e.ry][e.rx]!=1)g++;
				vh[e.hy][e.hx]=1;
				vr[e.ry][e.rx]=1;
				q.push(e);
				if(b[0]==1)e.hy-=a[i];
				if(b[1]==1)e.ry+=a[i];
			}																									
			if(mp[e.hy][e.hx+a[i]]!=1&&vh[e.hy][e.hx+a[i]]!=1||mp[e.ry][e.rx-a[i]]!=1&&vr[e.ry][e.rx-a[i]]!=1){
				b[0]=0;
				b[1]=0;
				if(mp[e.hy][e.hx+a[i]]!=1){
					e.hx+=a[i];
					b[0]=1;
				}
				if(mp[e.ry][e.rx-a[i]]!=1){
					e.rx-=a[i];
					b[1]=1;
				}
				if(vh[e.hy][e.hx]!=1)g++;
				if(vr[e.ry][e.rx]!=1)g++;
				vh[e.hy][e.hx]=1;
				vr[e.ry][e.rx]=1;
				q.push(e);
				if(b[0]==1)e.hx-=a[i];
				if(b[1]==1)e.rx+=a[i];
			}
		}
		e.tim--;
	}
	while(!q.empty())q.pop();
	if(e.tim>=100||g==(w*h-k)*2)printf("NA\n");
	else cout<<e.tim<<endl;
}
return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PA;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int main(){
  int w,h,tx,ty,kx,ky,ans;
  int de[55][55];
  int cnt[55][55];
  fill_n(*cnt,55*55,-1);
  queue<PA> que;
  while(cin >> w >> h,w!=0&&h!=0){
    cin >> tx >> ty >> kx >> ky;
    for(int i=1;i<=h;i++){
      for(int j=1;j<=w;j++){
	cin >> de[i][j];
      }
    }
    if( (tx+kx)%2 != 0 || (ty+ky)%2 != 0){
      puts("NA");
      continue;
    }
    que.push(PA(0,0));
    cnt[ty][tx] = 0;
    cnt[ky][kx] = 0;
    ans = 100;
    while(!que.empty()){
      PA p = que.front();
      que.pop();
      for(int i=0;i<4;i++){
	int y1 = ty + p.first + dy[i];
	int x1 = tx + p.second + dx[i];
	int y2 = ky - p.first - dy[i];
	int x2 = kx - p.second - dx[i];
	if(x1<=0||y1<=0||x1>w||y1>h||de[y1][x1]==1) continue;
	if(x2<=0||y2<=0||x2>w||y2>h||de[y2][x2]==1) continue;
	de[y1][x1] = 1;
	de[y2][x2] = 1;
	cnt[y1][x1] = cnt[ty+p.first][tx+p.second]+1;
	cnt[y2][x2] = cnt[ky-p.first][kx-p.second]+1;
	if(y1==y2&&x1==x2) ans = min(ans,cnt[y1][x1]);
	que.push(PA(p.first+dy[i],p.second+dx[i]));	
      }
    }
    if(ans == 100) puts("NA");
    else cout << ans << endl;
  }
  return(0);
}

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>
#include <cassert>
#include <list>
using namespace std;
static const double EPS = 1e-8;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PI;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SZ(a) (int(a.size()))
#define F first
#define S second
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};

int X,Y,tx,ty,kx,ky;
int wall[50][50];
bool vis[50][50][50][50];

typedef struct _node{
  int cost,tx,ty,kx,ky;
  int geth()const{
    return (abs(tx-kx)+abs(ty-ky))/2;
  }
  bool operator<(const _node& r)const{
    return cost+geth()>r.cost+r.geth();
  }
  _node (int c,int atx,int aty,int akx,int aky){
    cost=c;
    tx=atx;
    ty=aty;
    kx=akx;
    ky=aky;
  }
}node;

void solve(){
  scanf("%d%d%d%d",&tx,&ty,&kx,&ky);
  --tx,--ty,--kx,--ky;
  rep(i,Y)rep(j,X)scanf("%d",wall[i]+j);
  
  priority_queue<node>q;
  q.push(node(0,tx,ty,kx,ky));
  memset(vis,0,sizeof(vis));
  while(!q.empty()){
    int cc=q.top().cost;
    tx=q.top().tx;
    ty=q.top().ty;
    kx=q.top().kx;
    ky=q.top().ky;
    int h=q.top().geth();
    q.pop();
    if(cc+h>=100 || vis[tx][ty][kx][ky])continue;
    vis[tx][ty][kx][ky]=true;
    if(tx==kx && ty==ky){
      printf("%d\n",cc);
      return;
    }
    rep(i,4){
      int ntx=tx+dx[i],nty=ty+dy[i];
      int nkx=kx-dx[i],nky=ky-dy[i];

      if(0>ntx || ntx>=X ||
         0>nty || nty>=Y ||
         wall[nty][ntx])ntx=tx,nty=ty;
      if(0>nkx || nkx>=X ||
         0>nky || nky>=Y ||
         wall[nky][nkx])nkx=kx,nky=ky;
      if(vis[ntx][nty][nkx][nky])continue;
      q.push(node(cc+1,ntx,nty,nkx,nky));
    }
  }
  printf("NA\n");
}

main(){
  while(scanf("%d%d",&X,&Y),X)
    solve();
}