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) {}
};

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

void solve()
{
	queue<Node> q;
	nodes[sid].cost = 0.0;
	q.push(nodes[sid]);
	
	while(!q.empty())
	{
		Node nn = q.front();
		q.pop();
		
		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)
			{
				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++)
		{
			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 <vector>
#include <map>
#include <queue>
#include <cmath>
using namespace std;

const long long int INF = 1e9;

typedef pair<long long int,int> P;

int main(){
  int n;
  while(cin>>n,n){
    vector<pair<int,int> > building(n);
    for(int i=0;i<n;++i){
      int b,x,y;
      cin>>b>>x>>y;
      building[b-1] = make_pair(x,y);
    }
    vector<vector<int> > G(n);
    for(int i=0;i<n;++i) G[i] = vector<int>(n);
    for(int i=0;i<n;++i){
      for(int j=i;j<n;++j){
        int ax = building[i].first;
        int ay = building[i].second;
        int bx = building[j].first;
        int by = building[j].second;
        double dist = sqrt((ax-bx)*(ax-bx)+(ay-by)*(ay-by));
        G[i][j] = (dist<=50.0)?dist:INF;
        G[j][i] = (dist<=50.0)?dist:INF;
      }
    }
    int m;cin>>m;
    for(int i=0;i<m;++i){//Dijkstra(arihon)
      int s,g;cin>>s>>g;
      s--;g--;
      vector<int> prev(n);
      for(int i=0;i<n;++i)prev[i] = i;
      vector<long long int> d(n,INF);
      priority_queue<P, vector<P>, greater<P> > q;
      d[s]=0;q.push(P(0,s));
      while(!q.empty()){
        P p = q.top();q.pop();
        int v = p.second;
        if(d[v] < p.first) continue;
        for(int j=0;j<G[v].size();++j){
          if(p.first + G[v][j] < d[j]){
            d[j] = p.first + G[v][j];
            //cerr<<"#"<<v+1<<" "<<j+1<<" "<<d[j]<<endl;
            q.push(P(d[j],j));
            prev[j] = p.second;
          }
        }
      }
      int x = g;
      vector<int> w;
      while(x!=s&&x!=prev[x]){w.push_back(prev[x]);x=prev[x];}
      if(w.size()){
	      for(int j=w.size()-1;j>=0;--j)cout<<w[j]+1<<" ";
	      cout<<g+1<<endl;
      }else{
      	cout<<"NA"<<endl;
      }
    }
    
  }
  return 0;
}