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<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iostream>
#include<cmath>

using namespace std;
typedef vector<string>vs;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef vector<double>vd;
typedef pair<int,int>pii;
typedef long long ll;
typedef pair<ll,ll>pll;
typedef vector<ll>vl;
#define rrep(i,x,n) for(int i=(x);i<(n);++i)
#define rep(i,x) rrep(i,0,(x))
#define fi first
#define se second
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define maxs(a,b) (a)=max(a,b)
#define mins(a,b) (a)=min(a,b)

struct Edge{
    int to;
    double cost;
    Edge(int a,int b):
        to(a),cost(b){}
    Edge(){}
};

struct Visit{
    int pos;
    double total;
    Visit(int a,double b):
        pos(a),total(b){}
    Visit(){}
    bool operator<(const Visit &v)const{
        return total>v.total;
    }
};
const double INF=1e9;
const double EPS=1e-8;
int N;
vector<vector<Edge> >G;
int b[1000],x[1000],y[1000];

void solve(int s,int g){
    double D[1000];
    fill_n(D,1000,INF);
    priority_queue<Visit>Q;
    Q.push(Visit(s,0));
    while(!Q.empty()){
        Visit v=Q.top();
        Q.pop();
        if(D[v.pos]!=INF)continue;
        D[v.pos]=v.total;
        rep(i,G[v.pos].size()){
            Edge e=G[v.pos][i];
            if(D[e.to]!=INF)continue;
            Q.push(Visit(e.to,v.total+e.cost));
        }
    }
    if(D[g]==INF){
        puts("NA");
        return;
    }
    vi ans;
    ans.pb(g);
    while(s!=g){
        rep(i,G[g].size()){
            Edge &e=G[g][i];
            if(fabs(D[e.to]+e.cost-D[g])<EPS){
                ans.pb(e.to);
                g=e.to;
                break;
            }
        }
    }
    reverse(all(ans));
    rep(i,ans.size()){
        if(i)printf(" ");
        printf("%d",b[ans[i]]);
    }
    puts("");
}

int main(){
    while(scanf("%d",&N),N){
        G=vector<vector<Edge> >(N);
        rep(i,N){
            scanf("%d%d%d",&b[i],&x[i],&y[i]);
            rep(j,i){
                double dist=sqrt(pow(x[i]-x[j],2)+pow(y[i]-y[j],2));
                if(dist<=50.0){
                    G[i].pb(Edge(j,dist));
                    G[j].pb(Edge(i,dist));
                }
            }
        }

        int M;
        scanf("%d",&M);
        while(M--){
            int s,g;
            scanf("%d%d",&s,&g);
            rep(i,N){
                if(b[i]==s){
                    s=i;
                    break;
                }
            }
            rep(i,N){
                if(b[i]==g){
                    g=i;
                    break;
                }
            }


            solve(s,g);

        }
    }

    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <memory.h>
#include <vector>
#include <map>
#include <cstdlib>
#include <ctime>
using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
typedef pair<double, int> state;
const int CLK = CLOCKS_PER_SEC;

int s, g;
double memo[100];
int pre[100];
int name[100];
double x[100];
double y[100];

map<int, int> nums;

double dis(int i, int j){
  return sqrt((x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]));
}

double heuristics(int v){
  return dis(v, nums[g]);
}

int main(){
  int n, m;
  int b;
  int cnt = 0;
  while(cin >> n &&n){
    nums.clear();
    rep(i, n){
      cin >> b >> x[i] >> y[i];
      name[i] = b;
      nums[b] = i;
    }
    cin >> m;
    rep(i, m){
      memset(pre, -1, sizeof(pre));
      fill(memo, memo + 100, 1e10);
      cin >> s >> g;
      memo[nums[s]] = heuristics(nums[s]);
      priority_queue<state, vector<state>, greater<state> > que;
      que.push(state(heuristics(nums[s]), nums[s]));
      while(!que.empty()){
	cnt++;
	state st = que.top();
	que.pop();
	int v = st.second;
	double fcost = st.first;
	double gcost = fcost - heuristics(v);
	if(name[v] == g){
	  break;
	}
	if(fcost > memo[v]) continue;
	rep(i, n){
	  double d = dis(v, i);
	  if(d > 50.0) continue;
	  if(memo[i] > gcost + d + heuristics(i)){
	    memo[i] = gcost + d + heuristics(i);
	    pre[i] = v;
	    que.push(state(memo[i], i));
	  }
	}
      }
      if(pre[nums[g]] == -1 && s != g){
	cout << "NA" << endl;
      }else{
	vector<int> res;
	int v = nums[g];
	res.push_back(v);
	while(pre[v] >= 0){
	  v = pre[v];
	  res.push_back(v);
	}
	rep(i, (int)res.size()){
	  if(i != 0) cout << " " ;
	  cout << name[res[res.size() - 1 - i]];
	}
	cout << endl;
      }
    }
  }
  //cout << cnt << endl;
  return 0;
}