Cod sursa(job #2416274)

Utilizator alex2kamebossPuscasu Alexandru alex2kameboss Data 27 aprilie 2019 11:48:12
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <cstdio>

#define N 105

using namespace std;

int n, a[N][N];

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);

    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] && i!=j &&
                   (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0))
                    a[i][j] = a[i][k] + a[k][j];

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

    return 0;
}