Civil and Evil Engineer

                                                                   Civil and Evil Engineer

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit Status Practice LightOJ 1029

Description

A Civil Engineer is given a task to connect n houses with the main electric power station directly or indirectly. The Govt has given him permission to connect exactly n wires to connect all of them. Each of the wires connects either two houses, or a house and the power station. The costs for connecting each of the wires are given.

Since the Civil Engineer is clever enough and tries to make some profit, he made a plan. His plan is to find the best possible connection scheme and the worst possible connection scheme. Then he will report the average of the costs.

Now you are given the task to check whether the Civil Engineer is evil or not. That's why you want to calculate the average before he reports to the Govt.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer n (1 ≤ n ≤ 100) denoting the number of houses. You can assume that the houses are numbered from1 to n and the power station is numbered 0. Each of the next lines will contain three integers in the form u v w (0 ≤ u, v ≤ n, 0 < w ≤ 10000, u ≠ v) meaning that you can connect u and v with a wire and the cost will be w. A line containing three zeroes denotes the end of the case. You may safely assume that the data is given such that it will always be possible to connect all of them. You may also assume that there will not be more than12000 lines for a case.

Output

For each case, print the case number and the average as described. If the average is not an integer then print it in p/q form. Where p is the numerator of the result and q is the denominator of the result; p and q are relatively-prime. Otherwise print the integer average.

Sample Input

3

 

1

0 1 10

0 1 20

0 0 0

 

3

0 1 99

0 2 10

1 2 30

2 3 30

0 0 0

 

2

0 1 10

0 2 5

0 0 0

Sample Output

Case 1: 15

Case 2: 229/2

Case 3: 15

#include <iostream>

<span style="font-size:18px;">#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
int map1[1010][1010],map2[1010][1010];
int vis[1010],d[1010];
#define Max 0x3f3f3f3f
int prime1(int n)
{
    int i,j,he,wei=0;
    memset(vis,0,sizeof(vis));
    for(i=0; i<=n; i++)
        d[i]=map1[0][i];
    he=0;
    vis[0]=1;
    for(i=0; i<n; i++)
    {
        int min=10000000;
        for(j=1; j<=n; j++)
        {
            if(vis[j]==0&&d[j]<min)
            {
                wei=j;
                min=d[j];
            }
        }
        vis[wei]=1;
        he+=min;
        for(j=1; j<=n; j++)
        {
            if(vis[j]==0&&map1[wei][j]<d[j]&&wei!=j )
            {
                d[j]=map1[wei][j];
            }
        }
    }
    return he;
}
int prime2(int n)
{
    int i,j,he,wei;
    memset(vis,0,sizeof(vis));
    for(i=0; i<=n; i++)
        d[i]=map2[0][i];
    he=0;
    vis[0]=1;
    for(i=0; i<n; i++)
    {
        int min=0;
        for(j=1; j<=n; j++)
        {
            if(vis[j]==0&&d[j]>min)
            {
                wei=j;
                min=d[j];
            }
        }
        vis[wei]=1;
        he+=min;
        for(j=1; j<=n; j++)
        {
            if(vis[j]==0&&map2[wei][j]>d[j]&&wei!=j )
            {
                d[j]=map2[wei][j];
            }
        }
    }
    return he;
}
int main()
{
    int n,i,j,t,a,b,cost,x,y;
    int k=1;
    scanf("%d",&t);
    while(t--)
    {

        scanf("%d",&n);
        memset(map1,Max,sizeof(map1));
        memset(map2,0,sizeof(map2));
        memset(vis,0,sizeof(vis));
        while(scanf("%d%d%d",&a,&b,&cost))
        {
            if(a==0&&b==0&&cost==0)
            {
                break;
            }
            if(cost<map1[a][b])
                map1[a][b]=map1[b][a]=cost;
            if(cost>map2[a][b])
                map2[a][b]=map2[b][a]=cost;

        }
        x=prime1(n);
        y=prime2(n);
        //cout<<x<<' '<<y<<endl;
        //printf("%d\n",prime1(n));
        if((x+y)%2==0)
            printf("Case %d: %d\n",k++,(x+y)/2);
        else printf("Case %d: %d/2\n",k++,x+y);
    }
}



</span></span>