Cod sursa(job #521215)

Utilizator andraiandra ionescu andrai Data 11 ianuarie 2011 18:36:58
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include<fstream>
using namespace std;
long long n, c[105][105], d[105][105];
void floyd()
{
	 int i,j,k;
	 memcpy(d,c,sizeof(c));
     for(k=1;k<=n;k++)
         for(i=1;i<=n;i++)
             for(j=1;j<=n;j++)
                 {if(d[i][j]&&d[i][k]&&d[k][j]&&d[i][j]>d[i][k]+d[k][j])
					  d[i][j]=d[i][k]+d[k][j];
				  else if(i!=j&&!d[i][j]&&d[i][k]&&d[k][j])
					  d[i][j]=d[i][k]+d[k][j];
				 } 
}
int main()
{
	 int i,j;
	 ifstream f("royfloyd.in");
	 ofstream g("royfloyd.out");
	 f>>n;
	 for(i=1;i<=n;i++) 
		 for(j=1;j<=n;j++) 
			 f>>c[i][j];
	 floyd();
	 for(i=1;i<=n;i++)
	 {
		 for(j=1;j<=n;j++) 
			 g<<d[i][j];
		 g<<endl;
	 }
	 return 0;
}