Cod sursa(job #573459)

Utilizator UpL1nKPaunescu Sorin UpL1nK Data 6 aprilie 2011 12:02:50
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
using namespace std;

int n, a[101][101];

void royFloyd();
void afisare();

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]);

    royFloyd();
    afisare();

    return 0;
}

void royFloyd() {

    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];

}

void afisare() {

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


}