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++: // AOJ 0155
// URL: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0155

#include <iostream>
#include <sstream>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;

typedef pair <int, vector <int> > PIV;
typedef pair <double, PIV > PDV;
typedef priority_queue <PDV, vector<PDV>, greater <PDV> > QUEUE;

const double eps = 1e-9;
const int size = 1001;
const string NA = "NA";
int n, m;
int b[size], x[size], y[size];
map <int, int> cor; // number to index
bool path[size][size];
double cost[size][size];
double min_cost[size];
int con[size][size]; // connect
int concnt[size]; // connect count

double get_distance( int x1, int y1, int x2, int y2 )
{
    double x = ( x2 - x1 ), y = ( y2 - y1 );
    return fabs( sqrt( x * x + y * y ) );
}

// dijkstra
string solve( int s_, int g_ )
{
    int start = cor[s_], goal = cor[g_];
    if ( !path[start][goal] ) return NA;

    // init
    ostringstream os;
    QUEUE Q;
    PDV start_node( 0.0, PIV( start , vector<int>() ) );
    Q.push( start_node );
    min_cost[start] = 0.0;

    // proc
    while ( !Q.empty() ) {
        PDV node = Q.top();
        Q.pop();

        // proc init
        double c = node.first;
        int ind = node.second.first;
        int number = b[ind];
        vector <int> route = node.second.second;
        route.push_back( number );

        // cout << ind << "(" << number << "), c=" << c << ", route.size=" << route.size() << endl;

        // goal, output
        if ( number == g_ ) {
            for ( vector <int> ::iterator it = route.begin(); it != route.end(); it++ ) {
                os << *it;
                if ( it + 1 != route.end() ) os << " ";
            }
            return os.str();
        }

        // move
        for ( int i = 0; i < concnt[ind]; i++ ) {
            int next_ind = con[ind][i];
            int next_number = b[next_ind];
            double next_c = c + cost[ind][next_ind];
            if ( next_c < min_cost[next_ind] ) {
                min_cost[next_ind] = next_c;
                PDV next_node( next_c, PIV( next_ind, route ) );
                Q.push( next_node );
            }
        }
    }

    return NA;
}

int main( void )
{
    while ( cin >> n && n ) {
        // init
        cor.clear();
        for ( int i = 0; i < n; i++ ) {
            min_cost[i] = (double)(1<<24);
            for ( int j = 0; j < n; j++ ) {
                cost[i][j] = (double)(1<<24);
                path[i][j] = false;
            }
            concnt[i] = 0;
        }

        // input
        for ( int i = 0; i < n; i++ ) {
            cin >> b[i] >> x[i] >> y[i];
            cor[b[i]] = i;
        }

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( i == j ) continue;
                cost[i][j] = get_distance( x[i], y[i], x[j], y[j] );
            }
        }

        // proc
        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( i == j ) continue;
                if ( !(cost[i][j] > 50.0) ) {
                    path[i][j] = true;
                    con[i][concnt[i]++] = j;
                }
            }
        }

        // floyd-warshall
        for ( int k = 0; k < n; k++ ) {
            for ( int i = 0; i < n; i++ ) {
                for ( int j = 0; j < n; j++ ) {
                    if ( i == k || k == j || j == i ) continue;
                    if ( path[i][k] && path[k][j] ) path[i][j] = true;
                }
            }
        }

        // query
        cin >> m;
        for ( int i = 0; i < m; i++ ) {
            int s, t;
            cin >> s >> t;
            cout << solve( s, t ) << endl;
        }
    }
    return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define ub upper_bound
#define lb lower_bound
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;



struct Edge{
  int src;int dst;double wei;
  Edge(int s=0,int d=0,double w=0):src(s),dst(d),wei(w){}
};

using Graph = vector<vector<Edge>>;

pair<vector<double>,vector<int>> Dij(Graph&g,int s){
    using state = pair<double,int>;//テ」ツつウテ」ツつケテ」ツδ暗」ツ?ョテァツキツ湘・ツ陳古」ツ??」ツ?ゥテ」ツ?禿」ツ?凝」ツつ嘉ィツヲツ凝」ツ?ヲテ」ツ??」ツつ凝」ツ?ョテ」ツ??
    priority_queue<state,vector<state>,greater<state>> pq;
    vector<int> from(g.size());
    vector<double> dis(g.size(),INF);
    dis[s]=0;
    pq.push(state(0,s));
    while(!pq.empty()){
      double d=pq.top().first;
      int v=pq.top().second;
      pq.pop();
      if(dis[v]<d)continue;
      rep(i,g[v].size()){
        Edge &e=g[v][i];
        if(dis[e.dst]>dis[v]+e.wei){
          dis[e.dst]=dis[v]+e.wei;
          pq.push(state(dis[e.dst],e.dst));
          from[e.dst]=v;
        }
      }
    }
    return mp(dis,from);
}

signed main(){
    int n;
    while(cin>>n,n){
    vector<int> B(n),X(n),Y(n);
    rep(i,n)cin>>B[i]>>X[i]>>Y[i];
    Graph g(n);
    rep(i,n)rep(j,n){
      if(i==j)continue;
      double x=abs(X[i]-X[j]);
      double y=abs(Y[i]-Y[j]);
      if(x*x+y*y<=2500){
        double dst=pow(x*x+y*y,0.5);
        g[i].emplace_back(i,j,dst);
        g[j].emplace_back(j,i,dst);
      }
    }

    int m;
    cin>>m;
    vector<int> S(m),G(m);
    rep(i,m)cin>>S[i]>>G[i];
    rep(i,m){
      auto ans=Dij(g,S[i]-1);
      if(ans.fir[G[i]-1]==INF){
        cout<<"NA"<<endl;
        continue;
      }
      stack<int> path;
      for(int j=G[i]-1;;j=ans.sec[j]){
        path.push(j);
        if(j==S[i]-1)break;
      }
      while(!path.empty()){
        cout<<path.top()+1;
        if(path.size()!=1)cout<<' ';
        path.pop();
      }
      cout<<endl;
    }

  }

  return 0;
}