View Code of Problem 14

#include <stdio.h>
int main()
{
	int n,t,q;
	int p = 1;
	while( scanf("%d %d",&n,&t)!=EOF )
	{
		if(n==0&&t==0)
		  break;
		int i,a[2000],b[2000],value[2000];
		for(i=0;i<t;i++)
		{
			scanf("%d %d %d",&a[i],&b[i],&value[i]);			
		}
		for(i=0;i<t;i++)
		{
			for(q=i+1;q<t;q++)
			{
			  if( (a[i]==a[q] && b[i]==b[q]) || (a[i]==b[q]&&b[i]==a[q]) )
			    {
				if(value[i]>value[q])
				  value[i] = 0;
				else
				 value[q] = 0;
			   }   
			}
		}//small -> 0
	
		int w,e,j,a1[2000],b1[2000];
		scanf("%d %d",&w,&e);
		for(j=0;j<w;j++)
		{
			scanf("%d %d",&a1[j],&b1[j]);
		}
			/*for(i=0;i<t;i++)
		{
			printf("a1[i] = %d, b1[i] = %d\n",a1[i],b1[i]);
		}*/
		for(i=0;i<w;i++)
		{
			for(j=i+1;j<w;j++)
			{
				if( (a1[i]==a1[j]&&b1[i]==b1[j]) || (a1[i]==b1[j]&&b1[i]==a1[j]) )
			    {
				  a1[i]=0;
				  b1[i]=0;
			    }
			}
		}
		
		/*for(i=0;i<t;i++)
		{
			printf("a[i] =%d, b[i] = %d, value[i] = %d\n",a[i],b[i],value[i]);
		}		
		for(i=0;i<w;i++)
		{
			printf("a1[i] = %d, b1[i] = %d\n",a1[i],b1[i]);
		}	*/
		int k,m,sum=0;
		for(k=0;k<w;k++)
		{
			for(m=0;m<t;m++)
			{
				if( (a1[k]==a[m]&&b1[k]==b[m]) || (a1[k]==b[m]&&b1[k]==a[m]) )
				{
				    if(a1[k]<=e&&b1[k]<=e)
					sum+=value[m];
				}
			}			
		}
		printf("Case #%d: %d\n",p,sum);
		p++;
		sum = 0;
	}
	return 0;
}