Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			t_matrix[a-1][b-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0{
					c_dist[i][j] = INF
				} else {
					c_dist[i][j] = c_matrix[i][j]
				}
				if c_matrix[i][j] == 0{
					c_prev[i][j] = -1
				} else {
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0{
					t_dist[i][j] = INF
				} else {
					t_dist[i][j] = t_matrix[i][j]
				}
				if t_matrix[i][j] == 0{
					t_prev[i][j] = -1
				} else {
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}
				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0: fmt.Println(c_dist[p-1][q-1])
			case 1: fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: #include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <utility>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#define rep(i, a, n) for(int (i) = (int)(a);(i) < (int)(n);++(i))
#define repe(i, a, n) for(int (i) = (int)(a);(i) <= (int)(n);++(i))
#define repr(i, a, n) for(int (i) = (int)(a);(i) > (int)(n);--(i))
#define reper(i, a, n) for(int (i) = (int)(a);(i) >= (int)(n);--(i))
#define SIZE(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define RNG(x, n) &((x)[0]), &((x)[n])
#define SUBIF(a, b, x) ((x) ? (b) : (a))
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define pb push_back
#define EPS (1e-20)
#define INF 2147483647LL
#define MOD 1000000007LL
using llint = long long;
using VI = std::vector<int>;
using PII = std::pair<int, int>;
using SI = std::set<int>;
using MII = std::map<int, int>;
using TIII = std::tuple<int, int, int>;
using namespace std;


int n, m;
llint gc[110][110];
llint gt[110][110];


void warshallFloyd(){
	rep(k, 0, m)
		rep(i, 0, m)
			rep(j, 0, m)
				gc[i][j] = min(gc[i][j], gc[i][k]+gc[k][j]), gt[i][j] = min(gt[i][j], gt[i][k]+gt[k][j]);
}


int main(){
	while(cin >> n >> m, n || m){
		rep(i, 0, m){
			rep(j, 0, m){
				if(i != j) gc[i][j] = gt[i][j] = INF;
			}
		}
		rep(i, 0, n){
			int a, b, c, t;
			cin >> a >> b >> c >> t;
			a--, b--;
			gc[a][b] = gc[b][a] = c;
			gt[a][b] = gt[b][a] = t;
		}
		warshallFloyd();
		int k;
		cin >> k;
		rep(i, 0, k){
			int p, q, r;
			cin >> p >> q >> r;
			p--, q--;
			if(!r) cout << gc[p][q] << endl;
			else cout << gt[p][q] << endl;
		}
	}

	return 0;
}

C++: // 2014/06/16 Tazoe

#include <iostream>
using namespace std;

const int INF = 1000000000;

int main()
{
	while(true){
		int n, m;
		cin >> n >> m;

		if(n==0 && m==0)
			break;

		int C[100][100];
		int T[100][100];
		for(int i=0; i<m; i++){
			for(int j=0; j<m; j++){
				if(i==j){
					C[i][j] = T[i][j] = 0;
				}
				else{
					C[i][j] = T[i][j] = INF;
				}
			}
		}

		for(int i=0; i<n; i++){
			int a, b, c, t;
			cin >> a >> b >> c >> t;

			C[a-1][b-1] = C[b-1][a-1] = c;
			T[a-1][b-1] = T[b-1][a-1] = t;
		}
    for(int k=0;k<m;k++){
      for(int i=0;i<m;i++){
        for(int j=0;j<m;j++){
          if(C[i][j] > C[i][k]+C[k][j])
            C[i][j] = C[i][k] + C[k][j];
          if(T[i][j] > T[i][k]+T[k][j])
            T[i][j] = T[i][k] + T[k][j];
        }
      }
    }
    unsigned int k;
    cin >> k;
    for(int i=0;i<k;i++){
      int p,q,r;
      cin >> p >> q;
      if(k == 0  &&  q == 0)
        return 0;
      cin >> r;

      if(r==0){
        cout << C[p-1][q-1] << endl;
      } else {
        cout << T[p-1][q-1] << endl;
      }
    }
    break;
	}

	return 0;
}

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

const int size = 101;
int G1[size][size]; // time
int G2[size][size]; // money

int main() {
  int n, m;
  while ( cin >> n >> m && n && m ) {
    for ( int i = 0; i < size; i++ ) {
      for ( int j = 0; j < size; j++ ) {
	G1[i][j] = -1;
	G2[i][j] = -1;
      }
    }
    for ( int i = 0; i < n; i++ ) {
      int a, b;
      cin >> a >> b;
      int t, c;
      cin >> c >> t;
      G1[a][b] = G1[b][a] = t;
      G2[a][b] = G2[b][a] = c;
    }
    for ( int k = 1; k <= m; k++ ) {
      for ( int i = 1; i <= m; i++ ) {
	for ( int j = 1; j <= m; j++ ) {
	  if ( G1[i][k] == -1 || G1[k][j] == -1 ) continue;
	  if ( G1[i][j] == -1 ) G1[i][j] = G1[i][k] + G1[k][j];
	  G1[i][j] = min( G1[i][j], G1[i][k] + G1[k][j] );
	}
      }
    }
    for ( int k = 1; k <= m; k++ ) {
      for ( int i = 1; i <= m; i++ ) {
	for ( int j = 1; j <= m; j++ ) {
	  if ( G2[i][k] == -1 || G2[k][j] == -1 ) continue;
	  if ( G2[i][j] == -1 ) G2[i][j] = G2[i][k] + G2[k][j];
	  G2[i][j] = min( G2[i][j], G2[i][k] + G2[k][j] );
	}
      }
    }
    {
      int k;
      cin >> k;
      for ( int i = 0; i < k; i++ ) {
	int p, q, r;
	cin >> p >> q >> r;
	cout << ( r ? G1[p][q] : G2[p][q] ) << endl; 
      }
    }
  }
  return 0;
}

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

#define REP(i,p,n) for(int i=p;i<n;++i)
#define rep(i,n) REP(i,0,n)

typedef pair<int,int> pii;
const int INF=1e9, MAXM=128;
int C[2][MAXM][MAXM], dist[MAXM], visited[MAXM], N, M;

void dk(int p,int q,int r)
{
        dist[p]=0;

        while(true)
        {
                int from=-1,c=INF;
                rep(i,M) if(!visited[i]&&dist[i]<=c){ c=dist[i]; from=i; }
                if(from==q){ cout<<dist[from]<<endl; return; } else { visited[from]=true; }

                rep(to,M) if(dist[from]+C[r][from][to]<dist[to]){ dist[to]=dist[from]+C[r][from][to]; }
        }
}

int main()
{
        int a,b,c,d;
        cin>>N>>M;
        rep(i,M) rep(j,N) C[0][i][j]=C[1][i][j]=(i==j?0:INF);
        rep(i,N){ cin>>a>>b>>c>>d; --a; --b; C[0][a][b]=C[0][b][a]=c; C[1][a][b]=C[1][b][a]=d; }

        cin>>d;
        rep(i,d){ fill(dist,dist+M,INF); fill(visited,visited+M,false); cin>>a>>b>>c; dk(a-1,b-1,c); }
        return 0;
}