Pagini recente » Cod sursa (job #1897278) | Cod sursa (job #990036) | Cod sursa (job #2493667) | Cod sursa (job #2394918) | Cod sursa (job #2755446)
#include <stdio.h>
#include <stdlib.h>
#define N 100
#define INF 1e6
int d[N+1][N+1];
int main()
{
FILE *in, *out;
in = fopen("royfloyd.in", "r");
out = fopen("royfloyd.out", "w");
int n, i, j, k;
fscanf(in, "%d", &n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
fscanf(in, "%d", &d[i][j]);
if (i != j && d[i][j] == 0)
{
d[i][j] = INF;
}
//pred[i][j] = i;
}
}
fclose(in);
for (k = 1; k <= n; k++)
{
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (d[i][k] + d[k][j] < d[i][j])
{
d[i][j] = d[i][k] + d[k][j];
//pred[i][j] = pred[k][j];
}
}
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i != j && d[i][j] == INF)
{
d[i][j] = 0;
}
fprintf(out, "%d ", d[i][j]);
}
fprintf(out, "\n");
}
fclose(out);
return 0;
}