Cod sursa(job #2918742)

Utilizator elenacazaciocElena Cazacioc elenacazacioc Data 12 august 2022 19:41:04
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>
using namespace std;

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

const int Nmax = 101;

int d[Nmax][Nmax];
int n;

int main()
{
    int i, j, k;

    in >> n; // numarul de noduri
    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
            in >> d[i][j];
        }
    }

    // Roy-Floyd
    for (k = 1; k <= n; k++) {
        for(i = 1; i <= n; i++) {
            for (j = 1; j <= n; j++) {
                if ((d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j && d[i][k] != 0 && d[k][j] != 0) {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }

    for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
           out << d[i][j] << " "; 
        }
        out << '\n';
    }

    return 0;
}