Cod sursa(job #1165263)

Utilizator tudorv96Tudor Varan tudorv96 Data 2 aprilie 2014 16:29:10
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>
using namespace std;

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

const int N = 105;

int n, a[N][N];

int main() {
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            fin >> 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 (i != j)
                a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j)
            fout << a[i][j] << " ";
        fout << "\n";
    }
}