Pagini recente » Cod sursa (job #2574870) | Cod sursa (job #2642877) | Cod sursa (job #2463084) | Cod sursa (job #1695000) | Cod sursa (job #3234352)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int inf = 1e7 + 2;
int n, i, j, k, d[102][102];
int main() {
fin >> n;
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
fin >> d[i][j];
if(i == j) d[i][j] = inf;
}
}
for(k = 1; k <= n; k++) {
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
if(i != j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
if(d[i][j] == inf) fout << "0 ";
else fout << d[i][j] << " ";
}
fout << "\n";
}
return 0;
}