Pagini recente » Cod sursa (job #2663438) | Cod sursa (job #1489875) | Cod sursa (job #2333422) | Cod sursa (job #2238450) | Cod sursa (job #2769184)
#include <bits/stdc++.h>
using namespace std;
int n, a[105][105];
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (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];
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++) cin >> a[i][j];
}
roy_floyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++) cout << a[i][j] << ' ';
}
}