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 <iomanip>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
 
using namespace std;
 
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define rep(i,n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 

 
const int INF = 1000000;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
//const double D_INF = 1e18;

const double PI = acos(-1);

int dx[] ={-1,0,1,0};
int dy[] ={0,-1,0,1};

struct Edge
{
	int t, c;
	Edge(){};
	Edge(int t, int c) : t(t), c(c){};
};

int n;
int b[1010], x[1010], y[1010];
vector<Edge> edge[1010];

pair<int, int> d[1010];
bool used[1010];
vi ans;

void dijkstra(int s){
	rep(i, 1010){
		d[i] = mp(INF, -1);
		used[i] = false;
	}
	d[s].fi = 0;
	priority_queue<pii, vector<pii>, greater<pii> > q;
	pii p;
	q.push({0, s});
	int from, to, cost;
	while(!q.empty()){
		p = q.top(); q.pop();
		from = p.se;
		cost = p.fi;
		used[from] = true;
		for(int i = 0; i < edge[from].size(); i++){
			to = edge[from][i].t;
			//if(used[to]) continue;
			if(d[to].fi > cost+edge[from][i].c){
				d[to].fi = cost+edge[from][i].c;
				d[to].se = from;
				q.push(mp(d[to].fi, to));
			}
		}
	}
}

int main(){
	int m, dx, dy;
	while(cin>>n && n){
		//cout<<n<<endl;
		rep(i, 1010){
			b[i]=x[i]=y[i] = -1;
			d[i] = mp(INF, -1);
			used[i] = false;
			edge[i].clear();
		}
		rep(i, n) cin>>b[i]>>x[i]>>y[i];
		for(int i = 0; i < 1010; i++){
			if(b[i] == -1 || x[i] == -1 || y[i]== -1) continue;
			for(int j = i + 1; j < 1010; j++){
				if(b[j] == -1 || x[j] == -1 || y[j] == -1) continue;
				dx = x[i]-x[j];
				dy = y[i]-y[j];
				if(dx*dx+dy*dy>2500)continue;
				edge[b[i]].push_back(Edge(b[j], dx*dx+dy*dy));
				edge[b[j]].push_back(Edge(b[i], dx*dx+dy*dy));
			}
		}
		//cout<<edge[1][0].t<<" "<<edge[1][0].c<<endl;
		//cout<<edge[2][0].t<<" "<<edge[2][0].c<<endl;

		cin>>m;
		rep(i, m){
			int s, g;
			cin>>s>>g;
			//cout<<s<<" "<<g<<endl;
			dijkstra(s);
			if(d[g].fi==INF) {
				cout<<"NA"<<endl;
				continue;
			}
			ans.clear();
			//bool usedG[1010]={};
			while(1){
				ans.pb(g);
				if(g == s /*|| g == -1*/) break;
				//usedG[g] = true;
				g = d[g].se;
				//if(usedG[g]) break;
				//cout<<"  "<<g<<endl;
			}
			//while(ans.size()> 0 && ans.back()==-1) ans.pop_back();
			reverse(all(ans));
			rep(j, ans.size()){
				if(j != 0) cout<<" ";
				cout<<ans[j];
			}
			cout<<endl;
		}
	}
}

C++: #include<iostream>
#include<cmath>
#include<climits>
using namespace std;

int b[1000],cur_spot,start,goal,q[1000];
bool used[1000];
int x[1000],y[1000];
double mindist[1000],cur;


void dijkstra(int s,int g,int n){
  
  int cnt=0,keiro[1000],a;
  double kyori;
  
  for(int i=0 ; i < 1000 ; i++){
    mindist[i]=1000000;
    used[i]=0;
    q[i]=-1;
  }

  for(int i=0 ; i < n ; i++){
    if(b[i] == s){
      start=i;
    }else if( b[i] == g){
      goal=i;
    } 
  }
  
  mindist[start]=0;
  
  for(int i=0 ; i < n ; i++){
    cur=INT_MAX;
    for(int j=0 ; j < n ; j++){
      if(used[j]== 0){
	if(cur >= mindist[j]){
	  cur=mindist[j];
	  cur_spot=j;
	}
      }
    }      
    used[cur_spot]=1;
    
    for(int j=0 ; j < n ; j++){
      
      if(j == cur_spot)continue;
      
      kyori=sqrt((x[j]-x[cur_spot])*(x[j]-x[cur_spot])+(y[j]-y[cur_spot])*(y[j]-y[cur_spot]));
      
      if(kyori <= 50 && used[j] == 0){
	if(mindist[j] > mindist[cur_spot]+ kyori){
	  mindist[j]=mindist[cur_spot]+kyori;
	  q[j]=cur_spot;
	}
      }
    }
  }
  
  if(q[goal] == -1){
    cout <<"NA"<<endl;
  }else{
    a=goal;
    while(1){
      keiro[cnt]=b[a];
      a=q[a];
      if(a == -1)break;
      cnt++;
    }

    for(int i=cnt ; i >= 0 ; i--){
      cout <<keiro[i];
      if(i != 0)cout <<" ";
    }
    cout <<endl;
  }
}
int main(){
  
  int n,m,s,g;
  
  while(1){

    cin >> n;
    
    if(n == 0)break;
    
    for(int i=0 ; i < n ; i++){
      cin >>b[i]>>x[i]>>y[i];
    }
    
    cin >>m;
    
    for(int i=0 ; i < m ; i++){
      cin >>s>>g;
      dijkstra(s,g,n);
    }
  } 
  
  return 0;
  
}

C++: #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int n;
ll G[101][101];

void dijkstra(int s,int g){
  ll D[101],from[101];
  from[g]=-1;
  for(int i=0;i<101;i++) D[i]=INF;
  priority_queue<P,vector<P>,greater<P> > Q;
  D[s]=0;
  Q.push(P(0,s));
  while(!Q.empty()){
    P t=Q.top(); Q.pop();
    ll pos=t.second,cost=t.first;
    if(pos==g) break;
    if(D[pos]<cost) continue;
    
    for(int i=0;i<n;i++){
      if(G[pos][i]==-1)continue;
      if(cost+G[pos][i]<D[i]) {
	Q.push(P(cost+G[pos][i],i));
	D[i]=cost+G[pos][i];
	from[i]=pos;
      }
    }
  }

  if(from[g]==-1){cout<<"NA"<<endl;return;}
    
  vector<int> res;
  res.push_back(g);
  int pos=g;
  while(pos!=s){
    pos=from[pos];
    res.push_back(pos);
  }

  for(int i=0;i<res.size();i++){
    if(i) cout<<" ";
    cout<<res[res.size()-1-i]+1;
  }
  cout<<endl;
}



int main(){
  while(cin>>n,n){

  double x[101],y[101];
  for(int i=0;i<n;i++){
    int b;
    cin>>b;
    cin>>x[b-1]>>y[b-1];
  }
  
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++){
      ll X=(x[i]-x[j]);
      ll Y=(y[i]-y[j]);
      ll dis=X*X+Y*Y;
      if(dis>50*50)G[i][j]=-1;
      else G[i][j]=G[j][i]=dis;
    }
  
  
  int m;
  cin>>m;
  while(m--){
    int s,g;
    cin>>s>>g;
    dijkstra(s-1,g-1);
  }
  }
  return 0;
}