Cod sursa(job #2256014)

Utilizator TudorCaloianCaloian Tudor-Ioan TudorCaloian Data 7 octombrie 2018 20:23:28
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>

using namespace std;

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

int n, m[101][101];

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

    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(m[i][k] && m[k][j] && i!=j)
                    if(!m[i][j] || m[i][j] > m[i][k] + m[k][j])
                        m[i][j] = m[i][k] + m[k][j];
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j<= n; j++)
            fout << m[i][j] << " ";
        fout << '\n';
    }
    return 0;
}