【floyd】hdu 4034

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <time.h>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;

#define LL long long
#define PI acos(-1.0)
#define N  105
#define MAX INT_MAX
#define MIN INT_MIN
#define eps 1e-8
#define FRE freopen("a.txt","r",stdin)
int g[N][N];
int vis[N][N];
int main(){
    int t;
    int ca=1;
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        int i,j,k;
        for(i=1;i<=n;i++)
        for(j=1;j<=n;j++){
        scanf("%d",&g[i][j]);
        vis[i][j]=0;
        }
        int ans=n*n-n;
        bool tag=1;
        for(k=1;k<=n;k++){
            for(i=1;i<=n;i++){
                for(j=1;j<=n;j++){
                    if(i==j || i==k || j==k)continue;
                    if(!vis[i][j] && g[i][j]==g[i][k]+g[k][j]){
                        ans--;
                        vis[i][j]=1;
                    }
                    if(g[i][j]>g[i][k]+g[k][j])
                    tag=0;
                }
                if(!tag)break;
            }
            if(!tag)break;
        }
        if(!tag)printf("Case %d: impossible\n",ca++);
        else{
            printf("Case %d: %d\n",ca++,ans);
        }
    }
    return 0;
}