Cod sursa(job #2677240)

Utilizator Tudor06MusatTudor Tudor06 Data 26 noiembrie 2020 08:34:52
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>

using namespace std;

const int NMAX = 100;

int cost[NMAX][NMAX];

int main() {
    ifstream fin( "royfloyd.in" );
    ofstream fout( "royfloyd.out" );
    int i, j, k, n;
    fin >> n;
    for ( i = 0; i < n; i ++ ) {
        for ( j = 0; j < n; j ++ )
            fin >> cost[i][j];
    }
    for ( k = 0; k < n; k ++ ) {
        for ( i = 0; i < n; i ++ ) {
            for ( j = 0; j < n; j ++ ) {
                if ( cost[i][j] && cost[k][j] && ( cost[i][k] + cost[k][j] < cost[i][j] || cost[i][j] == 0 ) && i != j )
                    cost[i][j] = cost[i][k] + cost[k][j];
            }
        }
    }
    for ( i = 0; i < n; i ++ ) {
        for ( j = 0; j < n; j ++ )
            fout << cost[i][j] << ' ';
        fout << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}