Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 2000000000

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
					c_prev[i][j] = -1
				} else {
					c_dist[i][j] = c_matrix[i][j]
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0 {
					t_dist[i][j] = INF
					t_prev[i][j] = -1
				} else {
					t_dist[i][j] = t_matrix[i][j]
					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]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
				}
			}
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					t_newlen := t_dist[i][k] + t_dist[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<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#define INF 1000000
void cWarshall_Floyd();
void tWarshall_Floyd();
int glid_cost[100][100];
int glid_tim[100][100];
int n,m,a,b,tim,cost,qs,p,q,r;
using namespace std;
void cWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=min(glid_cost[i][j],glid_cost[i][k]+glid_cost[k][j]);
			}
		}
	}
}
void tWarshall_Floyd()
{
	int i,j,k;
	for(k=0;k<m;k++) {
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_tim[i][j]=min(glid_tim[i][j],glid_tim[i][k]+glid_tim[k][j]);
			}
		}
	}
}
int main(void)
{
	ios::sync_with_stdio(false);
	int i,j,k;
	while(1) {
		cin>>n>>m;
		if(n==0&&m==0) break;
		for(i=0;i<m;i++) {
			for(j=0;j<m;j++) {
				glid_cost[i][j]=INF;
				glid_tim[i][j]=INF;
			}
		}
		for(i=0;i<m;i++) {
			glid_cost[i][i]=0;
			glid_tim[i][j]=0;
		}
		for(i=0;i<n;i++) {
			cin>>a>>b>>cost>>tim;
			a--;b--;
			glid_cost[a][b]=cost;
			glid_cost[b][a]=cost;
			glid_tim[a][b]=tim;
			glid_tim[b][a]=tim;
		}
		cWarshall_Floyd();tWarshall_Floyd();
		cin>>qs;
		for(i=0;i<qs;i++) {
			cin>>p>>q>>r;
			if(r==0) cout<<glid_cost[p-1][q-1]<<endl;
			else cout<<glid_tim[p-1][q-1]<<endl;
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const ll int INF = 1e18;
ll int ti[101][101];//time
ll int co[101][101];//cost
int n,m;
int main(){
	while(1){
		cin >> n >> m; 
		if(n == 0 && m == 0) break;
		REP(i,m){
			REP(j,m){
				if(i == j){
					ti[i][i] = co[i][i] = 0;
				}else{
					ti[i][j] = co[i][j] = INF;
				}
			}
		}
		REP(i,n){
			ll int a,b,cost,tim;
			cin >> a >> b >> cost >> tim;
			a--; b--;
			co[a][b] = cost;
			co[b][a] = cost;
			ti[a][b] = tim;
			ti[b][a] = tim;
		}
		//Warshall???Floyd Algorithm
		REP(i,m){
			REP(j,m){
				REP(k,m){
					ti[i][j] = min(ti[i][j], ti[i][k] + ti[k][j]);
					co[i][j] = min(co[i][j], co[i][k] + co[k][j]);
				}
			}
		}
		int k;
		cin >> k;
		REP(i,k){
			int a,b,r;
			cin >> a >> b >> r;
			a--; b--;
			if(r == 0) cout << co[a][b] << endl;
			else cout << ti[a][b] << endl;
		}
	}
	return 0;
}

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

const int N = 110;
int timu[N][N];
int cost[N][N];

int main()
{
  int n,m;
  while(cin >> n >> m ,n|m)
  {
    for(int i=0;i<N;++i)
    for(int j=0;j<N;++j)
      timu[i][j] = cost[i][j] = 1<<30;

    for(int i=0;i<n;++i)
    {
      int a,b,c,t;
      cin >> a >> b >> c >> t;
      cost[a][b] = cost[b][a] = c;
      timu[a][b] = timu[b][a] = t;
    }

    for(int k=0;k<N;++k)
    for(int i=0;i<N;++i)
    for(int j=0;j<N;++j)
    {
      cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
      timu[i][j] = min(timu[i][j], timu[i][k] + timu[k][j]);
    }

    int k;
    cin >> k;
    while(k--)
    {
      int p,q,r;
      cin >> p >> q >> r;
      if(r)
        cout << timu[p][q] << endl;
      else
        cout << cost[p][q] << endl;
    }
  }
  return 0;
}

C++: //2013/11/15(Fri)

#include <iostream>
using namespace std;
int main()
{
	int n,m;
	int a,b,cost[300][300],time[300][300];
	int k;
	int p[200],q[200],r[200];
	int INF = 1001;

	int dcost[300][300],dtime[300][300];
	while(true){
		cin >> n >> m;
		if(n==0 && m==0)
			break;

		for(int i=0; i<n; i++)
			for(int j=0; j<n; j++){
				if(i==j){
					cost[i][j] = 0;
					time[i][j] = 0;
				}		
				else{
					cost[i][j] = INF;
					time[i][j] = INF;
				}
			}

		for(int i=0; i<n; i++){
			cin >> a >> b ;
			cin >> cost[a][b] >> time[a][b];
			cost[b][a] = cost[a][b];
			time[b][a] = time[a][b];
		}  
		cin >> k;
		for(int i=0; i<k; i++)
			cin >> p[i] >> q[i] >> r[i];
			
		for(int i=0; i<n; i++)
			for(int j=0; j<n; j++){
				dcost[i][j] = cost[i][j];
				dtime[i][j] = time[i][j];
			}
		for(int h=0; h<n; h++)
			for(int i=0; i<n; i++)
				for(int j=0; j<n; j++){
					if(dcost[i][j] > dcost[i][h] + dcost[h][j])
						dcost[i][j] = dcost[i][h] + dcost[h][j];
					if(dtime[i][j] > dtime[i][h] + dtime[h][j])
						dtime[i][j] = dtime[i][h] + dtime[h][j];
				}

		
		for(int i=0; i<k; i++)
			if(r[i] == 0)
				cout << dcost[p[i]][q[i]] << endl;
			else if(r[i] == 1)
				cout << dtime[p[i]][q[i]] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define INF (1<<24)
main(){
  int n,m,k;
  int cost[301][301];
  int time[301][301];
  while(1){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
      for(int j=1;j<=m;j++){cost[i][j]=INF;time[i][j]=INF;}
    if(n==0 && m==0) break;
    for(int i=0;i<n;i++){
      int a,b,c,t;
      scanf("%d %d %d %d",&a,&b,&c,&t);
      cost[a][b]=c;
      cost[b][a]=c;
      time[a][b]=t;
      time[b][a]=t;
    }
    for(int i=1;i<=m;i++)
      for(int j=1;j<=m;j++)
	for(int l=1;l<=m;l++){
	  cost[i][j]=min(cost[i][j],cost[i][l]+cost[l][j]);
	  time[i][j]=min(time[i][j],time[i][l]+time[l][j]);
	}
      
    scanf("%d",&k);
    for(int i=0;i<k;i++){
      int p,q,r;
      scanf("%d %d %d",&p,&q,&r);
      if(r==0) printf("%d\n",cost[p][q]);
      else printf("%d\n",time[p][q]);
    }

  }
}