Pagini recente » Cod sursa (job #259975) | Cod sursa (job #2171327) | Cod sursa (job #2807152) | Cod sursa (job #2259360) | Cod sursa (job #148585)
Cod sursa(job #148585)
#include <iostream>
using namespace std;
#define INF 1000000000
#define MAXN 128
int N;
int C[MAXN][MAXN];
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> N;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
cin >> C[i][j];
C[i][j] = C[i][j] || i == j ? C[i][j] : INF;
}
for (int k = 0; k < N; ++k)
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
C[i][j] = min(C[i][j], C[i][k] + C[k][j]);
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j)
cout << C[i][j] << ' ';
cout << '\n';
}
}