Pagini recente » Cod sursa (job #90441) | Cod sursa (job #1466777) | Cod sursa (job #2635121) | Cod sursa (job #1977001) | Cod sursa (job #2907578)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[101][101];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fin >> 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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) && i != j)
a[i][j] = a[i][k] + a[k][j];
for (int i = 1; i <= n; i++) {
fout << "\n";
for (int j = 1; j <= n; j++)
fout << a[i][j] << " ";
}
return 0;
}