Cod sursa(job #1060071)

Utilizator eugen_ptrEugen Patru eugen_ptr Data 17 decembrie 2013 16:08:04
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <cstdio>
#define Nmax 100+5

using namespace std;

int n;
int c[Nmax][Nmax];
int a[Nmax][Nmax];

void citire()
{
    scanf("%d",&n);
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            scanf("%d",&c[i][j]);
}

void RoyFloyd()
{
    for (int k=1; k<=n; k++)
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                if (c[i][k] * c[k][j])
                    c[i][j]=min(c[i][j], c[i][k]+c[k][j]);

}

void afisare()
{
    for (int i=1; i<=n; i++)
        {
            for (int j=1; j<=n; j++)
                printf("%d ",c[i][j]);
            printf("\n");
        }
}

int main()
{
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    citire();
    RoyFloyd();
    afisare();
    return 0;
}