Cod sursa(job #892767)

Utilizator visanrVisan Radu visanr Data 26 februarie 2013 11:36:23
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define Nmax 110

int Mat[Nmax][Nmax], N;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    int i, j, k;
    scanf("%i", &N);
    for(i = 1; i <= N; ++i)
        for(j = 1; j <= N; ++j)
            scanf("%i", &Mat[i][j]);
    for(k = 1; k <= N; ++k)
        for(i = 1; i <= N; ++i)
            for(j = 1; j <= N; ++j)
                if(Mat[i][k] && Mat[k][j] && (Mat[i][k] + Mat[k][j] < Mat[i][j] || !Mat[i][j]) && i != j)
                    Mat[i][j] = Mat[i][k] + Mat[k][j];
    for(i = 1; i <= N; ++i)
    {
        for(j = 1; j <= N; ++j) printf("%i ", Mat[i][j]);
        printf("\n");
    }
    return 0;
}