Pagini recente » Cod sursa (job #1933185) | Cod sursa (job #2937279) | Cod sursa (job #741932) | Cod sursa (job #2454376) | Cod sursa (job #1376433)
#include <cstdio>
using namespace std;
const int MAXN = 102;
int d[MAXN][MAXN];
int main()
{
FILE *in = fopen("royfloyd.in", "r");
FILE *out = fopen("royfloyd.out", "w");
int n;
fscanf(in, "%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
fscanf(in, "%d", &d[i][j]);
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
if (d[i][k])
for (int j = 1; j <= n; j++)
if (d[k][j] && i != j)
{
if (d[i][j] == 0)
d[i][j] = d[i][k] + d[k][j];
else
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fprintf(out, "%d ", d[i][j]);
fprintf(out, "\n");
}
return 0;
}