fzu2271(佛洛依德)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
//inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=x&(-x);return res;}
//inline void add(int x,int d){while(x<=n)c[x]+=d,x+=x&(-x);}
//int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}
const ll inf = 0x3f3f3f3f;
const int mx = 105;
int dis[mx][mx];
bool vis[mx][mx],path[mx][mx];
int main(){
	//freopen("C:\\Users\\black\\Desktop\\in.txt","r",stdin);
	int T=10;	scanf("%d",&T);
	int n,m,x,y,s,ans;
	for(int ca= 1; ca<=T; ca++){
		s2(n,m);
	
		for(int i = 1; i <= 100; i++)
			for(int j = 1; j <= 100; j++)
				dis[i][j]=inf;
		for(int i = 1; i <= 100; i++) dis[i][i] = 0;
	//	if(ma[1][3] == inf) puts("infff");
		ans = 0;
		memset(path,0,sizeof(path));
		for(int i = 0; i< m; i++){
			s3(x,y,s);
			path[x][y]=path[y][x] = 1;
			if(dis[x][y] != inf) ans++;
			dis[x][y]=dis[y][x] = min(dis[x][y],s);
		}
		memset(vis,0,sizeof(vis));
		
		for(int k = 1; k <= n; k++)
			for(int i = 1; i <= n; i++)
				for(int j = 1; j <= n;j++){
					if(i== j|| i==k || j == k||dis[k][i]==inf||dis[k][j]==inf) continue;
					if(dis[i][k]+dis[k][j] <= dis[i][j]){
						vis[i][j] = 1;
						dis[i][j]=dis[i][k]+dis[k][j];
					}		
				} 
		for(int i = 1; i <= n; i++)
			for(int j = i+1; j <=n; j++){
				if(vis[i][j] && path[i][j]) ans++;
			}
		printf("Case %d: %d\n",ca,ans);
	} 

	return 0;
}