Cod sursa(job #1498371)

Utilizator DonleenoVass Arnold Donleeno Data 8 octombrie 2015 15:15:13
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.57 kb
#include <stdio.h>

int graph[1000][1000];

int main(){

	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out","w",stdout);
	int N;
	scanf("%d", &N);

	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			scanf("%d", &graph[i][j]);
		}
	}
	for (int k = 0; k < N; k++)
	{
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < N; j++)
			{
				if (graph[i][j] > graph[i][k] + graph[k][j])
				{
					graph[i][j] = graph[i][k] + graph[k][j];
					printf("%d ", graph[i][j]);
				}
			}
			printf("\n");
		}
	}
	return 0;

}