Pagini recente » Cod sursa (job #793384) | Cod sursa (job #2357424) | Cod sursa (job #1385848) | Cod sursa (job #1956471) | Cod sursa (job #396053)
Cod sursa(job #396053)
#include <stdio.h>
#define INFINIT 1000000000
#define N 100
int c[N + 1][N + 1], n;
void citeste()
{
FILE* fi = fopen("royfloyd.in", "r");
int i, j, x;
fscanf(fi, "%d", &n);
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
fscanf(fi, "%d", &x);
c[i][j] = (x ? x : INFINIT);
}
}
fclose(fi);
}
void fw()
{
int i, j, k;
for(k = 1; k <= n; ++k)
{
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
if(i == j || k == i || k == j) continue;
if(c[i][j] > c[i][k] + c[k][j])
c[i][j] = c[i][k] + c[k][j];
}
}
}
}
void scrie()
{
FILE* fo = fopen("royfloyd.out", "w");
int i, j;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
fprintf(fo, "%d ", c[i][j] == INFINIT ? 0 : c[i][j]);
}
fprintf(fo, "\n");
}
fclose(fo);
}
int main()
{
citeste();
fw();
scrie();
return 0;
}