Cod sursa(job #943894)

Utilizator Stefex09Stefan Teodorescu Stefex09 Data 26 aprilie 2013 18:48:49
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int A[111][111];

int main()
{
    int N, i, j, k;

    in >> N;
    for (i = 1; i <= N; i ++)
        for (j = 1; j <= N; j ++)
            in >> A[i][j];

    for (k = 1; k <= N; k ++)
        for (i = 1; i <= N; i ++)
            for (j = 1; j <= N; j ++)
                if (i != j && A[i][k] && A[k][j]){
                    A[i][j] = min (A[i][j], A[i][k] + A[k][j]);

                    if (!A[i][j])
                        A[i][j] = A[i][k] + A[k][j];
                }

    for (i = 1; i <= N; i ++, out << "\n")
        for (j = 1; j <= N; j ++)
            out << A[i][j] << " ";

    return 0;
}