第五届程序设计大赛 Metric Matrice

Metric Matrice

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 1

描述

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<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
int a[31][31],b[5];
int main()
{
 int test,n;
 scanf("%d",&test);
 while(test--){
  scanf("%d",&n);
  memset(b,0,sizeof(b));
  memset(a,0,sizeof(a));
  for(int i=0;i<n;i++)
  for(int j=0;j<n;j++)scanf("%d",&a[i][j]);
  
  for(int i=0;i<n;i++)
  for(int j=0;j<n;j++){
   if(a[i][i]!=0)b[1]=1;
   if(i!=j&&a[i][j]<=0)b[2]=1;
   if(a[i][j]!=a[j][i])b[3]=1;
   for(int k=0;k<n;k++){
    if(i!=j&&j!=k){
     if(a[i][j]+a[j][k]<a[i][k])b[4]=1;
    }
   }
  }
  bool flag=1;
  for(int i=1;i<=4;i++){
   if(b[i]){
    printf("%d\n",i);
    flag=0;
    break;
   }
  }
  if(flag)printf("0\n");
 }
 return 0;
}