Cod sursa(job #2164129)

Utilizator BondyBondoc Alexandru Ionut Bondy Data 12 martie 2018 21:38:44
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <fstream>
using namespace std;

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

int main()
{
    int n, v[101][101];
    fin >> n;

    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin >> v[i][j];

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

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout << v[i][j] << " ";

        fout << "\n";
    }

    return 0;
}