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 <algorithm>
#include <cstring>
#include <complex>
#include <map>

using namespace std;

const int MAX_V = 1001;
// d[u][v]Íu©çvÖÌRXgBßÉ×Ú·éGbWÌRXgðüêÄ¨¢½è·êÎæ¢Í¸B
double d[MAX_V][MAX_V];
const int INF=1000000000;
// ¸_
int V;

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b))<EPS)

// prv[i][j] -> iªX^[gn_ÌÆ«Aj©çÇ±Éßé©
int prv[MAX_V][MAX_V];

// S_ÎÅZoHâèðÆ­O(V^3)AÓª ÁÄà®ì
void warshall_floyd(){
    for(int i = 0; i < V; i++){
        for(int j = 0; j < V; j++){
            for(int k = 0; k < V; k++){
                //d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
                if(d[j][k]>d[j][i]+d[i][k]){
                    int cp=k;
                    // XV
                    while(1){
                        prv[j][cp]=prv[i][cp];
                        cp=prv[i][cp];
                        if(cp==i)break;
                    }
                    d[j][k]=d[j][i]+d[i][k];
                }
            }
        }
    }
}
typedef complex<double> P;

void init(int n){
    V=n;
    for(int i = 0; i < MAX_V; i++){
        for(int j = 0; j < MAX_V; j++){
            if(i==j)d[i][j]=0;
            else d[i][j]=INF;
            prv[i][j]=INF;
        }
    }
}

int main(){
    int n;
    while(cin>>n&&n!=0){
        int idx=0;
        map<int,int> idxs;
        init(n);
        int billNum[MAX_V];
        P billP[MAX_V];
        for(int i=0;i<n;i++){
            int x,y;
            cin>>billNum[i]>>x>>y;
            billP[i]=P(x,y);
            billNum[i]--;
            if(idxs.find(billNum[i])==idxs.end())
                idxs[billNum[i]]=idx++;
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                double dist=abs(billP[idxs[billNum[i]]]-billP[idxs[billNum[j]]]);
                // £ª50ÈºÈç¹ðìéÆ¯ÉAßèûðüêÄ¨­
                if(dist<50||EQ(dist,50)){
                    d[idxs[billNum[i]]][idxs[billNum[j]]]=dist;
                    prv[idxs[billNum[i]]][idxs[billNum[j]]]=idxs[billNum[i]];
                }
            }
        }
        warshall_floyd();
        int m;
        cin>>m;
        for(int i=0;i<m;i++){
            int s,g;
            cin>>s>>g;
            s--;g--;
            if(EQ(d[s][g],INF))
                cout<<"NA"<<endl;
            else{
                vector<int> v;
                int cp=g;
                while(1){
                    v.push_back(cp+1);
                    if(cp==s)
                        break;
                    cp=prv[s][cp];
                }
                for(int j = v.size()-1; j >= 0; j--){
                    cout<<v[j];
                    if(j==0)cout<<endl;
                    else cout<<" ";
                }
            }
        }
    }

  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)
#define int long long

const int inf = 1 << 25;
const ll INF = 1LL << 55;

struct edge
{
  int to, cost;
  edge(){}
  edge(int to, int cost):to(to), cost(cost){}
};

int n;
vector< vector<edge> > graph;

void dijkstra(int s, int g)
{
  vector<int> min_cost(n, INF);
  vector<int> prevv(n, -1);
  priority_queue<Pl, vector<Pl>, greater<Pl> > que;
  que.push(Pl(0LL, s));
  min_cost[s] = 0LL;
  while(!que.empty()) {
    Pl p = que.top(); que.pop();
    if(p.S == g) break;
    if(min_cost[p.S] < p.F) continue;
    for(edge e : graph[p.S]) {
      if(e.cost + p.F < min_cost[e.to]) {
	min_cost[e.to] = e.cost + p.F;
	//cout << " " << p.S << " " << e.to << " " << e.cost << endl;
	prevv[e.to] = p.S;
	que.push(Pl(min_cost[e.to], e.to));
      }
    }
  }
  if(min_cost[g] == INF) {
    puts("NA");
    return;
  }
  cout << min_cost[g] << endl;
  vector<int> ans;
  for(int v = g; v != -1; v = prevv[v]) {
    ans.push_back(v+1);
  }
  reverse(all(ans));
  for(int i = 0; i < ans.size(); i++) {
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
}

int dist(Pl a, Pl b)
{
  return ((a.F-b.F)*(a.F-b.F) + (a.S-b.S)*(a.S-b.S));
}

signed main()
{
  while(cin >> n, n) {
    vector<Pl> pos(n);
    for(int i = 0; i < graph.size(); i++) graph[i].clear();
    graph.clear(); graph.resize(n);
    for(int i = 0; i < n; i++) {
      int b; cin >> b; b--;
      cin >> pos[b].F >> pos[b].S;
    }
    for(int i = 0; i < n; i++) {
      for(int j = i+1; j < n; j++) {
	if(dist(pos[i], pos[j]) <= 50LL*50LL) {
	  cout << i+1 << " " << j+1 << " "<< pos[i].F << " " << pos[i].S << " " << pos[j].F << " "<< pos[j].S << " " << dist(pos[i], pos[j]) << endl;
	  graph[i].push_back(edge(j, 1));//dist(pos[i], pos[j])));
	  graph[j].push_back(edge(i, 1));//dist(pos[i], pos[j])));	  
	}
      }
    }
    int m; cin >> m;
    while(m--) {
      int s, g; cin >> s >> g;
      s--, g--;
      dijkstra(s, g);
    }
  }
  return 0;
}