Cod sursa(job #1498817)

Utilizator SirStevensIonut Morosan SirStevens Data 9 octombrie 2015 12:02:28
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

using namespace std;

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


int a[100][100],n;


void roy_floyd()
{
    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()
{
    in>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
    {
        in>>a[i][j];
    }
    roy_floyd();
    for(int i=1;i<=n;i++)
        {for(int j=1;j<=n;j++)
                out<<a[i][j]<<" ";
        out<<'\n';

        }
    return 0;
}