Cod sursa(job #893608)

Utilizator linerunnerMihai Ion linerunner Data 26 februarie 2013 16:46:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>
#include <iostream>
using namespace std;
int dr,a[101][101],i,j,k,n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void citire()
{ for (i=1 ; i<=n ; i++)
	for(j=1 ; j<=n ; j++)
		f>>a[i][j];
}
void drumuri()
{for (k=1 ; k<=n ; k++)
	for(i=1 ; i<=n ; i++)
		for(j=1 ; j<=n ; j++)
		{   dr=a[i][k]+a[k][j];
			if ((a[i][k]!=0) && (a[k][j]!=0) && (i!=j) && ( (a[i][j]>dr) || (a[i][j]==0))) a[i][j]=a[i][k]+a[k][j] ;
		}
}
void afisare()
{for (i=1 ; i<=n ; i++)
	{
	for(j=1 ; j<=n ; j++)
	g<<a[i][j]<<" ";
	g<<'\n';
	}
}
int main()
{ f>>n;
citire();
drumuri();
afisare();
f.close();
g.close();
return 0;
}