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 <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

#define MAX 1010
#define INF (1<<29)

struct Point{
  int x, y, id;
  Point(int x = 0, int y = 0) : x(x), y(y) {}
  Point operator -(Point p){
    return Point(x-p.x, y-p.y);
  }
};

vector<Point> bill;
double dist[MAX][MAX];
int prev[MAX];
int V;

void init(){
  bill.clear();
  for(int i = 0 ; i < MAX ; i++){
    for(int j = 0 ; j < MAX ; j++){
      dist[i][j] = INF;
      if(i == j) dist[i][j] = 0;
    }
  }
}

void dijkstra(int s){
  int d[MAX];
  bool used[MAX];
  fill(d, d+MAX, INF);
  fill(used, used+MAX, false);
  fill(prev, prev+MAX, -1);
  d[s] = 0;
  
  while(true){
    int v = -1;
    for(int u = 0 ; u < V ; u++){
      if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
    }
    if(v == -1) break;
    used[v] = true;
    
    for(int u = 0 ; u < V ; u++){
      if(d[u] > d[v] + dist[v][u]){
	d[u] = d[v] + dist[v][u];
	prev[u] = v;
      }
    }
  }
}

vector<int> get_path(int t){
  vector<int> path;
  for(; t != -1 ; t = prev[t]) path.push_back(t);
  reverse(path.begin(), path.end());
  return path;
}

inline double getDist(int from, int to){
  double ret = sqrt( ((bill[from].x - bill[to].x)*(bill[from].x - bill[to].x)) +
		     ((bill[from].y - bill[to].y)*(bill[from].y - bill[to].y)) );
  return ret;
}
  
int main(){
  while(cin >> V, V){
    init();
    Point p;
    for(int i = 0 ; i < V ; i++){
      cin >> p.id >> p.x >> p.y;
      p.id--;
      bill.push_back(p);
    }
    
    for(int i = 0 ; i < V ; i++){
      for(int j= i ; j < V ; j++){
	double dis = getDist(bill[i].id, bill[j].id);
	if(dis > 50.0) continue;
	dist[bill[i].id][bill[j].id] = dist[bill[j].id][bill[i].id] = dis;
      }
    }
    int m;    
    cin >> m;
    int s, g;
    while(m--){
      cin >> s >> g;
      s--, g--;
      dijkstra(s);
      vector<int> ans_path = get_path(g);
      if(ans_path.size() <= 1) cout << "NA" << endl;
      else{
	for(int i = 0 ; i < (int)ans_path.size() ; i++){
	  if(i == (int)ans_path.size()-1) cout << ans_path[i]+1 << endl;
	  else cout << ans_path[i]+1 << ' ';
	}
      }
    } 
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<double,double> P;

int main() {
  int n;
  while(cin >> n && n) {
    P a[n];
    for(int i=0,x,y,z; i<n; i++) {
      cin >> z >> x >> y;z--;
      a[z]=P(x,y);
    }
    int m;
    cin >> m;
    while(m--) {
      int s,t;
      cin >> s >> t;s--,t--;
      int p[n];double d[n];
      fill(d,d+n,1<<30);
      d[s]=0;
      p[s]=-1;
      priority_queue<P,vector<P>,greater<P> > que;
      que.push(P(0,s));
      while(!que.empty()) {
        P pp=que.top();que.pop();
        int x=pp.S;
        double c=pp.F;
        if(d[x]<c) continue;
        for(int i=0; i<n; i++) {
          double dd=sqrt((a[i].F-a[x].F)*(a[i].F-a[x].F)+(a[i].S-a[x].S)*(a[i].S-a[x].S));
          if(dd<=50&&d[i]>d[x]+dd) {
            d[i]=d[x]+dd;
            p[i]=x;
            que.push(P(d[i],i));
          }
        }
      }
      if(d[t]==1<<30) {
        cout << "NA" << endl;
        continue;
      }
      vector<int> ans;
      while(t!=s) {
        ans.push_back(t);
        t=p[t];
      }
      ans.push_back(s);
      reverse(ans.begin(),ans.end());
      for(int i=0; i<ans.size(); i++) {
        if(i) cout << " ";
        cout << ans[i]+1;
      }
      cout << endl;
    }
  }
  return 0;
}