Cod sursa(job #1614877)

Utilizator lacraruraduRadu Matei Lacraru lacraruradu Data 26 februarie 2016 11:23:33
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>

using namespace std;

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

#define N 101

int n;
int a[N][N];

int main()
{
    in >> n;

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

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

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