Pagini recente » Cod sursa (job #2417406) | Cod sursa (job #1380278) | Cod sursa (job #2417400) | Cod sursa (job #2417335) | Cod sursa (job #2417392)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
const int Inf = 1e9 + 5;
int a[505][505];
int n;
int main() {
f >> n;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
f >> 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] == 0 || a[k][j] == 0 || i == j)
continue;
if (a[i][j] == 0 || (a[i][k] + a[k][j] < a[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) {
g << a[i][j] << " ";
}
g << '\n';
}
return 0;
}