Cod sursa(job #1251694)

Utilizator serban_ioan97Ciofu Serban serban_ioan97 Data 29 octombrie 2014 20:03:22
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
# include <fstream>

using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int i, j, k, a[101][101], n, m;

void royfloyd()
{
    int i, j, k;

    for(k=1; k<=n; ++k)
        for(i=1; i<=n; ++i)
            for(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];
}

int main ()
{
    f>>n;
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            f>>a[i][j];
    royfloyd();
    for(i=1; i<=n; ++i)
    {
        for(j=1; j<=n; ++j)
        g<<a[i][j]<<" ";
        g<<"\n";
    }

    return 0;
}