Cod sursa(job #3243008)

Utilizator StefanStratonStefan StefanStraton Data 15 septembrie 2024 01:31:06
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in"); ofstream out ("royfloyd.out");

int n, a[105][105];

int main()
{
    in >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++){
            in >> a[i][j];
            if(a[i][j] == 0 && i != j) a[i][j] = INT_MAX; /* */
		}

    for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
                a[i][j] = min(a[i][j], a[i][k] + a[k][j]);

				/*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 (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) out << a[i][j] << " ";
		out << '\n';
	}

	return 0;
}