UVA - 125 Numbering Paths

题意：求N个点的关系矩阵，矩阵记录的是路径的个数，N是输入中的最大值加一，如果个数存在无限次，打印-1，至于是否存在无限次通过dp[i][i]！=0判断

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 30;

int n,m,dp[MAXN][MAXN];

void floyd(){
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                dp[i][j] += dp[i][k] * dp[k][j];
    for (int k = 0; k < n; k++)
        if (dp[k][k])
            for (int i = 0; i < n; i++)
                for (int j = 0; j < n; j++)
                    if (dp[i][k] && dp[k][j])
                        dp[i][j] = -1;
}

void print(){
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            printf("%d%c",dp[i][j],(j==n-1)?'\n':' ');  
}


int main(){
    int t = 0;
    while (scanf("%d",&m) != EOF){
        n = 0;
        memset(dp,0,sizeof(dp));
        printf("matrix for city %d\n",t++);
        while (m--){
            int a,b;
            scanf("%d%d",&a,&b);
            dp[a][b] = 1;
            n = max(n,max(a,b));
        }
        n++;
        floyd();
        print();
    }
    return 0;
}