Cod sursa(job #654634)
| Utilizator | Data | 30 decembrie 2011 18:41:04 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int main ()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,n,j,k;
f>>n;
int a[n+1][n+1];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]*a[k][j]!=0 and a[i][j]>a[i][k]+a[k][j])a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++,g<<"\n")
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
f.close();
g.close();
return 0;
}