Cod sursa(job #874871)

Utilizator SilviussMezei Silviu Silviuss Data 9 februarie 2013 13:22:37
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main()
{
	short n,a[100][100],i,j,k;
	fin>>n;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			fin>>a[i][j];
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
			for(k=0;k<n;k++)
				if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) && i != j)
					a[i][j]=a[i][k]+a[k][j];
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
			fout<<a[i][j]<<" ";
		fout<<"\n";
	}
}