Cod sursa(job #2252890)
| Utilizator | Data | 3 octombrie 2018 11:35:41 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int n, a[105][105];
int main()
{
in >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
in >> 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][k]+a[k][j] || a[i][j]==0) && 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++)
out << a[i][j] << " ";
out << '\n';
}
return 0;
}
