10048.cpp

/**
 *    @author     : Maruf Tuhin
 *    @School     : CUET CSE 11
 *    @TOPCODER   : the_redback
 *    @CodeForces : the_redback
 *    @UVA        : the_redback
 *    @link       : http://www.fb.com/maruf.2hin
 */
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<sstream>
#include<stack>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define pp pop_back
#define inf 1000000000
#define NN 100

int pr[NN+7];
int a[NN+7][NN+7];

main()
{
    //freopen("C:\\Users\\Maruf Tuhin\\Desktop\\in.txt","r",stdin);
    //ios_base::sync_with_stdio(false);
    int i,j,k,l,n,r,c,count;
    int tc,t=1;
    int u,v,w;
    //scanf("%d",&tc);
    while(~scanf("%d%d%d",&n,&r,&l))
    {
        if(n==0 && r==0 && l==0)
            return 0;
        for(i=0;i<=n;i++)
        {
            for(j=0;j<=n;j++)
                a[i][j]=inf;
            a[i][i]=0;
        }
        while(r--)
        {
            scanf("%d%d%d",&u,&v,&w);
            a[u][v]=w;
            a[v][u]=w;
        }
        for(k=1;k<=n;k++)
            for(i=1;i<=n;i++)
                for(j=1;j<=n;j++)
                    a[i][j]=min(a[i][j],max(a[i][k],a[k][j]));
        if(t!=1)
            puts("");
        printf("Case #%d\n",t++);
        while(l--)
        {
            scanf("%d%d",&n,&r);
            int sum=a[n][r];
            if(sum>=inf)
                puts("no path");
            else
                printf("%d\n",sum);
        }
    }
    return 0;
}