HDU 4034 Graph

#include <iostream>
#include <cstdio>

using namespace std;
const int MAXN = 105;

int map[MAXN][MAXN];

int main()
{
    int t, n, ans;
    bool flag;
    scanf("%d", &t);
    for (int cas = 1; cas <= t; ++cas)
    {
        flag = false;
        scanf("%d", &n);
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                scanf("%d", &map[i][j]);
            }
        }
        ans = n * (n - 1);
        
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (i == j) continue;
                for (int k = 0; k < n; ++k)
                {
                    if (i == k || j == k) continue;
                    if (map[i][k] + map[k][j] < map[i][j])
                    {
                        flag = true;
                        break;
                    }
                    if (map[i][k] + map[k][j] == map[i][j])
                    {
                        ans--;
                        break;
                    }
                }
            }
        }
        if (flag)
            printf("Case %d: impossible\n", cas);
        else
            printf("Case %d: %d\n", cas, ans);
    }
    return 0;
}