Pagini recente » Cod sursa (job #1544334) | Cod sursa (job #237508) | Cod sursa (job #1616524) | Cod sursa (job #2974331) | Cod sursa (job #2338769)
#include <fstream>
#include <string.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int MAXN = 100;
int g[MAXN + 1][MAXN + 1];
int d[MAXN + 1][MAXN + 1];
int n;
int main() {
memset(d, 0x3f3f3f3f, sizeof(d));
in >> n;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
in >> g[i][j];
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
for (int k = 1; k <= n; ++ k) {
d[i][k] = min(d[i][k], g[i][j] + g[j][k]);
}
}
}
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= n; ++ j) {
out << d[i][j] << ' ';
}
out << '\n';
}
return 0;
}