Cod sursa(job #623611)

Utilizator AvramBogdanAvramBogdan AvramBogdan Data 20 octombrie 2011 13:49:48
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<fstream>
#include<algorithm>
#define inf 0x3f3f3f
 using namespace std;
 ifstream f("royfloyd.in");
 ofstream g("royfloyd.out");
 int n,m,costminim,k,j,i;
 int a[100][100];
 int main()
 {
	 f >> n ;
	 for(i=1;i<=n;i++)
	 	 for(j=1;j<=n;j++)
			{f>>a[i][j];
		 if ( a[ i ][ j ] == 0  && i != j )
			 a[ i ][ j ] = inf;
			}
	 			
	 for(k=1;k<=n;k++)
	 for(i=1;i<=n;i++)
		 for(j=1;j<=n;j++)
			a[i][j]=min(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 ] != inf )
				g<<a[i][j]<<" ";
				else
					g<<0<< " ";
		g<<"\n";
		}
	 }