Cod sursa(job #2593963)

Utilizator FlorusRuscuta Florin Florus Data 5 aprilie 2020 00:23:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[101][101];
void RoyFloid()
{
    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]) {
                     if(a[i][j] > a[i][k] + a[k][j] || !a[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];
    RoyFloid();
    for (int i = 1 ; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
            fout << a[i][j] << " ";
        fout << "\n";
    }


    return 0;
}