Cod sursa(job #1908593)

Utilizator Lungu007Lungu Ionut Lungu007 Data 7 martie 2017 09:34:37
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <fstream>
#define NMAX 102
using namespace std;

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

int n,a[NMAX][NMAX];

int main()
{
    in >> n;
    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            in >> a[i][j];
        }
    }

    for(int k=1;k<=n;k++) {
        for(int i=1;i<=n;i++) {
            for(int j=1;j<=n;j++) {
                if(a[i][k] && a[k][j] && i!=j && (a[i][j] > a[i][k]+a[k][j] || !a[i][j])) {
                    //cout << i << " "<< j << "\n";
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }

    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            out << a[i][j] << " ";
        }
        out << "\n";
    }
    return 0;
}