Cod sursa(job #1879359)
| Utilizator | Data | 14 februarie 2017 21:05:42 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[105][105];
int main()
{ 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][k]+a[k][j]<a[i][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';
}
g.close();
return 0;
}
