Pagini recente » Cod sursa (job #1661667) | Cod sursa (job #1401680) | Cod sursa (job #54975) | Cod sursa (job #857951) | Cod sursa (job #355803)
Cod sursa(job #355803)
#include<stdio.h>
#define dim 150
long long int a[dim][dim];
int n,i,k,m,j;
void read()
{
scanf("%lld",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%lld",&a[i][j]);
}
void afis()
{
for(i=1;i<=n;i++,printf("\n"))
for(k=1;k<=n;k++)
printf("%lld ",a[i][k]);
}
void solve()
{
int i,j,k;
for(i=1;i<=n;i++)
for(k=1;k<=n;k++)
for(j=1;j<=n;j++)
{
if(a[k][i] && a[i][j] && ( a[k][j] > a[k][j]+a[i][j] || !a[i][j] ))
a[k][j] > a[k][j]+a[i][j];
}
afis();
}
int main ()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
solve();
return 0;
}