Cod sursa(job #488818)

Utilizator claudiumihailClaudiu Mihail claudiumihail Data 30 septembrie 2010 03:24:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include<fstream>
#include<iostream>
using namespace std;

inline long minimum(const long a, const long b)
{
	if(a && b)
		return a<b?a:b;
	else
		return a?a:b;
}

int main()
{
	int n;
	fstream fin("royfloyd.in", fstream::in);
	fstream fout("royfloyd.out", fstream::out);
	
	long mat[128][128]={{0}};
	
	fin>>n;
	
	for(int i=0; i<n; ++i)
	{
		for(int j=0; j<n; ++j)
		{
			fin>>mat[i][j];
			//cout<<mat[i][j]<<" ";
		}
		//cout<<endl;
	}
	//cout<<endl;
	
	//cout<<minimum(2,1)<<endl<<endl;
	
	for(int k=0; k<n; ++k)
	{
		for(int i=0; i<n; ++i)
		{
			for(int j=0; j<n; ++j)
			{
				if(i!=j && mat[i][k] && mat[k][j])
					mat[i][j]=minimum(mat[i][j],mat[i][k]+mat[k][j]);
			}
		}
	}
	
	for(int i=0; i<n; ++i)
	{
		for(int j=0; j<n; ++j)
		{
			fout<<mat[i][j]<<" ";
		}
		fout<<"\n";
	}
	
	fin.close();
	fout.close();
	return 0;
}