Pagini recente » Cod sursa (job #2705150) | Istoria paginii runda/macacu_22/clasament | Cod sursa (job #2068088) | Cod sursa (job #2259438) | Cod sursa (job #2252890)
#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;
}