Pagini recente » Cod sursa (job #2355044) | Cod sursa (job #713900) | Cod sursa (job #1415053) | Cod sursa (job #2227414) | Cod sursa (job #1391879)
#include <fstream>
#define INF 10000
using namespace std;
int n, a[105][105];
int main () {
int i, j, k;
ifstream in ("royfloyd.in");
in >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
in >> a[i][j];
if (!a[i][j] && i != j)
a[i][j] = INF;
}
in.close();
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][j] > a[i][k] + a[k][j] && a[i][k] && a[k][j])
a[i][j] = a[i][k] + a[k][j];
ofstream out ("royfloyd.out");
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
if (a[i][j] == INF)
out << 0 << ' ';
else out << a[i][j] << ' ';
out << '\n';
}
out.close ();
return 0;
}