Pagini recente » Cod sursa (job #1339683) | Istoria paginii runda/cei_mici4/clasament | Cod sursa (job #2523987) | Cod sursa (job #1041281) | Cod sursa (job #1492986)
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *input = fopen("royfloyd.in", "r");
FILE *output = fopen("royfloyd.out", "w");
int n;
int **matrix;
fscanf(input, "%d", &n);
matrix = (int**)malloc(n*sizeof(int*));
for (int i = 0; i < n; i++)
matrix[i] = (int*)malloc(n*sizeof(int));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fscanf(input, "%d", &matrix[i][j]);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
for (int k = 0; k < n; k++)
{
if (i != j)
{
if (matrix[i][k] != 0 && matrix[k][j] != 0)
{
if (matrix[i][j] != 0)
{
if (matrix[i][k] + matrix[k][j] < matrix[i][j])
{
matrix[i][j] = matrix[i][k] + matrix[k][j];
//matrix[j][i] = matrix[j][i];
}
}
else
{
matrix[i][j] = matrix[i][k] + matrix[k][j];
//matrix[j][i] = matrix[i][j];
}
}
}
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
fprintf(output, "%d ", matrix[i][j]);
fprintf(output, "\n");
}
return 0;
}