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 <string>
#include <vector>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define INF 11451400


/*
int main(){
	while(true){
		int lineL, statL;
		cin >> lineL >> statL;
		if(lineL==0&&statL==0){return 0;}

		long leastCosts[statL][statL];
		long leastTimes[statL][statL];
		FOR(aStat,0,statL){
			FOR(bStat,0,statL){
				leastCosts[aStat][bStat] = leastTimes[aStat][bStat] = (aStat==bStat)?0:INF;
			}
		}

		REP(lineI,lineL){
			int naStat,nbStat,nCost,nTime;
			cin >> naStat >> nbStat >> nCost >> nTime;
			naStat -=1; nbStat -=1;
			FOR(aStat,0,statL){
				FOR(bStat,0,statL){
					leastCosts[aStat][bStat] = min(leastCosts[aStat][bStat] , leastCosts[aStat][naStat]+nCost+leastCosts[nbStat][bStat]);
					leastCosts[aStat][bStat] = min(leastCosts[aStat][bStat] , leastCosts[aStat][nbStat]+nCost+leastCosts[naStat][bStat]);
					leastTimes[aStat][bStat] = min(leastTimes[aStat][bStat] , leastTimes[aStat][naStat]+nTime+leastTimes[nbStat][bStat]);
					leastTimes[aStat][bStat] = min(leastTimes[aStat][bStat] , leastTimes[aStat][nbStat]+nTime+leastTimes[naStat][bStat]);
				}
			}
		}

		int reqL;
		cin >> reqL;
		REP(reqI,reqL){
			int aStat,bStat,costOrTime;
			cin >> aStat >> bStat >> costOrTime;
			aStat-=1;bStat-=1;
			if(costOrTime==0){cout<<leastCosts[aStat][bStat]<<endl;};
			if(costOrTime==1){cout<<leastTimes[aStat][bStat]<<endl;};
		}
	}
}
*/

int main(){
	while(true){
		int lineL, statL;
		cin >> lineL >> statL;
		if(lineL==0&&statL==0){return 0;}

		long leastCosts[statL][statL];
		long leastTimes[statL][statL];
		FOR(aStat,0,statL){
			FOR(bStat,0,statL){
				leastCosts[aStat][bStat] = leastTimes[aStat][bStat] = (aStat==bStat)?0:INF;
			}
		}

		REP(lineI,lineL){
			int naStat,nbStat,nCost,nTime;
			cin >> naStat >> nbStat >> nCost >> nTime;
			naStat -=1; nbStat -=1;
			leastCosts[naStat][nbStat] = leastCosts[nbStat][naStat] = nCost;
			leastTimes[naStat][nbStat] = leastTimes[nbStat][naStat] = nTime;
		}

		REP(k,statL) REP(i,statL) REP(j,statL) {
			leastCosts[i][j] = min(leastCosts[i][j] , leastCosts[i][k]+leastCosts[k][j]);
			leastTimes[i][j] = min(leastTimes[i][j] , leastTimes[i][k]+leastTimes[k][j]);
		}

		int reqL;
		cin >> reqL;
		REP(reqI,reqL){
			int aStat,bStat,costOrTime;
			cin >> aStat >> bStat >> costOrTime;
			aStat-=1;bStat-=1;
			if(costOrTime==0){cout<<leastCosts[aStat][bStat]<<endl;};
			if(costOrTime==1){cout<<leastTimes[aStat][bStat]<<endl;};
		}
	}
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int road1[111][111];
  int road2[111][111];
  int n,m;
  int a,b,cost,time;
  int p,q,r;
  int x;
  while(1){
    for(int i=0;i<111;i++){
      for(int j=0;j<111;j++){
	road1[i][j]=road2[i][j]=111111111;
      }
    }
    cin >> n >> m;
    if(n==0 && m==0)break;
    for(int i=0;i<n;i++){
      cin >> a >> b >> cost >> time;
      road1[a][b]=road1[b][a]=cost;
      road2[a][b]=road2[b][a]=time;
    }

    for(int k=1;k<=m;k++){
      for(int i=1;i<=m;i++){
	for(int j=1;j<=m;j++){
	  if(road1[i][j]>road1[i][k]+road1[k][j]){
	    road1[i][j]=road1[i][k]+road1[k][j];
	  }
	  if(road2[i][j]>road2[i][k]+road2[k][j]){
	    road2[i][j]=road2[i][k]+road2[k][j];
	  }
	}
      }
    }
    
    cin >> x;
    for(int i=0;i<x;i++){
      cin >> p >> q >> r;
      cout << (r==0 ? road1[p][q] : road2[p][q]) << endl;
    }
  }
}

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

#define INF (1<<29)

int m;
int graph[2][101][101];

void wa(int num){

  for(int i=1;i<=m;i++){
    for(int j=1;j<=m;j++){
      for(int k=1;k<=m;k++){
	graph[num][j][k] = min(graph[num][j][k],graph[num][j][i]+graph[num][i][k]);
      }
    }
  }
  
}

int main(){
  int n,a,b,c,d,k;
  
  while(scanf("%d %d",&n,&m),n!=0&&m!=0){
    
    fill_n(**graph,2*101*101,INF);
    for(int i=1;i<=m;i++){
      graph[0][i][i] = 0;
      graph[1][i][i] = 0;
    }
    
    for(int i=0;i<n;i++){
      scanf("%d %d %d %d",&a,&b,&c,&d);
      graph[0][a][b] = c;
      graph[0][b][a] = c;
      graph[1][a][b] = d;
      graph[1][b][a] = d;
    }
    
    wa(0);
    wa(1);
    
    scanf("%d",&k);
    for(int i=0;i<k;i++){
      scanf("%d %d %d",&a,&b,&c);
      printf("%d\n",graph[c][a][b]);
    }
    
  }
  return(0);
}

C++: #include<iostream>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
int main(void){
  int maze[2][100][100];
  int n,m;
  int a,b,c,t;
  while(cin>>m>>n,n+m){
    rep(i,n)rep(j,n)rep(k,2)maze[k][i][j]=100000;
    rep(i,m){
      cin>>a>>b>>c>>t;
      maze[0][--a][--b]=c;
      maze[1][a][b]=t;
      maze[0][b][a]=c;
      maze[1][b][a]=t;
    }
    rep(k,n)rep(i,n)rep(j,n)rep(l,2)
      maze[l][i][j]=min(maze[l][i][j],maze[l][i][k]+maze[l][k][j]);
    cin>>m;
    cout<<endl;rep(i,n)rep(j,n)cout<<maze[1][i][j]<<(j==n-1?'\n':' ');
    
    rep(i,m){
      cin>>a>>b>>c;
      cout<<maze[c][--a][--b]<<endl;
    }
  }
}