Pagini recente » Cod sursa (job #1790119) | Cod sursa (job #2035330) | Cod sursa (job #338596) | Cod sursa (job #1065486) | Cod sursa (job #2777356)
#include <iostream>
#include <fstream>
#define NMAX 105
#define INF 999999999
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int gr[NMAX][NMAX], N;
int d[NMAX][NMAX][NMAX];
void read() {
fin >> N;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
fin >> d[i][j][0];
}
}
}
void royfloyd() {
for (int k = 1; k <= N; ++k) {
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
if (d[i][k][k - 1] && d[k][j][k - 1]) {
d[i][j][k] = min(d[i][j][k - 1], d[i][k][k - 1] + d[k][j][k - 1]);
}
else {
d[i][j][k] = d[i][j][k - 1];
}
}
}
}
}
int main()
{
read();
royfloyd();
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
fout << d[i][j][N] << " ";
}
fout << "\n";
}
return 0;
}