Cod sursa(job #1925933)

Utilizator giotoPopescu Ioan gioto Data 13 martie 2017 20:48:03
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <cstdio>
using namespace std;

int m, n, a[101][101];
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] && (a[i][j] > a[k][j] + a[i][k] || a[i][j] == 0) && 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;
}