Pagini recente » Cod sursa (job #2496627) | Cod sursa (job #2278483) | Cod sursa (job #984264) | Cod sursa (job #2179876) | Cod sursa (job #2218277)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2;
const int INF = 0x3f3f3f3f;
int mat[MAXN][MAXN];
int main() {
int n;
ifstream fin("royfloyd.in");
fin >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
fin >> mat[i][j];
if (mat[i][j] == 0)
mat[i][j] = INF;
if (i == j)
mat[i][j] = 0;
}
fin.close();
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if ((i ^ j) && mat[i][k] + mat[k][j] < mat[i][j])
mat[i][j] = mat[i][k] + mat[k][j];
ofstream fout("royfloyd.out");
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (mat[i][j] == INF)
mat[i][j] = 0;
fout << mat[i][j] << " ";
}
fout << '\n';
}
fout.close();
return 0;
}