Pagini recente » Cod sursa (job #2548091) | Cod sursa (job #1772680) | Cod sursa (job #362990) | Cod sursa (job #2055255) | Cod sursa (job #236645)
Cod sursa(job #236645)
#include <stdio.h>
long a[110][110],n;
void citire()
{
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%ld",&a[i][j]);
}
void solve()
{int i,j,k;
long s;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if((a[i][k]+a[k][j]<a[i][j] || a[i][j]==0) && a[i][k] && a[k][j] && i!=j)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%ld ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen ("royfloyd.in", "r", stdin);
freopen ("royfloyd.out", "w", stdout);
citire();
solve();
return 0;}