Cod sursa(job #992634)

Utilizator diac_paulPaul Diac diac_paul Data 2 septembrie 2013 11:17:29
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <stdio.h>
#define NMax 200

int n, d[NMax][NMax];

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			scanf("%d", &d[i][j]);

	for (int k = 0; k < n; k++)
		for (int i = 0; i < n; i++)
			for (int j = 0; j < n; j++)
				if (i != j && d[i][j] > d[i][k] + d[k][j] && d[i][k] != 0 && d[k][j] != 0)
					d[i][j] = d[i][k] + d[k][j];

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
			printf("%d ", d[i][j]);
		printf("\n");
	}

	return 0;
}