Pagini recente » Cod sursa (job #485369) | Cod sursa (job #2818408) | Borderou de evaluare (job #232502) | Cod sursa (job #2662323) | Cod sursa (job #3247503)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e3;
const int INF = 1e9;
int c[NMAX + 1][NMAX + 1];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main() {
int n;
f >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
f >> c[i][j];
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(c[i][j] == 0) {
c[i][j] = INF;
}
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(i != j && c[i][j] > c[i][k] + c[k][j]) {
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] == INF) {
c[i][j] = 0;
}
g << c[i][j] << ' ';
}
g << '\n';
}
return 0;
}