Cod sursa(job #2573268)

Utilizator MaxTeoTeo Oprescu MaxTeo Data 5 martie 2020 16:45:42
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>
using namespace std;

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

int n;
int m[105][105];

int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            f >> 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] && (m[i][j] > m[i][k] + m[k][j] || m[i][j] == 0) && i != j)
                    m[i][j] = m[i][k] + m[k][j];

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            g << m[i][j] << " \n"[j == n];

    return 0;
}