Pagini recente » Cod sursa (job #2013700) | Cod sursa (job #2347749) | Cod sursa (job #79744) | Cod sursa (job #624840) | Cod sursa (job #1091016)
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
const int N = 105;
int n;
int a[N][N];
void roy()
{
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
in >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
in >> a[i][j];
}
}
roy();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
out << a[i][j] << " ";
}
out << "\n";
}
return 0;
}