Cod sursa(job #414860)
| Utilizator | Data | 10 martie 2010 17:08:23 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream.h>
#include<fstream.h>
int i,j,n,a[101][101],k;
int main()
{ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
}
