Pagini recente » Cod sursa (job #373456) | Cod sursa (job #2200766) | Cod sursa (job #1342663) | Cod sursa (job #2717040) | Cod sursa (job #486331)
Cod sursa(job #486331)
#include <stdio.h>
const int INF = 10000;
void olvas();
void royol();
void kiir();
long min(long,long);
int a[101][101],b[101][101];
int n;
int main()
{
olvas();
royol();
kiir();
return 0;
}
void olvas()
{
FILE *f = fopen("royfloyd.in","r");
fscanf(f,"%d",&n);
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
fscanf(f,"%d",&a[i][j]);
if (a[i][j] == 0) a[i][j] = INF;
if (i==j) a[i][i] = 0;
b[i][j] = a[i][j];
}
}
fclose(f);
return;
}
void kiir()
{
FILE *g = fopen("royfloyd.out","w");
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
fprintf(g,"%d ", b[i][j]);
}
fprintf(g,"\n");
}
fclose(g);
return;
}
void royol()
{
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
b[i][j] = min(b[i][j], b[i][k] + b[k][j]);
}
long min(long a, long b)
{
return (a<b)?(a):(b);
}