Cod sursa(job #2694079)

Utilizator antonioganea3Antonio Ganea antonioganea3 Data 7 ianuarie 2021 23:09:50
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#include <iostream>
using namespace std;

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

int n;
int M[105][105];

void read() {
    fin >> n;
    for( int i = 1; i <= n; i++ )
        for( int j = 1; j <= n; j++ ){
            fin >> M[i][j];
        }

}

void solve() {
    for( int k = 1; k <= n; k++ )
        for( int i = 1; i <= n; i++ )
            for( int j = 1; j <= n; j++ )
                if( ( M[i][j] > M[i][k] + M[k][j] || !M[i][j] ) && i!=k && k!=j && i!=j && M[i][k] && M[k][j] )
                    M[i][j] = M[i][k]+M[k][j];
}

int main() {
    read();
    solve();

    for( int i = 1; i <= n; i++ ) {
        for( int j = 1; j <= n; j++ ){
            fout << M[i][j] << ' ';
        }
        fout << '\n';
    }
}