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 <vector>
#include <queue>
#include <math.h>

using namespace std;

const int MAX = 1000;

struct int2
{
	int x;
	int y;
};

class Node
{
public:
	int id;
	double cost;
	int parent;
	bool visited;
	vector<int> edge_to;
	vector<double> edge_cost;

	Node() {}
	Node(int id) : id(id), cost(-1.0), parent(-1), visited(false) {}
	
	bool operator < (const Node& n) const
	{
		return cost > n.cost;
	}
};

int n, m;
Node nodes[MAX];
int2 pos[MAX];
int sid, gid;

void solve()
{
	priority_queue<Node> q;
	nodes[sid].cost = 0.0;
	q.push(nodes[sid]);
	
	while(!q.empty())
	{
		Node nn = q.top();
		q.pop();
		
		if(nn.visited) continue;
		if(nn.id==gid) return;
		nn.visited = true;
		for(int i=0; i<nn.edge_to.size(); i++)
		{
			int to = nn.edge_to[i];
			double cost = nn.cost + nn.edge_cost[i];
			if(nodes[to].cost > cost || nodes[to].cost < 0.0)
			{
				if(nodes[to].visited) continue;
				nodes[to].cost = cost;
				nodes[to].parent = nn.id;
				q.push(nodes[to]);
			}
		}
	}
}

void reset()
{
	for(int i=0; i<n; i++)
	{
		nodes[i].cost = -1;
		nodes[i].parent = -1;
		nodes[i].visited = false;
	}
}

int main(int argc, char** argv)
{
	int b, x, y;
	while(cin >> n, n)
	{
		for(int i=0; i<n; i++)
		{
			cin >> b >> x >> y;
			int2 tmp = {x, y};
			pos[b-1] = tmp;
			nodes[i] = Node(i);
		}
		
		for(int i=1; i<n; i++)
		{
			for(int j=0; j<i; j++)
			{
				int dx = pos[i].x - pos[j].x;
				int dy = pos[i].y - pos[j].y;
				double dist =  sqrt((double)(dx*dx + dy*dy));
				if(dist <= 50.0)
				{
					nodes[i].edge_to.push_back(j);
					nodes[i].edge_cost.push_back(dist);
					nodes[j].edge_to.push_back(i);
					nodes[j].edge_cost.push_back(dist);
				}
			}
		}
		
		cin >> m;
		
		for(int k=0; k<m; k++)
		{
			if(k) reset();
			cin >> sid >> gid;
			sid = sid - 1;
			gid = gid - 1;
			
			solve();
		
			vector<int> way;
			way.push_back(gid);
			Node nn =nodes[gid];
			while(nn.parent != -1)
			{
				way.push_back(nn.parent);
				nn = nodes[nn.parent];
			}
		
			if(way.size() > 1)
			{
				for(int i=0; i<way.size(); i++)
				{
					if(i!=0) cout <<" ";
					cout << way[way.size() - i -1] + 1;
				}
			}
			else
			{
				cout << "NA";
			}
			cout << endl;
		}
	}
}

C++: #include <iostream>
#include <complex>
#include <vector>
#include <utility>
#define rep(i,k,n) for(int i=k;i<n;i++)
#define INF 100000
using namespace std;
typedef complex<double> point; 
void makeroad(vector< vector < pair<int,double> > > &road,point* mapl,int n){
  double tmp;
  rep(i,0,n)
    rep(j,i+1,n)
      if((tmp=abs(mapl[i]-mapl[j]))<=50){
	road[i].push_back(make_pair(j,tmp));

	road[j].push_back(make_pair(i,tmp));
      }
}
int* dijk(const int n, vector< vector< pair<int,double> >  >&list,int s,int g){
  int* keiro;
  int i,j,u;
  double minn;
  double *length;
  bool *check=new bool[n];
  length= new double[n];
  keiro=new int[n];
 
  for(i=0;i<n;i++){
    length[i]=INF;    check[i]=true; keiro[i]=n+1;}
  //rep(i,0,n)
    //cout<<keiro[i]<<'!'<<endl;
  length[s]=0.0;
  while(check[g]){
    minn=(double)INF;


  
    rep(j,0,n)
      if(check[j] && (minn>length[j]) ){
	u=j; minn=length[j];}
    //cout<<u<<"!?"<<endl;
    if(minn==INF) break;
    rep(i,0,list[u].size())
      if(list[u][i].second+length[u]<length[list[u][i].first]){
	length[list[u][i].first]=list[u][i].second+length[u];
	keiro[list[u][i].first]=u;
      }  
    check[u]=false;
  }
  
  return keiro;
}



int main(){
  int n,m,ts,tg,tt;
  int* ans;
  vector<int> anss;
  double ta,tb;
  cin>>n;
  while(n){

    point mapl[n]; 
    rep(i,0,n){
      cin>>tt>>ta>>tb;
      mapl[tt-1]=point(ta,tb);
    }
    //いったんビルの情報を取りましょう
    vector<vector<pair<int,double> > > road(n);//これが道になる
    makeroad(road,mapl,n);//makeroadはmaplでroadを作
    cin>>m;
    rep(i,0,m){
      cin>>ts>>tg;
      ans=dijk(n,road,ts-1,tg-1);   
      //      cout<<endl;
      if (ans[tg-1]>n) cout <<"NA"<<endl;
      else{
	tt=tg-1;
	anss.resize(n);
	int k=0;
	anss[k++]=tg-1;
	for(;ans[tt]!=ts-1;tt=ans[tt]){
	  anss[k++]=ans[tt];
	}
	anss[k++]=ts-1;
	
	rep(l,1,k)
	  cout<<anss[k-l]+1<<" ";
	cout<<tg<<endl;
      }

    }
   
    cin>>n;
  }
  return 0;
}