Pagini recente » Cod sursa (job #2217908) | Cod sursa (job #1847927) | Cod sursa (job #1738934) | Cod sursa (job #2232488) | Cod sursa (job #904152)
Cod sursa(job #904152)
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*s;
int i,j,k,n;
int v[105][105];
int main()
{
f=fopen("royfloyd.in","r");
s=fopen("royfloyd.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fscanf(f,"%d",&v[i][j]);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(v[i][k] && v[k][j] && v[i][k]+v[k][j]<v[i][j])
v[i][j]=v[i][k]+v[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fprintf(s,"%d ",v[i][j]);
fprintf(s,"\n");
}
fclose(s);
return 0;
}