Cod sursa(job #2158376)

Utilizator BourucLiviuBouruc Petru Liviu BourucLiviu Data 10 martie 2018 12:26:45
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>

#define N 105

using namespace std;

int a[N][N];

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j) scanf("%d", &a[i][j]);

    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                if(a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];

    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j) printf("%d ", a[i][j]);
        printf("\n");
    }
    return 0;
}