Cod sursa(job #2407473)

Utilizator Cezar211Popoveniuc Cezar Cezar211 Data 16 aprilie 2019 21:38:02
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 fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
long long n, a[105][105];
int main()
{
    fin >> n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fin >> a[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 && (a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && a[i][k] && a[k][j])
                    a[i][j] = a[i][k] + a[k][j];
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            fout << a[i][j] << ' ';
        fout << '\n';
    }
    return 0;
}