Cod sursa(job #584075)

Utilizator scipianusFMI Ciprian Olariu scipianus Data 23 aprilie 2011 20:45:25
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include<fstream>
#include<math.h>
using namespace std;
int n,a[105][105];
int main()
{
	int i,j,k;
	ifstream fin("royfloyd.in");
	fin>>n;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			fin>>a[i][j];
	fin.close();
	for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				if(a[i][k]!=0 && a[k][j]!=0)
					a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
			}
	ofstream fout("royfloyd.out");
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			fout<<a[i][j]<<' ';
		fout<<"\n";
	}
	fout.close();
	return 0;
}