【第五届河南省程序设计大赛】Metric Matrice

描述

Given as input a square distance matrix, where a[i][j] is the distance between point i and point j, determine if the distance matrix is "a  metric" or not.

A distance matrix a[i][j] is a metric if and only if

    1.  a[i][i] = 0

    2, a[i][j]> 0  if i != j

    3.  a[i][j] = a[j][i]

    4.  a[i][j] + a[j][k] >= a[i][k]  i ¹ j ¹ k

输入

The first line of input gives a single integer, 1 ≤ N ≤ 5, the number of test cases. Then follow, for each test case,
* Line 1: One integer, N, the rows and number of columns, 2 <= N <= 30
* Line 2..N+1: N lines, each with N space-separated integers 
(-32000 <=each integer <= 32000).

输出

Output for each test case , a single line with a single digit, which is the lowest digit of the possible facts on this list:
* 0: The matrix is a metric
* 1: The matrix is not a metric, it violates rule 1 above
* 2: The matrix is not a metric, it violates rule 2 above
* 3: The matrix is not a metric, it violates rule 3 above
* 4: The matrix is not a metric, it violates rule 4 above

样例输入

2

4

0 1 2 3

1 0 1 2

2 1 0 1

3 2 1 0

2

0 3

2 0

样例输出

0

3

水题，模拟就行。

 
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int a[35][35];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {

        int i,j,n,k,a1=0,a2=0,a3=0,a4=0;
        cin>>n;
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                scanf("%d",&a[i][j]);
            }
        }

        for(i=0; i<n; i++)
        {
            if(a[i][i]!=0)
            {
                a1++;
            }

            for(j=0; j<n; j++)
            {
                if(i!=j)
                {
                    if(a[i][j]<=0)
                        a2++;
                }
                if(a[i][j]!=a[j][i])
                {
                    a3++;
                }
                for(k=0; k<n; k++)
                {
                    if(i!=j&&i!=k&&j!=k)
                    {
                        if((a[i][j]+a[j][k])<a[i][k])
                        {
                            a4++;
                        }
                    }
                }
            }
        }
        if(a1)
            cout<<"1"<<endl;
        else if(a2)
            cout<<"2"<<endl;
        else if(a3)
            cout<<"3"<<endl;
        else if(a4)
            cout<<"4"<<endl;
       else cout<<"0"<<endl;
    }
    return 0;
}