Cod sursa(job #2541245)

Utilizator olteanupetru02Olteanu Petru olteanupetru02 Data 8 februarie 2020 11:38:35
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF = 1000001;
const int N = 101;
int n, d[N][N];
int main(){
    in>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            in>>d[i][j];
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            if(i != j && d[i][j] == 0)
                d[i][j] = INF;

    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                if(d[i][k] + d[k][j] < d[i][j]){
                    d[i][j] = d[i][k] + d[k][j];
                    //pred[i][j] = pred [k][j];
                }
            }
        }
    }

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

    return 0;

}