View Code of Problem 14

#include<stdio.h>
#define N 2000

int main()
{
    int dis[N][N];
    int t,n,a,b,vable;
    int i,j;
    int w,e,c,d;
    int k = 1;
    int sum;

    while(scanf("%d %d",&t,&n) != EOF)
    {
        if(t == 0&&n == 0)
            break;

        for(i = 1;i <= N;i++)
        {
           for(j = 1;j <= N;j++)
           {
               dis[i][j] = 0;
           }
        }

        while(n > 0)
        {
            scanf("%d %d %d",&a,&b,&vable);
            if(dis[a][b] == 0)
            {
                dis[a][b] = dis[b][a] = vable;
            }
            else if(vable < dis[a][b])
            {
                dis[a][b] = dis[b][a] = vable;
            }
            n--;
        }

        scanf("%d %d",&w,&e);
        sum = 0;
        while(w > 0)
        {
            scanf("%d %d",&c,&d);
            sum += dis[c][d];
            w--;
        }
        printf("Case #%d: %d\n",k,sum);
    }

    return 0;
}