Cod sursa(job #2916935)

Utilizator florinrafiliuRafiliu Florin florinrafiliu Data 2 august 2022 14:35:22
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int maxN = 105;

int a[maxN][maxN];

int main()
{
    int n; 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(a[i][k] != 0 && a[k][j] != 0)
                    a[i][j] = min(a[i][k] + a[k][j], a[i][j]);

    for(int i = 1; i <= n; ++i, fout << '\n')
        for(int j = 1; j <= n; ++j)
            fout << a[i][j] << " ";

    return 0;
}