Cod sursa(job #810668)

Utilizator lianaliana tucar liana Data 10 noiembrie 2012 18:42:23
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<stdio.h>
#define nmax 102
long i, j, n, k, ma[nmax][nmax];

void citire()
{
	scanf("%ld",&n);
	for (i=1;i<=n;i++)
		for (j=1;j<=n;j++)
			scanf("%ld",&ma[i][j]);
}

void rezolvare()
{
	for (k=1;k<=n;k++)
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				if (i!=j)
					if ((ma[i][k])&&(ma[k][j]))
						if ((ma[i][k]+ma[k][j]<ma[i][j])||(ma[i][j]==0))
							ma[i][j]=ma[i][k]+ma[k][j];
}

void afisare()
{
	for (i=1;i<=n;i++)
	{
		for (j=1;j<=n;j++)
			printf("%ld ",ma[i][j]);
		printf("\n");
	}
}

int main()
{
	freopen("royfloyd.in","r",stdin);
	freopen("royfloyd.out","w",stdout);
	citire();
	rezolvare();
	afisare();
	return 0;
}