Cod sursa(job #2592696)

Utilizator tudorcomanTudor Coman tudorcoman Data 2 aprilie 2020 09:04:34
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>

using namespace std;

int c[128][128];

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

int main() {
    ifstream in("royfloyd.in");
    ofstream out("royfloyd.out");

    int N;
    in >> N;
  
    for (int i = 1; i <= N; ++ i)
        for (int j = 1; j <= N; ++ j)
            in >> c[i][j];         

    royFloyd(N);
    for (int i = 1; i <= N; ++ i) {
        for (int j = 1; j <= N; ++ j)
            out << c[i][j] << ' ';
        out << '\n';
    }
    return 0;
}