Go: package main

import (
	"fmt"
	"math"
	"container/heap"
)

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)
	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)
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}
		if v, ok := memo[now.Person]; ok && v <= now.Turn {
			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)
			}
		}
	}
	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 <iostream>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <queue>
using namespace std;

struct NODE{
	int x1,y1,x2,y2,c;
	NODE(int x1,int y1,int x2,int y2,int c) : x1(x1) , y1(y1) , x2(x2) , y2(y2) , c(c) {}
	
};

bool memo[52][52][52][52];

int main(){
	int n;
	int W,H;
	while(cin >> W >> H && W){
		int sx,sy,gx,gy;
		cin >> sx >> sy >> gx >> gy;
		int t[52][52];
		for(int i = 0 ; i < 52 ; i++)
			for(int j = 0 ; j < 52 ; j++)
				t[i][j] = 1;
			
		for(int i = 1 ; i <= H ; i++)
			for(int j = 1 ; j <= W ; j++)
				cin >> t[i][j];
		queue<NODE> Q;
		Q.push(NODE(sx,sy,gx,gy,0));
		memset(memo,0,sizeof(memo));
		int dx[] = {-1,0,1,0};
		int dy[] = {0,1,0,-1};
		while(Q.size()){
			NODE q = Q.front(); Q.pop();
			if( q.c > 100 ) break;
			if( q.x1 == q.x2 && q.y1 == q.y2 ) {
				cout << q.c << endl;
				goto exit;
			}
			if( memo[q.x1][q.y1][q.x2][q.y2] ) continue;
			else memo[q.x1][q.y1][q.x2][q.y2] = true;
			for(int i = 0 ; i < 4 ; i++){
				int x1 = q.x1 + dx[i] , y1 = q.y1 + dy[i];
				int x2 = q.x2 - dx[i] , y2 = q.y2 - dy[i];
				if( t[y1][x1] ) x1 = q.x1 , y1 = q.y1;
				if( t[y2][x2] ) x2 = q.x2 , y2 = q.y2;
				Q.push(NODE(x1,y1,x2,y2,q.c+1));
			}
		}
		cout << "NA" << endl;
		exit:;
		
	}
}

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

const int needleX[4] = {-1, 0, 1, 0};
const int needleY[4] = {0, -1, 0, 1};

pair<int, int> newPoint(pair<int, int> nowPoint, int i, vector<vector<bool> >& depart, bool takayuki){
  pair<int, int> result;
  result.first = nowPoint.first + (needleX[i] * (takayuki ? 1 : -1));
  result.second = nowPoint.second + (needleY[i] * (takayuki ? 1 : -1));
  if(!depart[result.first][result.second]){ result = nowPoint; }
  return result;
}

int main(void){
  while(true){
    int w, h;
    cin >> w >> h;
    if(w == 0 && h == 0){ break; }
    pair<int, int> takayuki, kazuyuki;
    cin >> takayuki.first >> takayuki.second;
    cin >> kazuyuki.first >> kazuyuki.second;

    int input;
    vector<vector<bool> > depart(w + 2, vector<bool>(h + 2, false));
    for(int i = 1; i <= w; i++){
      for(int j = 1; j <= h; j++){
        cin >> input;
        if(input == 0){ depart[i][j] = true; }
      }
    }

    int ans = -1;
    set<pair<pair<int, int>, pair<int, int> > > used;
    queue<pair<int, pair<pair<int, int>, pair<int, int> > > > wait;
    used.insert(make_pair(takayuki, kazuyuki));
    wait.push(make_pair(0, make_pair(takayuki, kazuyuki)));
    while(!wait.empty()){
      int cost = wait.front().first;
      pair<int, int> t = wait.front().second.first;
      pair<int, int> k = wait.front().second.second;
      wait.pop();
      
      if(t == k){
        ans = cost;
        break;
      }

      for(int i = 0; i < 4; i++){
        pair<int, int> newt = newPoint(t, i, depart, true);
        pair<int, int> newk = newPoint(k, i, depart, false);
        if(used.count(make_pair(newt, newk)) == 0){
          used.insert(make_pair(newt, newk));
          wait.push(make_pair(cost + 1, make_pair(newt, newk)));
        }
      }
    }
    
    if(ans == -1){ cout << "NA" << endl; }
    else{ cout << ans << 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];
  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));
    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;
	if(y1==y2&&x1==x2) ans = min(ans,abs(ty-y1)+abs(tx-x1));
	de[y1][x1] = 1;
	de[y2][x2] = 1;
	que.push(PA(p.first+dy[i],p.second+dx[i]));	
      }
    }
    if(ans == 100) puts("NA");
    else cout << ans << endl;
  }
  return(0);
}