Cod sursa(job #2067891)

Utilizator vladdy47Bucur Vlad Andrei vladdy47 Data 16 noiembrie 2017 22:20:50
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
# include <bits/stdc++.h>

using namespace std;

const int inf = 1e3 + 1, Nmax = 100 + 5;

int a[Nmax][Nmax], n, i, j, k;

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

    scanf("%d\n", &n);

    for (i = 1; i <= n; ++i)
        for (j = 1; j <= n; ++j)
        {
            scanf("%d ", &a[i][j]);
            if (!a[i][j]) a[i][j] = inf;
        }

    for (k = 1; k <= n; ++k)
        for (i = 1; i <= n; ++i)
            for (j = 1; j <= n; ++j)
                if (i != j) a[i][j] = min(a[i][j], a[i][k] + a[k][j]);


    for (i = 1; i <= n; ++i)
    {
        for (j = 1; j <= n; ++j)
            if (a[i][j] == inf) printf("0 ");
            else printf("%d ", a[i][j]);

        printf("\n");
    }

    return 0;
}