Pagini recente » Cod sursa (job #1485019) | Cod sursa (job #1421925) | Cod sursa (job #2192949) | Cod sursa (job #1777888) | Cod sursa (job #3243008)
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in"); ofstream out ("royfloyd.out");
int n, a[105][105];
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++){
in >> a[i][j];
if(a[i][j] == 0 && i != j) a[i][j] = INT_MAX; /* */
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][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];
*/
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) out << a[i][j] << " ";
out << '\n';
}
return 0;
}