Pagini recente » Cod sursa (job #453212) | Cod sursa (job #2924472) | Cod sursa (job #3137317) | Cod sursa (job #3193611) | Cod sursa (job #3159229)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[100][100];
int dist[100][100];
int main() {
fin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
fin >> a[i][j];
dist[i][j] = a[i][j];
}
}
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][k] && a[j][k]) {
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
fout << dist[i][j] << " ";
}
fout << "\n";
}
}