Pagini recente » Cod sursa (job #2556706) | Cod sursa (job #734456) | Monitorul de evaluare | Cod sursa (job #263228) | Cod sursa (job #1218771)
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
int n, c[101][101];
int main() {
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
cin >> c[i][j];
if (c[i][j] == 0) {
c[i][j] = 0xffffff;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= n; k++)
if (i != j && i != k && k != j) {
c[i][j] = min(c[i][j], c[i][k] + c[k][j]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (c[i][j] == 0xffffff) {
c[i][j] = 0;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << c[i][j] << " ";
}
cout << "\n";
}
return 0;
}