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<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
int N,M;
vector<P> ps;
const int INF = (1<<29);

int tw( int a ){ return a*a; }
int dis( P a, P b ){
  return tw( a.first - b.first ) + tw( a.second - b.second );
}
bool check( P a, P b ){
  return tw( a.first - b.first ) + tw( a.second - b.second ) <= tw( 50 );
}

void dijk(int s,int g){
  priority_queue<P,vector<P>,greater<P> > q;
  vector<int> H(N,INF);
  vector<int> R(N,-1);
  q.push( P(0,s) );
  H[s] = 0;
  R[s] = -1;
  while( !q.empty() ){
    P p = q.top(); q.pop();
    for(int to=0;to<N;to++){
      if( check( ps[p.second], ps[to] ) ){
        int nc = p.first + dis( ps[ p.second ], ps[ to ] );
        if( H[ to ] > nc ){
          H[ to ] = nc;
          R[ to ] = p.second;
          q.push( P( nc, to ) );
        }
      }
    }
  }
  vector<int> ret;
  if( H[ g ] == INF ) {
    cout << "NA" << endl; return;
  }
  for( int i = g; i != -1; i=R[i] ) 
    ret.push_back( i );
  
  reverse( ret.begin(), ret.end() );
  for( int i=0;i<(int)ret.size();i++ ){
    if( i ) cout << " ";
    cout << ret[i]+1;
  }
  cout << endl;
}

int main(){
  while( cin >> N && N ) {
    ps = vector<P>(N);
    for(int i=0;i<N;i++){
      int b,x,y; cin >> b >> x >> y; --b;
      ps[b] = P(x,y);
    }
    cin >> M;
    for(int i=0;i<M;i++){
      int s,g; cin >> s >> g; --s; --g;
      dijk( s, g );
    }
  }
}

C++: #include<iostream>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<functional>
using namespace std;
typedef pair<double, int> P;
priority_queue<P, vector<P>, greater<P>> Q;
#define MAX_N 1005
int x[MAX_N], y[MAX_N]; double dist[MAX_N];
vector<int>path[MAX_N]; vector<P>X[MAX_N];
void dijkstra(int a, int b) {
	memset(dist, 1e+9, sizeof(dist));
	for (int i = 0; i < MAX_N; i++) { path[i].clear(); dist[i] = 1e+9; }
	Q.push(make_pair(0.0, a)); dist[a] = 0; path[a].push_back(a);
	while (!Q.empty()) {
		pair<double, int>pa = Q.top(); Q.pop();
		double a1 = pa.first; int a2 = pa.second;
		for (int i = 0; i < X[a2].size(); i++) {
			int to = X[a2][i].second; double dis = X[a2][i].first;
			if (dist[to] > a1 + dis) {
				dist[to] = a1 + dis; path[to].clear();
				path[to] = path[a2]; path[to].push_back(to);
				Q.push(make_pair(dist[to], to));
			}
		}
	}
	if (path[b].size() == 0) { cout << "NA" << endl; }
	else {
		for (int i = 0; i < path[b].size(); i++) { if (i) { cout << ' '; } cout << path[b][i]; }
		cout << endl;
	}
}
int main() {
	int N, Q, s, g, a, b, c;
	while (true) {
		for (int i = 0; i < MAX_N; i++) { X[i].clear(); }
		cin >> N; if (N == 0) { break; }
		for (int i = 0; i < N; i++) { cin >> a >> b >> c; x[a] = b; y[a] = c; }
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= N; j++) {
				double dist2 = sqrtl((x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]));
				if (dist2 <= 50.0) {
					X[i].push_back(make_pair(dist2, j));
				}
			}
		}
		cin >> Q;
		for (int i = 0; i < Q; i++) { 
			cin >> s >> g; dijkstra(s, g); 
		}
	}
	return 0;
}