Pagini recente » Cod sursa (job #1649125) | Cod sursa (job #194231) | Cod sursa (job #72500) | Cod sursa (job #2309468) | Cod sursa (job #3030406)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, m, k, N, maxx;
int a[105][105];
iint 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] != 0 && a[k][j] != 0) {
if (a[i][j] != 0)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
else if (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';
}
return 0;
}