Cod sursa(job #1618980)

Utilizator bullracerGabriel bullracer Data 28 februarie 2016 10:37:31
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

#define NMAX 107

using namespace std;

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

int Dp[NMAX][NMAX];
int n;

int main(){
    cin >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            cin >> Dp[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][j] > Dp[i][k] + Dp[k][j] || !Dp[i][j]) && Dp[i][k] && Dp[k][j] && i != j)
                    Dp[i][j] = Dp[i][k] + Dp[k][j];
    for(int i = 1; i <= n; ++i, cout << "\n")
        for(int j = 1; j <= n; ++j)
            cout << Dp[i][j] << " ";
    return 0;
}