Cod sursa(job #1156376)

Utilizator cosmin.pascaruPascaru Cosmin cosmin.pascaru Data 27 martie 2014 16:58:33
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <cstdio>

#define NMAX 105

using namespace std;

int n;
int a[NMAX][NMAX];

void citire()
{
    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]);
}
void Roy_Floyd()
{
    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])
                    if ( !a[i][j] ) a[i][j] = a[i][k] + a[k][j];
                    else if ( a[i][j] > a[i][k] + a[k][j]) a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            printf("%d ", a[i][j]);
        printf("\n");
    }
}
int main()
{
    citire();
    Roy_Floyd();
    afisare();
    return 0;
}