Pagini recente » Cod sursa (job #1225591) | Cod sursa (job #1814258) | Cod sursa (job #725802) | Cod sursa (job #227057) | Cod sursa (job #217488)
Cod sursa(job #217488)
#include<stdio.h>
#define nmax 101
int a[nmax][nmax],n;
void RW()
{
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if ((a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j && a[i][k] && a[k][j] )
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
FILE *f=fopen("royfloyd.in","r"),*g=fopen("royfloyd.out","w");
fscanf(f,"%i",&n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
fscanf(f,"%i",&a[i][j]);
RW();
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
fprintf(g,"%i ",a[i][j]);
fprintf(g,"\n");
}
return 0;
}