Pagini recente » Cod sursa (job #153551) | Cod sursa (job #176222) | Cod sursa (job #1048372) | Cod sursa (job #461087) | Cod sursa (job #177504)
Cod sursa(job #177504)
#include <stdio.h>
#define N 101
int n,a[N][N];
void scan()
{
freopen("royfloyd.in", "r",stdin);
freopen("royfloyd.out", "w",stdout);
scanf("%d", &n);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
scanf("%d", &a[i][j]);
}
void solve()
{
for(int ni=1;ni<=n;++ni)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if (a[i][ni] && a[ni][j] && a[i][ni] + a[ni][j] < a[i][j])
a[i][j]=a[i][ni]+a[ni][j];
}
void print()
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
scan();
solve();
print();
return 0;
}