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 <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)

#define MAX 1010

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

int n;
double cost[MAX][MAX];
int num[MAX];
vector<pair<int, int> > vv;

int prev[MAX];
double d[MAX];
bool used[MAX];
int V;

void dijkstra(int s){
    fill(d, d+V, inf);
    fill(used, used+V, false);
    fill(prev, prev+V, -1);
    d[s] = 0;

    while(true){
        int v = -1;
        for(int u=0; u < V; u++){
            if(!used[u] && (v==-1 || d[u] < d[v])) v = u;
        }

        if(v == -1)break;
        used[v] = true;

        for(int u=0; u < V; u++){
            if(d[u] > d[v] + cost[v][u]){
                d[u] = d[v] + cost[v][u];
                prev[u] = v;
            }
        }
    }
}

vector<int> get_path(int t){
    vector<int> path;
    for(; t != -1; t = prev[t]) path.push_back(t);
    reverse(path.begin(), path.end());
    return path;
}

int main(){
    while(cin >> n, n){
        V = n;
        vv.clear();
        rep(i, n){
            int b, x, y;
            cin >> b >> x >> y;
            num[i] = b; vv.push_back(make_pair(x, y));
        }
        rep(i, n)rep(j, n){
            if(i == j) {cost[i][j] = inf; continue;}
            double d = abs(sqrt(pow(vv[i].first-vv[j].first, 2)+pow(vv[i].second-vv[j].second, 2)));
            if(d-eps <= 50.0){/*cout << i << " " << j << " " << d << endl;*/ cost[i][j] = d;}
            else cost[i][j] = inf;
        }
        int m;
        cin >> m;
        rep(i, m){
            int s, g;
            cin >> s >> g; s--; g--;
            dijkstra(s);
            vector<int> p = get_path(g);

            if(s == g) cout << s << endl;
            if(p.size() == 1) cout << "NA" << endl;
            else {
                rep(j, p.size()) cout << (j==0?"":" ") << num[p[j]];
                cout << endl;
            }
        }
    }
}

C++: 

#include<iostream>

#include<vector>

#include<algorithm>

#include <math.h>

#include<cstdio>

using namespace std;



static const int MAX = 100;

#define INF 2000000000000ll

int V, E;

double dp[MAX][MAX];

long long prev_[MAX][MAX];

int stack[MAX], sp;



void Warshall_Floyd() {

	for (int k = 0; k < V; k++) {

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (dp[i][k] == INF || dp[k][j] == INF) {

					continue;

				}
                if(dp[i][j]>dp[i][k]+dp[k][j]+0.0000001){
                    
				    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
                
				    prev_[i][j] = prev_[k][j];
                }

			}

		}

	}

}

void printPath2(int start, int goal) {

	int cur;



	sp = 0;

	for (cur = goal; cur != start; cur = prev_[start][cur]){

		stack[sp++] = cur;
        cout<<cur<<endl;
        }
	stack[sp++] = start;



	while (sp--)

		printf("%d%c", stack[sp]+1, " \n"[!sp]);

}





int main() {

	while

		(cin >> V, V != 0) {

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (i == j) {

					dp[i][j] = 0;

				}

				else {

					dp[i][j] = INF;

				}

			}

		}

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				prev_[i][j] = i;

			}

		}

		vector<vector<int>>v(V, vector<int>(3));

		for (int i = 0; i < V; i++) {

			int a, b, c;

			cin >> a >> b >> c;

			v[i][0] = a-1;

			v[i][1] = b;

			v[i][2] = c;

			

		}

		for (int i = 0; i < V; i++) {

			for (int j = 0; j < V; j++) {

				if (hypot(v[i][1] - v[j][1], v[i][2] - v[j][2]) <= 50.0) {

					dp[v[i][0]][v[j][0]] = hypot(v[i][1] - v[j][1], v[i][2] - v[j][2]);

				}

				else {

					continue;

				}

			}

		}

		Warshall_Floyd();

		int q;//クエリの数

		cin >> q;

		for (int i = 0; i < q; i++) {

			int s, g;

			cin >> s >> g;
        cout<<"get"<<endl;
			s--;

			g--;

			

			if (dp[s][g] == INF) {

				cout << "NA" << endl;

			}

			else {

				printPath2(s, g);

			}

			

		}



	}

	return 0;

}

C++: #include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;

const int INF = 1 << 30;

int main()
{
  int n;
  while (cin >> n) {
    if (n == 0)
      break;

    vector<int> b(n), x(n), y(n);
    for (int i = 0; i < n; ++i)
      cin >> b[i] >> x[i] >> y[i];

    vector<vector<pair<int, double> > > cost(1001);
    for (int i = 0; i < n; ++i) {
      for (int j = i+1; j < n; ++j) {
	int dist = (x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j]);
	if (dist <= 50*50) {
	  cost[b[i]].push_back(make_pair(b[j], sqrt(dist)));
	  cost[b[j]].push_back(make_pair(b[i], sqrt(dist)));
	}
      }
    }

    int m;
    cin >> m;
    for (int i = 0; i < m; ++i) {
      int s, g;
      cin >> s >> g;

      bool valid = false;
      priority_queue<pair<double, int>, vector<pair<double, int> >, greater<pair<double, int> > > que;
      que.push(make_pair(0, s));
      vector<double> dp(1001, 1e10);
      vector<int> path(1001, -1);
      while (!que.empty()) {
	const pair<double, int> v = que.top();
	que.pop();

	if (v.second == g) {
	  valid = true;
	  break;
	}

	if (dp[v.second] < v.first)
	  continue;

	dp[v.second] = v.first;
	for (unsigned int j = 0; j < cost[v.second].size(); ++j) {
	  double next = v.first + cost[v.second][j].second;
	  if (dp[cost[v.second][j].first] > next) {
	    dp[cost[v.second][j].first] = next;
	    que.push(make_pair(next, cost[v.second][j].first));
	    path[cost[v.second][j].first] = v.second;
	  }
	}
      }

      if (valid) {
	vector<int> ans;
	for (int j = g; j != -1; j = path[j])
	  ans.push_back(j);
	reverse(ans.begin(), ans.end());
	for (int j = 0; j < ans.size()-1; ++j)
	  cout << ans[j] << " ";
	cout << ans.back() << endl;
      } else {
	cout << "NA" << endl;
      }
    }

  }
  return 0;
}