Pagini recente » Borderou de evaluare (job #1305768) | Borderou de evaluare (job #2063070) | Borderou de evaluare (job #231993) | Cod sursa (job #2885927) | Cod sursa (job #198854)
Cod sursa(job #198854)
#include <stdio.h>
FILE *f,*g;
int n, a[105][105];
void royfloyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
f=fopen("royfloyd.in","r");
g=fopen("royfloyd.out","w");
int i, j;
fscanf(f,"%d",&n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fscanf(f,"%d",&a[i][j]);
royfloyd();
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
fprintf(f,"%d ",a[i][j]);
fprintf(f,"\n");
}
fcloseall();
return 0;
}