Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

var pass [][]int

func main() {
	for scanner.Scan() {
		pass = make([][]int, 200)
		for i := range pass {
			pass[i] = make([]int, 200)
		}
		buf := strings.Split(scanner.Text(), " ")
		c, _ := strconv.Atoi(buf[0])
		n, _ := strconv.Atoi(buf[1])
		m, _ := strconv.Atoi(buf[2])
		s, _ := strconv.Atoi(buf[3])
		d, _ := strconv.Atoi(buf[4])
		if c == 0 && n == 0 && m == 0 && s == 0 && d == 0 {
			break
		}
		s--
		d--
		for i := 0; i < 200; i++ {
			for j := 0; j < 200; j++ {
				pass[i][j] = INF
			}
		}
		for i := 0; i < 200; i++ {
			pass[i][i] = 0
		}
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			f, _ := strconv.Atoi(buf_[2])
			a--
			b--
			pass[a][b] = f
			pass[b][a] = f
		}
		fmt.Println(dijkstra(s, d, c, n))
	}
}

func dijkstra(s, g, c, n int) float64 {
	d := make([][]float64, 200)
	used := make([][]bool, 200)
	for i := 0; i < 200; i++ {
		d[i] = make([]float64, 20)
		used[i] = make([]bool, 20)
	}
	for i := range d {
		for j := range d[i] {
			d[i][j] = INF
		}
	}
	d[s][c] = 0
	for {
		v := -1
		w := -1
		for u := 0; u < n; u++ {
			for i := 0; i < c+1; i++ {
				if !used[u][i] && (v == -1 || d[u][i] < d[v][w]) {
					v = u
					w = i
				}
			}
		}
		if v == -1 {
			break
		}
		used[v][w] = true
		for u := 0; u < n; u++ {
			d[u][w] = math.Min(d[u][w], d[v][w]+float64(pass[v][u]))
			if w-1 >= 0 && pass[v][u] != INF {
				d[u][w-1] = math.Min(d[u][w-1], d[v][w]+(float64(pass[v][u]/2.0)))
			}
		}
	}
	ret := float64(INF)
	for i := 0; i < c+1; i++ {
		ret = math.Min(ret, d[g][i])
	}
	return ret
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };
int c, n, m, s, d, ans;
vector<vector<PII> > v;
int dp[ 11 ][ 100 ];

int solve( int canUseT, int now ) {
	if ( now == d ) {
		return 0;
	}
	if ( dp[ canUseT ][ now ] >= 0 ) {
		return dp[ canUseT ][ now ];
	}
	dp[ canUseT ][ now ] = INF;
	int res = INF;
	for ( int i = 0; i < v[now].size(); i++ ) {
		if ( canUseT ) {
			res = min( res, solve( canUseT - 1, v[ now ][ i ].first ) + v[ now ][ i ].second / 2 );
		}
		res = min( res, solve( canUseT, v[ now ][ i ].first ) + v[ now ][ i ].second );
	}
	return dp[ canUseT ][ now ] = res;
}

int main() {
	while ( ~scanf( "%d %d %d %d %d", &c, &n, &m, &s, &d ) && c && n && m && s && d ) {
		s--;
		d--;
		v.resize( n );
		NCLR( dp );
		for ( int i = 0; i < m; i++ ) {
			int a, b, f;
			scanf( "%d %d %d", &a, &b, &f );
			v[ a - 1 ].push_back( MP( b - 1, f ) );
			v[ b - 1 ].push_back( MP( a - 1, f ) );
		}
		ans = solve( c, s );
		printf( "%d\n", ans );
		v.clear();
	}
	return 0;
}

C++: #include <iostream>
#include <list>
#include <queue>
using namespace std;

#define INF 100000000

struct Edge {
    int dst, fare;
    Edge(int d, int f) {
        dst = d;
        fare = f;
    }
};

struct Town {
    list<Edge*> edge;
};

struct Vertex {
    int c, tid, cost;
    Vertex (int ticket_count, int town_id, int icost) {
        c = ticket_count;
        tid = town_id;
        cost = icost;
    }
    void dump() {
        cout << "[" << c << "]" << " " << tid << "(" << cost << ")" << endl;
    }
};

bool operator<(const Vertex &a, const Vertex &b) {
    return a.cost > b.cost;
}

int main() {
    int c, n, m, s, d, a, b, f, i, j;
    while (cin >> c >> n >> m >> s >> d, c) {
        Town town[n+1];
        int cost[c+1][n+1];
        for (i = 0; i < m; i++) {
            cin >> a >> b >> f;
            town[a].edge.push_back(new Edge(b, f));
            town[b].edge.push_back(new Edge(a, f));
        }
        for (i = 0; i <= c; i++) {
            for (j = 1; j <= n; j++) {
                cost[i][j] = INF;
            }
        }
        priority_queue<Vertex*> q;
        cost[0][s] = 0;
        Vertex *v = new Vertex(0, s, 0);
        q.push(v);
        while (!q.empty()) {
            v = q.top(); q.pop();
            if (v->tid == d) {
                if (v->c == c) {
                    delete v;
                    break;
                }
                delete v;
                continue;
            }
            list<Edge*> e = town[v->tid].edge;
            for (list<Edge*>::iterator itr = e.begin();
                 itr != e.end(); itr++) {
                int ncost = v->cost + (*itr)->fare;
                int dst = (*itr)->dst;
                if (ncost < cost[v->c][dst]) {
                    cost[v->c][dst] = ncost;
                    q.push(new Vertex(v->c, dst, ncost));
                }
                if (v->c < c) {
                    ncost = v->cost + (*itr)->fare / 2;
                    if (ncost < cost[v->c+1][dst]) {
                        cost[v->c+1][dst] = ncost;
                        q.push(new Vertex(v->c+1, dst, ncost));
                    }
                }
            }
            delete v;
        }
        int min_cost = INF;
        for (i = 0; i <= c; i++) {
            if (cost[i][d] < min_cost) min_cost = cost[i][d];
        }
        cout << min_cost << endl;
    }
    return 0;
}