Pagini recente » Cod sursa (job #1011348) | Cod sursa (job #918871) | Cod sursa (job #2222347) | Cod sursa (job #1098035) | Cod sursa (job #2701128)
#include <fstream>
#include <climits>
#include <iostream>
using namespace std;
int a[101][101];
#define Inf LONG_MAX
int main() {
int n, i, j, k;
ifstream f("royfloyd.in");
f >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
f >> a[i][j];
if (i == j)
a[i][j] = 0;
else if (a[i][j] <= 0)
a[i][j] = Inf;
}
f.close();
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
ofstream g("royfloyd.out");
for (i = 1; i <= n; i++, g << '\n')
for (j = 1; j <= n; j++)
if (a[i][j] == Inf)
g << 0 << ' ';
else
g << a[i][j] << ' ';
g.close();
return 0;
}