Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"math"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	dd := make([][]int, 1000)
	for i := range dd {
		dd[i] = make([]int, 1000)
	}
	num := make([]int,1000)
	inv := make([]int, 1001)
	x := make([]int, 1000)
	y := make([]int, 1000)
	vv := make([]int, 1000)
	nowt := make([]float64, 1000)
	rev := make([]int, 1000)
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf1 := strings.Split(scanner.Text(), " ")
			num[i], _ = strconv.Atoi(buf1[0])
			x[i], _ = strconv.Atoi(buf1[1])
			y[i], _ = strconv.Atoi(buf1[2])
			inv[num[i]] = i
		}
		for i := 0; i < n; i++ {
			for j := 0; j < n; j++ {
				dd[i][j]=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])
			}
		}
		scanner.Scan()
		m, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf2 := strings.Split(scanner.Text(), " ")
			c, _ := strconv.Atoi(buf2[0])
			d, _ := strconv.Atoi(buf2[1])
			c = inv[c]
			d = inv[d]
			for j := 0; j < n; j++ {
				vv[j] = 0
				nowt[j]=999999999
				rev[j]=-1
			}
			nowt[c]=0
			for j := 0; j < n; j++ {
				M := 99999999
				at := 0
				for k := 0; k < n; k++ {
					if vv[k] == 0 && float64(M) > nowt[k] {
						M=int(nowt[k])
						at = k
					}
				}
				if M > 90000000 {
					break
				}
				vv[at]=1
				for k := 0; k < n; k++ {
					if vv[k] == 0 && dd[at][k]<=2500&&nowt[k]>nowt[at]+math.Sqrt(float64(dd[at][k])) {
						nowt[k]=nowt[at]+math.Sqrt(float64(dd[at][k]))
						rev[k] = at
					}
				}
			}
			if vv[d] == 0 {
				fmt.Println("NA")
			} else {
				stack := make([]int, 0)
				V := d
				for V != c {
					stack = append(stack, V)
					V = rev[V]
				}
				fmt.Print(num[c])
				for len(stack) > 0 {
					fmt.Printf(" %d", num[stack[len(stack)-1]])
					stack = stack[:len(stack)-1]
				}
				fmt.Println()
			}
		}
	}
}

C++: #include <cstdio>
#include <cstdlib>
#include <csetjmp>
#include <cmath>
#include <utility>
#include <stack>
#include <queue>
#include <list>

#define SQ(X) \
  ( (X) * (X) )
#define N 1000

using namespace std;

typedef pair<double,int> arw;

typedef struct Building
{
  int x;
  int y;
  int mark;
  int p;
  double j;
  list<arw> neighbor;

  Building (
    )
  {
    x = -1;
    y = -1;

    return ;
  }
} Building;

int
main (
  int   argc,
  char *argv[ ]
  )
{
  list<arw>::iterator it;
  int i, j;

  for ( ; ; )
  {
    Building d[ N + 1 ];
    jmp_buf cont;
    int n;

    scanf ( "%d", &n );
    if ( n == 0 ) break ;

    /* ビル情報入力 */
    for ( i = 0; i < n; ++i )
    {
      int b, x, y;

      scanf ( "%d%d%d", &b, &x, &y );
      d[ b ].x = x;
      d[ b ].y = y;
    }

    /* 隣接点データを構築 */
    for ( i = 1; i <= N; ++i )
    {
      if ( d[ i ].x == -1 ) continue ;

      for ( j = i + 1; j <= N; ++j )
      {
        int r2;

        if ( d[ j ].x == -1 ) continue ;

        r2 = SQ( d[ j ].x - d[ i ].x ) + SQ( d[ j ].y - d[ i ].y );
        if ( r2 <= SQ( 50 ) )
        {
          d[ i ].neighbor.push_back ( make_pair ( sqrt ( r2 ), j ) );
          d[ j ].neighbor.push_back ( make_pair ( sqrt ( r2 ), i ) );
        }
      }
    }

    scanf ( "%d", &n );
    while ( n-- )
    {
      priority_queue<arw, vector<arw>, greater<arw> > lis;
      int src, dst;

      scanf ( "%d%d", &src, &dst );

      /* 初期化 */
      for ( i = 0; i <= N; ++i )
      {
        d[ i ].mark = 0;
        d[ i ].p = 0;
        d[ i ].j = 1e8;
      }

      /* 総距離優先探索 */
      lis.push ( make_pair( 0., dst ) );
      if ( setjmp ( cont ) == 0 )
      {
        while ( !lis.empty ( ) )
        {
          const arw c = lis.top ( );
          lis.pop ( );

          if ( d[ c.second ].mark )
            continue ;

          if ( c.second == src )
          {
            for ( i = src; i != 0; i = d[ i ].p )
            {
              if ( i != src )
                putchar ( ' ' );
              printf ( "%d", i );
            }
            puts ( "" );

            longjmp ( cont, 1 );
          }

          for ( it = d[ c.second ].neighbor.begin ( ); it != d[ c.second ].neighbor.end ( ); ++it )
          {
            const double jt = c.first + it->first;

            if ( d[ it->second ].mark )
              continue ;

            if ( jt < d[ it->second ].j )
            {
              d[ it->second ].p = c.second;
              d[ it->second ].j = jt;
              lis.push ( make_pair ( jt, it->second ) );
            }
          }

          d[ c.second ].mark = 1;
        }
        puts ( "NA" );
      }
    }
  }

  return ( EXIT_SUCCESS );
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define MAX 1000
#define INF 1e9
 
int V;
struct State {
    int x, y;
};
 
vector<State> vec;
 
double check(State a, State b)
{
    return sqrt(pow((a.x-b.x),2.) + pow(a.y-b.y,2.));
}
 
double dist[MAX];
bool used[MAX];
int _prev[MAX];
double cost[MAX][MAX];
 
void dijkstra(int s, int t)
{
    fill(dist, dist+MAX, INF);
    memset(used, false, sizeof(used));
    memset(_prev, -1, sizeof(_prev));
    dist[s] = 0;
 
    while (true) {
	int v = -1;
	for (int u = 0; u < V; u++) {
	    if (!used[u] && (v == -1 || 
			    dist[u] < dist[v])) {
		v = u;
	    }
	}
	if (v == -1) {
	    break;
	} else {
	    used[v] = true;
	}
 
	for (int u = 0; u < V; u++) {
	    if (dist[u] > dist[v] + cost[u][v] && cost[u][v] <= 50) {
		dist[u] = dist[v] + cost[u][v];
		_prev[u] = v;
	    }
	}
    }
 
    if (dist[t] == INF) {
	cout << "NA" << endl;
    } else {
	vector<int> path;
	for (int i = t; i != -1; i = _prev[i]) { 
	    path.push_back(i);
	}
	reverse(path.begin(), path.end());
     
	int len = path.size();
	for (int i = 0; i < len; i++) {
	    cout << path[i]+1 << (i == len-1 ? '\n' : ' ');
	}
    }
}
 
int main()
{
    int n, start, goal, num;
    State s;
 
    while (cin >> V, V) {
	State distance[MAX];
 
	vec.clear();
	fill(cost[0], cost[V], INF);
	for (int i = 0; i < V; i++) {
	    cin >> num >> s.x >> s.y;
	    vec.push_back(s);
	    distance[num-1] = s;
	}
 
	for (int i = 0; i < V-1; i++) {
	    for (int j = i+1; j < V; j++) {
		cost[i][j] = cost[j][i] = 
		    check(distance[i], distance[j]);
	    }
	}
  
	cin >> n;
	for (int i = 0; i < n; i++) {
	    cin >> start >> goal;
	    start--, goal--;
	    dijkstra(start, goal);
	}
    }
    return 0;
}