Cod sursa(job #2564787)

Utilizator Fatu_SamuelFatu Samuel Fatu_Samuel Data 2 martie 2020 10:25:08
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 105;

int n;

int a[nmax][nmax];

void RoyFloyd()
{
    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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || (!a[i][j] && i != j)))
                    a[i][j] = a[i][k] + a[k][j];
}

int main()
{
    fin >> n;

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

    RoyFloyd();

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

    fin.close();
    fout.close();
    return 0;
}