Pagini recente » Cod sursa (job #2231541) | Cod sursa (job #1173021) | Cod sursa (job #2710601) | Cod sursa (job #2707471) | Cod sursa (job #269335)
Cod sursa(job #269335)
#include<stdio.h>
int n;
int v[260][260];//v[260][260];
int sol[26][26];//sol[260][260];
void floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][k] && v[k][j] && i!=j && ((v[i][j]>v[i][k]+v[k][j]) || v[i][j]==0))
{
v[i][j]=v[i][k]+v[k][j];
sol[i][j]=1;
}
else
if(v[i][j]==v[i][k]+v[k][j])
sol[i][j]++;
}
void read()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&v[i][j]);
floyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",v[i][j]);
printf("\n");
}
/*
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",s[i]);
printf("\n");
}
*/
}
int main()
{
read();
return 0;
}