Pagini recente » Cod sursa (job #3249630) | Cod sursa (job #2481735) | Cod sursa (job #281261) | Cod sursa (job #2821618) | Cod sursa (job #3198950)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
const int NMAX = 101;
const int INF = 100005;
int main()
{
int n, m[NMAX][NMAX];
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> m[i][j];
if (m[i][j] == 0 && i != j)
m[i][j] = INF;
}
}
for (int k = 1; k <= n; k++) {
for(int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int drum = m[i][k] + m[k][j];
if (i != k && j != k && i != j && drum < m[i][j])
m[i][j] = drum;
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << m[i][j] << " ";
}
cout << "\n";
}
return 0;
}