Pagini recente » Cod sursa (job #2949467) | Cod sursa (job #2204309) | Cod sursa (job #2305472) | Cod sursa (job #2788704) | Cod sursa (job #236639)
Cod sursa(job #236639)
#include <stdio.h>
long a[110][110],n;
void citire()
{
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%ld",&a[i][j]);
}
void solve()
{int i,j,k;
long s;
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if (i!=j) if (i!=k) if(k!=j) {
s = a[i][k] + a[k][j];
if (a[i][j] > s) a[i][j] = s;
}
for(i=0;i<n;i++)
{
for(j=0;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;}