Pagini recente » Cod sursa (job #2452462) | Cod sursa (job #2151966) | Cod sursa (job #1826309) | Cod sursa (job #946287) | Cod sursa (job #2612030)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n, a[128][128];
void citire() {
f >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
f >> a[i][j];
}
void roy_floyd() {
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]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void afis() {
for (int i = 1; i <= n; ++i, g << '\n')
for (int j = 1; j <= n; ++j)
g << a[i][j] << " ";
}
int main()
{
citire();
roy_floyd();
afis();
return 0;
}