Cod sursa(job #623604)

Utilizator AvramBogdanAvramBogdan AvramBogdan Data 20 octombrie 2011 13:38:47
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.45 kb
#include<fstream>
#include<algorithm>
# define dim 50000
 using namespace std;
 ifstream f("rf.in");
 ofstream g("rf.out");
 int n,m,costminim,k,j,i;
 int a[100][100];
 int main()
 {
	 for(i=1;i<=n;i++)
	 {
		 for(j=i;i<=m;j++)
			 f>>a[i][j];
	 for(i=1;i<=n;i++)
		 for(j=1;j<=n;j++)
			 for(k=1;k<=n;k++)
			a[i][j]=min(a[i][j],a[i][j]+a[k][j]);
		for(i=1;i<=n;i++) 
		{
			for(j=1;j<=n;j++)
		g<<a[i][j]<<" ";
		g<<"\n";
		}
	 }
 }