Pagini recente » Cod sursa (job #1841957) | Cod sursa (job #1360511) | Cod sursa (job #627708) | Cod sursa (job #109526) | Cod sursa (job #840221)
Cod sursa(job #840221)
#include <cstdlib>
#include <cstdio>
#include <limits>
#include <iostream>
using namespace std;
int maxim = 1000*100*100;
int main()
{
int n;
freopen("royfloyd.in", "rt", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> n;
int a[n + 1][n + 1];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
cin >> a[i][j];
if (a[i][j] == 0) {
a[i][j] = maxim;
}
}
}
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] && 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) {
if (a[i][j] == maxim) {
a[i][j] = 0;
}
cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}