Pagini recente » Cod sursa (job #3318142) | Cod sursa (job #3333977) | Borderou de evaluare (job #1569190) | Cod sursa (job #3326421) | Cod sursa (job #3335969)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int inf = 1e9 + 7;
int n, a[105][105], d[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 i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
if (a[i][j] != 0 || i == j)
d[i][j] = a[i][j];
else
d[i][j] = inf;
for (int k=1; k<=n; ++k)
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j)
if (d[i][j] == inf)
g << 0 << ' ';
else
g << d[i][j] << ' ';
g << '\n';
}
return 0;
}