Pagini recente » Rating Pantiruc Andreia (pantirucandreia) | Cod sursa (job #622732) | Cod sursa (job #2148725) | Cod sursa (job #2794831) | Cod sursa (job #1581958)
#include<stdio.h>
using namespace std;
const int N = 105, LIM = 1000*105;
int d[N][N];
void init (int n)
{
int i, j;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (d[i][j] == 0)
d[i][j] = LIM;
for (i = 1; i <= n; i++)
d[i][i] = 0;
}
void roy (int n)
{
int i, j, k;
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];
}
int main ()
{
FILE *in, *out;
in = fopen ("royfloyd.in", "r");
out = fopen ("royfloyd.out", "w");
int n;
fscanf (in, "%d", &n);
int i, j;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fscanf (in, "%d", &d[i][j]);
init (n);
roy (n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fprintf (out, "%d ", d[i][j]);
fprintf (out, "\n");
}
return 0;
}