Cod sursa(job #2245421)

Utilizator nicolaefilatNicolae Filat nicolaefilat Data 25 septembrie 2018 11:30:23
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
#define MAXN 105

using namespace std;

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

int n,dp[MAXN][MAXN];

int main()
{
    in>>n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            in>>dp[i][j];
    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                dp[i][j] = min(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;
}