Cod sursa(job #1608302)

Utilizator Mr.RobotElliot Alderson Mr.Robot Data 21 februarie 2016 23:10:46
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n, a[110][110], i, j, k;

int main()
{
    f >> n;
    for( i = 1; i <= n ; i ++ )
        for( j = 1; j <= n; j ++ )
            f >> a[i][j];


    for( i = 1; i <= n; i ++ )
        for( j = 1; j <= n; j ++ )
            for( k = 1; k <= n; k ++ )
                if( i != j )
                    if( (a[i][k] && a[k][j]) && ( a[i][k] + a[k][j] < a[i][j] || !a[i][j] ) )
                        a[i][j] = a[i][k] + a[k][j];

    for( i = 1; i <= n; i ++ )
    {
        for( j = 1; j <= n; j ++ )
            g << a[i][j] <<" ";
        g << '\n';
    }
    return 0;
}