Pagini recente » Cod sursa (job #2515260) | Cod sursa (job #44052) | Cod sursa (job #1545607) | Cod sursa (job #2630139) | Cod sursa (job #2534281)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int M[105][105];
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
fin >> M[i][j];
}
}
for (int k = 1; k <= n; k ++) {
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
if (M[i][j] > M[i][k] + M[k][j]) {
M[i][j] = M[i][k] + M[k][j];
}
}
}
}
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) fout << M[i][j] << " ";
fout << "\n";
}
return 0;
}