Go: package main

import (
	"container/heap"
	"fmt"
	"runtime"
)

type Node struct {
	NowPosition          int
	DiscountTicketTCount int
	Amount               int
}

type PriorityQueueNode []*Node

func (pq PriorityQueueNode) Len() int {
	return len(pq)
}

func (pq PriorityQueueNode) Less(i, j int) bool {
	return pq[i].Amount < pq[j].Amount
}

func (pq PriorityQueueNode) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueueNode) Push(node interface{}) {
	*pq = append(*pq, node.(*Node))
}

func (pq *PriorityQueueNode) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	*pq = old[0 : n-1]
	return item
}

type Point struct {
	NextPoint int
	Fee       int
}

type Memo struct {
	NowPoint             int
	DiscountTicketTCount int
}

func main() {
	var c, n, m, s, d int
	var a, b, f int

	for {
		fmt.Scan(&c, &n, &m, &s, &d)
		if c == 0 && n == 0 && m == 0 && s == 0 && d == 0 {
			break
		}
		s--
		d--
		pointMap := make([][]Point, n)
		for i := 0; i < n; i++ {
			pointMap[i] = make([]Point, 0, n)
		}
		for i := 0; i < m; i++ {
			fmt.Scan(&a, &b, &f)
			a--
			b--
			pointMap[a] = append(pointMap[a], Point{NextPoint: b, Fee: f})
			pointMap[b] = append(pointMap[b], Point{NextPoint: a, Fee: f})
		}
		pq := make(PriorityQueueNode, 0, m)
		start := Node{NowPosition: s, DiscountTicketTCount: c, Amount: 0}
		heap.Push(&pq, &start)
		memo := make(map[Memo]int)
		for len(pq) != 0 {
			now := heap.Pop(&pq).(*Node)
			if now.NowPosition == d {
				fmt.Println(now.Amount)
				break
			}
			memo[Memo{NowPoint: now.NowPosition, DiscountTicketTCount: now.DiscountTicketTCount}] = now.Amount
			for _, v := range pointMap[now.NowPosition] {
				next := &Node{v.NextPoint, now.DiscountTicketTCount, now.Amount + v.Fee}
				if memoAmount, ok := memo[Memo{NowPoint: v.NextPoint, DiscountTicketTCount: now.DiscountTicketTCount}]; !ok || (ok && memoAmount > next.Amount) {
					memo[Memo{NowPoint: v.NextPoint, DiscountTicketTCount: now.DiscountTicketTCount}] = next.Amount
					heap.Push(&pq, next)
				}
				if now.DiscountTicketTCount > 0 {
					next = &Node{v.NextPoint, now.DiscountTicketTCount - 1, now.Amount + v.Fee/2}
					if memoAmount, ok := memo[Memo{NowPoint: v.NextPoint, DiscountTicketTCount: now.DiscountTicketTCount}]; !ok || (ok && memoAmount > next.Amount) {
						memo[Memo{NowPoint: v.NextPoint, DiscountTicketTCount: now.DiscountTicketTCount}] = next.Amount
						heap.Push(&pq, next)
					}
				}
			}
		}
		runtime.GC()
	}
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;

using namespace std;

int minimum,num_ticket,num_town,m,start,goal,costTable[101][101];


struct Info{
    Info(){
        for(int i = 1; i <= num_town; i++){
            visited[i] = false;
        }
        current_town = 0;
        index = 0;
    }
    bool visited[102];
    int current_town,index,costs[102];

};

void func(Info info){

    int sum = 0;

    for(int i = 0; i < info.index;i++){
        if(i < num_ticket){
            sum += info.costs[i]/2;
        }else{
            sum += info.costs[i];
        }
    }

    if(info.current_town == goal){
        minimum = min(minimum,sum);
        return;
    }else{
        if(sum >= minimum){
            return;
        }
    }
    int calc;
    for(int i = 1; i <= num_town; i++){
        if(costTable[info.current_town][i] != -1 && info.visited[i] == false){
            Info new_info;
            for(int k = 1; k <= num_town; k++)new_info.visited[k] = info.visited[k];
            new_info.visited[i] = true;
            new_info.current_town = i;

            if(costTable[info.current_town][i] > info.costs[0]){
            	new_info.costs[0] = costTable[info.current_town][i];
            	for(int k = 1; k <= info.index; k++){
            		new_info.costs[k] = info.costs[k-1];
            	}
            }else if(costTable[info.current_town][i] <= info.costs[info.index-1]){
            	for(int k = 0; k < info.index; k++){
            		new_info.costs[k] = info.costs[k];
            	}
            	new_info.costs[info.index] = costTable[info.current_town][i];
            }else{
            	for(calc = 0; info.costs[calc] >= costTable[info.current_town][i];calc++)new_info.costs[calc] = info.costs[calc];
				new_info.costs[calc] = costTable[info.current_town][i];
				calc++;
				for(;calc-1 < info.index;calc++)new_info.costs[calc] = info.costs[calc-1];
            }
            new_info.index = info.index+1;
            func(new_info);

        }
    }
}

int main(){

    int from,to,fee;

    while(true){
        scanf("%d %d %d %d %d",&num_ticket,&num_town,&m,&start,&goal);
        if(num_ticket == 0 && num_town == 0 && m == 0 && start == 0 && goal == 0)break;

        minimum = 2000000000;

        for(int i = 1; i <= num_town; i++){
            for(int k = 1; k <= num_town; k++)costTable[i][k] = -1;
        }

        for(int i = 0; i < m; i++){
            scanf("%d %d %d",&from,&to,&fee);
            costTable[from][to] = fee;
            costTable[to][from] = fee;
        }

        Info info;

        info.current_town = start;
        info.visited[start] = true;

        func(info);

        printf("%d\n",minimum);
    }


    return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;

struct Edge{int to,from,cost;};

#ifdef DEBUGLOCAL
#define debug cout
#else
stringstream __ss__;
#define debug __ss__
#endif

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) debug << *i << " "; debug << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

#define rep(i,n) for(int i=0;i<(n);++i)
#define repd(i,n) for(int i=(n)-1;i>=0;i--)
#define repn(i,m,n) for(int i=(m);i<=(n);++i)
#define repnd(i,m,n) for(int i=(n)-1;i>=(m);i--)
#define rep0(i,n) for(i=0;i<(n);++i)
#define all(n) n.begin(),n.end()
#define sz(n) ((int)(n).size())
#define IL for(;;)
#define MP make_pair
#define PB push_back
#define SS stringstream
#define X second
#define Y first
#define PUTLINE debug<<"LINE:"<<__LINE__<<endl;

const int INF = 2147483647/3;
const double EPS = 1e-10;
const double PI = acos(-1.0);

const int dx[]={1,-1,0,0,1,-1,1,-1,0};
const int dy[]={0,0,1,-1,1,-1,-1,1,0};

int c,n,m,s,d;
int edge[111][111];
int cost[11][111];

int main() {
	IL{
		cin>>c>>n>>m>>s>>d;
		--s,--d;
		if(c==0)break;
		int fr,to,co;
		rep(i,111)rep(j,111)edge[i][j]=INF;
		rep(i,m){
			cin>>fr>>to>>co;
			--fr,--to;
			chmin(edge[fr][to],co);
			chmin(edge[to][fr],co);
		}
		rep(i,11)rep(j,111)cost[i][j]=INF;
		priority_queue<pair<int,pint> > que;
		que.push(MP(0,MP(0,s)));
		while(!que.empty()){
			pair<int,pint> p;
			p=que.top();
debug<<p.first<<" "<<p.second.first<<" "<<p.second.second<<endl;
			que.pop();
			if(cost[p.second.first][p.second.second]!=0&&cost[p.second.first][p.second.second]<=p.first)continue;
			if(p.second.first>c)continue;
			cost[p.second.first][p.second.second]=p.first;
			rep(i,n){
				if(edge[p.second.second][i]==INF)continue;
				pair<int,pint> next=p;
				next.first+=edge[p.second.second][i]/2;
				++next.second.first;
				next.second.second=i;
				que.push(next);
				next.first+=edge[p.second.second][i]/2;
				--next.second.first;
				que.push(next);
			}
		}
		int res=INF;
		repn(i,0,n){
			chmin(res,cost[i][d]);
		}
		cout<<res<<endl;
	}
	return 0;
}