Cod sursa(job #2525237)

Utilizator severutBogdan Sever-Cristian severut Data 16 ianuarie 2020 22:01:24
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.73 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int n;
int dp[105][105],m[105][105];
int main()
{
    in>>n;
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            in>>m[i][j];
            dp[i][j]=m[i][j];
        }
    }
    for(int k=1;k<=n;++k){
        for(int i=1;i<=n;++i){
            for(int j=1;j<=n;++j){
                if(dp[i][k]>0&&dp[k][j]>0&&(dp[i][k]+dp[k][j]>dp[i][j]||dp[i][j]==0&&i!=j))
                    dp[i][j]=dp[i][k]+dp[k][j];
            }
        }
    }
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            out<<dp[i][j]<<" ";
        }
        out<<'\n';
    }
    return 0;
}