Cod sursa(job #2245429)

Utilizator nicolaefilatNicolae Filat nicolaefilat Data 25 septembrie 2018 11:38:34
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#define MAXN 105
#define INF 1000000000

using namespace std;

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

int n,dp[MAXN][MAXN];

void RoyFloyd(){
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(dp[i][j] > dp[i][k] + dp[k][j])
                    dp[i][j] = dp[i][k] + dp[k][j];
}

int main()
{   cout<<INF;
    in>>n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            in>>dp[i][j];
            if(!dp[i][j])
                dp[i][j] = INF;
        }
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dp[i][j] != INF && i != j)
                out<<dp[i][j]<<" ";
            else
                out<<0<<" ";
        }
        out<<"\n";
    }

    return 0;
}