Cod sursa(job #761009)

Utilizator deneoAdrian Craciun deneo Data 24 iunie 2012 11:27:03
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <fstream>
using namespace std;

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

int n, a[110][110];

int main() {
    int i, j, k;
    fin >> n;
    for (i = 1; i <= n; ++i)
        for(j = 1; j <= n; ++j) 
            fin >> a[i][j];
    
    for (i = 1; i <= n; ++i)
        for (j = 1; j <= n; ++j)
            for (k = 1; k <= n; ++k)
                if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                    a[i][j] = a[i][k] + a[k][j];

    for (i = 1; i <= n; ++i) {
        for (j = 1; j <= n; ++j)
            fout << a[i][j] << " ";
        fout << "\n";
    }

    return 0;
    
}