Cod sursa(job #2890145)

Utilizator MariusANDMarius-Ionut Andreiasi MariusAND Data 14 aprilie 2022 18:05:01
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],n;
void RoyFloyd(int n)
{
	int i,j,k;
	for(i=1; i<=n; i++)
	for(j=1; j<=n; j++)
	if(a[i][j]==0 && i!=j)
		a[i][j]=INT_MAX;
	for(k=1; k<=n; k++)
	for(i=1; i<=n; i++)
	for(j=1; j<=n; j++)
		if(a[i][k]!=INT_MAX && a[k][j]!=INT_MAX)
			if(a[i][j]>a[i][k]+a[k][j])
				a[i][j]=a[i][k]+a[k][j];
	for(i=1; i<=n; i++)
	{
		for(j=1; j<=n; j++)
			if(a[i][j]==INT_MAX)
				g<<"inf"<<" ";
			else
				g<<a[i][j]<<" ";
		g<<endl;
	}

}

int main()
{
	int i,j;
	f>>n;
	for(i=1; i<=n; i++)
		for(j=1; j<=n; j++)
			f>>a[i][j];
	RoyFloyd(n);
	f.close();
	g.close();
	return 0;
}