Pagini recente » Cod sursa (job #2167481) | Cod sursa (job #3176920) | Cod sursa (job #2683055) | Cod sursa (job #1078087) | Cod sursa (job #3286047)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int INF = 1e9;
const int NMAX = 1e2;
int d[NMAX + 1][NMAX + 1];
int main() {
int n;
f >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
d[i][j] = INF;
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
//f >> d[i][j];
int val;
f >> val;
if(i == j) {
d[i][i] = 0;
} else {
if(val != 0) {
d[i][j] = val;
}
}
}
}
for(int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(d[i][j] > d[i][k] + d[k][j]) {
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(d[i][j] == INF) {
g << 0 << ' ';
} else {
g << d[i][j] << ' ';
}
}
g << '\n';
}
return 0;
}