Cod sursa(job #1350078)
| Utilizator | Data | 20 februarie 2015 17:33:28 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101], i, j, k, n;
int main()
{ f>>n;
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 (i!=k && i!=j && k!=j && a[i][k] && a[k][j] && a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for (i=1; i<=n; ++i)
{ for (j=1; j<=n; ++j) g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}
