Pagini recente » Cod sursa (job #2405214) | Cod sursa (job #2182427) | Cod sursa (job #116453) | Cod sursa (job #2559054) | Cod sursa (job #3005399)
#include <iostream>
using namespace std;
int st[20], a, b, v[20], n, p;
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];
}
}
}
}
int main()
{
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] << ' ';
}
cout << '\n';
}
return 0;
}