Pagini recente » Cod sursa (job #131619) | Cod sursa (job #2354737) | Cod sursa (job #2289349) | Cod sursa (job #1892319) | Cod sursa (job #1918562)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int maxn = 105;
int G[maxn][maxn];
int main() {
ios_base :: sync_with_stdio (false);
int n, i, j, k;
fin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
fin >> G[i][j];
}
}
for (k = 1; k <= n; k++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if ((G[i][k] + G[k][j] < G[i][j] || G[i][j] == 0) && i != j && G[i][k] && G[k][j]) {
G[i][j] = G[i][k] + G[k][j];
}
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
fout << G[i][j] << " ";
}
fout << "\n";
}
return 0;
}