Pagini recente » Cod sursa (job #1450875) | Cod sursa (job #2516282) | Borderou de evaluare (job #3228889) | Cod sursa (job #439787) | Cod sursa (job #2638492)
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
///**********************
const int NMAX = 103;
int n, a[NMAX][NMAX];
void read() {
fin >> n;
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;
}