Cod sursa(job #701828)

Utilizator razvan2006razvan brezulianu razvan2006 Data 1 martie 2012 18:01:33
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<cstdio>
#include<algorithm>
#define maxN 101
using namespace std;

int n, m, i, j, mat[maxN][maxN];

int main() {
	freopen("royfloyd.in", "r", stdin);
	freopen("royfloyd.out", "w", stdout);
	
	scanf("%d", &n);
	
	for(i = 1; i <= n; i++)
		for(j = 1; j <= n; j++) {
			scanf("%d", &mat[i][j]); 
			if(mat[i][j] == 0)
				mat[i][j] = maxN*maxN*maxN;
		}
		
	int k;
	for(k = 1; k <= n; k++)
		for(i = 1; i <= n; i++)
			for(j = 1; j <= n; j++)
				if(mat[i][j] > mat[i][k] + mat[k][j])
					mat[i][j] = mat[i][k] + mat[k][j];
				
	for(i = 1; i <= n; i++) {
		for(j = 1; j <= n; j++)
			if(mat[i][j] ==  maxN*maxN*maxN)
				printf("0 ");
			else printf("%d ", mat[i][j]);
		printf("\n");
	}
	return 0;
}