Pagini recente » Cod sursa (job #2424718) | Cod sursa (job #907294) | Cod sursa (job #766801) | Cod sursa (job #1547152) | Cod sursa (job #407877)
Cod sursa(job #407877)
#include<stdio.h>
FILE *f=fopen("royfloyd.in","r");
FILE *g=fopen("royfloyd.out","w");
#define M 101
int a[M][M],n,b[M][M];
void cit()
{
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]);
fclose(f);
}
void afis()
{
int i,j;
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
fprintf(g,"%d ",a[i][j]);
fprintf(g,"\n");
}
fclose(g);
}
int minim(int x, int y)
{
if(x>y) return y;
else return x;
}
void roy()
{
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 && i!=k && j!=k ) a[i][j]=minim(a[i][j],a[i][k]+a[k][j]);
}
int main()
{
cit();
roy();
afis();
return 0;
}