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 <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;
#define rep(i,n) for(int i=0;i<n;i++)


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

main(){
	int x,y;
	while(cin>>x>>y,x){
		int tx,ty,kx,ky;
		cin>>tx>>ty>>kx>>ky;
		int d[x][y];
		--tx;
		--ty;
		--kx;
		--ky;
		rep(i,x)rep(j,y)cin>>d[i][j];
		
		queue<pair<pair<pair<int,int>,pair<int,int> >,int> > state;
		set<pair<pair<int,int>,pair<int,int> > > past;
		
		state.push(make_pair(make_pair(make_pair(tx,ty),make_pair(kx,ky)),0));
		
		past.insert(make_pair(make_pair(tx,ty),make_pair(kx,ky)));
		
		int time=0;
		bool na=true;
		
		while(!state.empty()){
			pair<pair<int,int>,pair<int,int> > tp=state.front().first;
			time=state.front().second;
			state.pop();
			if(time>=99)break;
			if(tp.first==tp.second){
				na=false;
				break;
			}
			
			rep(i,4){
				int ttx=tp.first.first+dx[i],tty=tp.first.second+dy[i],
					tkx=tp.second.first-dx[i],tky=tp.second.second-dy[i];
				
				if(ttx<0 || ttx>=x || tty<0 || tty>=y || d[ttx][tty]==1){
					ttx-=dx[i];
					tty-=dy[i];
				}
				if(tkx<0 || tkx>=x || tky<0 || tky>=y || d[tkx][tky]==1){
					tkx+=dx[i];
					tky+=dy[i];
				}
				pair<pair<int,int>,pair<int,int> > next=make_pair(make_pair(ttx,tty),make_pair(tkx,tky));
				
				if(past.count(next))continue;
				past.insert(next);
				state.push(make_pair(next,time+1));
			}
		}
		
		if(na)puts("NA");
		else cout<<time<<endl;
	}
}

C++: #include <iostream>
#include <queue>
using namespace std;

const int INF=100000000;

class Point{
public:
  int tx;
  int ty;
  int kx;
  int ky;
};

int main(){
  while(true){
    int X,Y;
    cin>>X>>Y;
    if(X==0&&Y==0){
      break;
    }
    char F[X+2][Y+2];
    int D[X+1][Y+1];
    for(int x=1;x<=X;x++){
      for(int y=1;y<=Y;y++){
        D[x][y]=INF;
      }
    }
    int tx,ty,kx,ky;
    cin>>tx>>ty;
    cin>>kx>>ky;
    D[tx][ty]=0;
    D[kx][ky]=0;

    for(int x=0;x<=X+1;x++){
      for(int y=0;y<=Y+1;y++){
        F[x][y]=1;
      }
    }
    int a;
    for(int x=1;x<=X;x++){
      for(int y=1;y<=Y;y++){
        cin>>a;
        F[x][y]=a;
      }
    }


    queue<Point> que;

    Point p;
    p.tx=tx;
    p.ty=ty;
    p.kx=kx;
    p.ky=ky;
    que.push(p);

    while(!que.empty()){
      p=que.front();
      que.pop();

      if(p.tx==p.kx&&p.ty==p.ky){
        if(D[p.tx][p.ty]>100){
          cout<<"NA"<<endl;
          break;
        }
        cout<<D[p.tx][p.ty]<<endl;
        break;
      }

      if(D[p.tx-1][p.ty]==INF&&D[p.kx+1][p.ky]==INF){
        Point q;
        q.tx=p.tx-1;
        q.ty=p.ty;
        q.kx=p.kx+1;
        q.ky=p.ky;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx+1][p.ty]==INF&&D[p.kx-1][p.ky]==INF){
        Point q;
        q.tx=p.tx+1;
        q.ty=p.ty;
        q.kx=p.kx-1;
        q.ky=p.ky;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx][p.ty+1]==INF&&D[p.kx][p.ky-1]==INF){
        Point q;
        q.tx=p.tx;
        q.ty=p.ty+1;
        q.kx=p.kx;
        q.ky=p.ky-1;
        que.push(q);
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);
      }

      if(D[p.tx][p.ty-1]==INF&&D[p.kx][p.ky+1]==INF){
        Point q;
        q.tx=p.tx;
        q.ty=p.ty-1;
        q.kx=p.kx;
        q.ky=p.ky+1;
        if(F[q.tx][q.ty]==1){
          q.tx=q.tx+1;
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
        }else
        if(F[q.kx][q.ky]==1){
          q.kx=q.kx-1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }else{
          D[q.kx][q.ky]=D[p.kx][p.ky]+1;
          D[q.tx][q.ty]=D[p.tx][p.ty]+1;
        }
        que.push(q);=1;y<=Y;y++){
        cin>>a;
      }

    }
  }

  return 0;
}