Pagini recente » Cod sursa (job #914613) | Cod sursa (job #1398909) | Cod sursa (job #603576) | Cod sursa (job #2786280) | Cod sursa (job #2105553)
#include <iostream>
#include <fstream>
#define N 100
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int rf[N][N], n;
void roy_floyd() {
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (rf[i][j] > rf[i][k] + rf[k][j] && i != k && k != j)
rf[i][j] = rf[i][k] + rf[k][j];
}
}
}
}
int main() {
in >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
in >> rf[i][j];
}
roy_floyd();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
out << rf[i][j] << " ";
out << "\n";
}
return 0;
}