Pagini recente » Cod sursa (job #1413104) | Cod sursa (job #2394732) | Cod sursa (job #1635399) | Cod sursa (job #85474) | Cod sursa (job #3151274)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[105][105], d[105][105];
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
in >> a[i][j];
d[i][j] = 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 (i != j)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
out << d[i][j] << " ";
}
out << '\n';
}
return 0;
}