Pagini recente » Cod sursa (job #1522722) | Cod sursa (job #2878260) | Cod sursa (job #2507709) | Cod sursa (job #925874) | Cod sursa (job #2638490)
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
///**********************
const int NMAX = 103;
int n, m;
int a[NMAX][NMAX];
void read() {
fin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
fin >> a[i][j];
}
void solve() {
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] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
}
void display() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << newline;
}
}
int main() {
read();
solve();
display();
fout.close();
return 0;
}