Cod sursa(job #941078)
| Utilizator | Data | 17 aprilie 2013 21:17:45 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int a[101][101],n;
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<=k; i++)
for (int j=1; j<=n; j++) a[i][j]=min(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';
}
f.close(); g.close();
return 0;
}
