Cod sursa(job #2556852)

Utilizator radugheoRadu Mihai Gheorghe radugheo Data 25 februarie 2020 11:23:18
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
#include <bits/stdc++.h>

using namespace std;

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

int n, i, j, k;
int a[105][105];

int main(){
    fin >> n;
    for (i=1; i<=n; i++){
        for (j=1; j<=n; j++){
            fin >> a[i][j];
            if (a[i][j] == 0 && i != j){
                a[i][j] = INT_MAX;
            }
        }
    }
    for (k=1; k<=n; k++){
        for (i=1; i<=n; i++){
            for (j=1; j<=n; j++){
                a[i][j] = min (a[i][k] + a[k][j], a[i][j]);
            }
        }
    }
    for (i=1; i<=n; i++){
        for (j=1; j<=n; j++){
            fout << a[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}
//recapitulare