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 <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include<iostream>
using namespace std;

struct Point{
	double x,y;
};

int main(){

	int n,m,checkTable[101],path[101],id,start,goal,count,min_index;
	double distance[101][101],x,y,calc[101][101],min_value;
	bool canGO[101];
	Point table[101];
	stack<int> S;

	while(true){
		scanf("%d",&n);
		if(n == 0)break;

		for(int i=1; i <= n; i++){
			scanf("%d %lf %lf",&id,&x,&y);
			table[id].x = x;
			table[id].y = y;
		}

		for(int i = 1; i <= n; i++){
			for(int k = 1; k <= n; k++){
				distance[i][k] = sqrt((table[i].x-table[k].x)*(table[i].x-table[k].x)+(table[i].y-table[k].y)*(table[i].y-table[k].y));
			}
		}

		scanf("%d",&m);

		for(int i = 1; i <= m; i++){
			scanf("%d %d",&start,&goal);

			for(int k = 1; k <= n; k++){
				checkTable[k] = 0;
				if(distance[start][k] < 50 || fabs(distance[start][k] - 50) < 0.00000001){
					canGO[k] = true;
				}else{
					canGO[k] = false;
				}
				path[k] = start;
				for(int p = 1; p <= n; p++)calc[k][p] = distance[k][p];
			}

			count = 1;
			checkTable[start] = 1;

			while(count < n){
				min_value = 1000000000;

				for(int k = 1; k <= n; k++){
					if(checkTable[k] == 0 && canGO[k] == true && calc[start][k] < min_value){
						min_value = calc[start][k];
						min_index = k;
					}
				}

				if(min_value == 1000000000)break;

				checkTable[min_index] = 1;
				count++;

				for(int p = 1; p <= n; p++){
					if((canGO[p] == false || calc[start][p] > calc[start][min_index]+calc[min_index][p]) && (distance[min_index][p] < 50 || fabs(distance[min_index][p] - 50) < 0.00000001)){
						calc[start][p] = calc[start][min_index]+calc[min_index][p];
						canGO[p] = true;
						path[p] = min_index;
					}
				}
			}

			if(canGO[goal] == false)cout<<"NA"<<endl;
			else{
				int t = goal;
				while(true){
					S.push(t);
					t = path[t];
					if(t == start)break;
				}
                cout<<start;
				while(!S.empty()){
                    cout<<" "<<S.top();
					S.pop();
				}
				cout<<endl;
			}
		}
	}


	return 0;
}

C++: # define _CRT_SECURE_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <forward_list>
# include <map>
# include <stack>
using namespace std;
# define INF ((int)(1<<25))
# define REP(i,n) for(int i=0;i<(int)n;i++)
# define FOR(i,n) REP(i,n)
# define TORAD 2.0*M_PI/360.0
# define INT(x) int x;cin>>x;
# define ALL(x) (x).begin(),(x).end()
# define RALL(x) (x).rbegin(),(x).rend()
# define DEBUG(x) cout<<#x<<" :"<<x<<endl;
# define EPS 1e-12
template<class T> void debug(T a) { for (auto i : a)cout << i << endl; }
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,1,0,-1 }, dy[4] = { -1,0,1,0 };



int main()
{
	int n;
	while (cin >> n&&n)
	{
		vector<piii> a;
		vector<double> d[1001];
		FOR(i, n)
		{
			piii x; cin >> x.first >> x.second.first >> x.second.second;
			a.push_back(x);
		}
		FOR(i, n)
		{
			FOR(j, n)
			{
				pii x = a[i].second;
				pii y = a[j].second;
				d[i].push_back(sqrt((x.first - y.first)*(x.first - y.first) + (x.second - y.second)*(x.second - y.second)));
			}
		}
		INT(m);
		while (m--)
		{
			typedef pair<double, vi> P;
			INT(start); INT(goal);
			priority_queue< P,vector<P>,greater<P> > que;
			double memo[1001];
			fill(begin(memo), end(memo), 9999999999999.0);
			memo[0] = 0;
			int f;
			for (int i = 0; i < n; i++)if (a[i].first == start)f = i;
			que.push(P(f, {f}));
			bool ok = false;
			while (!que.empty())
			{
				P now = que.top(); que.pop();
				int p = now.second.back();
				double k = now.first;
				if(a[p].first==goal)
				{
					ok = true;
					for (int i = 0; i < now.second.size();i++)
					{
						if (i)cout << " ";
						cout << a[now.second[i]].first;
					}
					break;
				}
				for (int i = 0; i < n; i++)
				{
					if (i == p||d[p][i]>50.0)continue;
					if (memo[i] > k + d[p][i])
					{
						memo[i] = k + d[p][i];
						P next = now;
						next.first += d[p][i];
						next.second.push_back(i);
						que.push(next);
					}
				}
			}
			if (!ok)cout << "NA";
			cout << endl;
		}
	}
}