Cod sursa(job #514621)

Utilizator RaddarDascalu Alexandru Raddar Data 19 decembrie 2010 11:55:14
Problema Floyd-Warshall/Roy-Floyd Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include<algorithm>
#include<iostream>
using namespace std;
int n,a[10001][10001],i,j,k;
int main()
{
	freopen ("royfloyd.in", "r", stdin);
	freopen("royfloyd.out","w", stdout);
	cin>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			cin>>a[i][j];
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if((a[i][k]+a[k][j]<a[i][j])&&(i!=k)&&(j!=k))a[i][j]=a[i][k]+a[k][j];
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			cout<<a[i][j]<<" ";
		cout<<endl;
	}
}