Pagini recente » Cod sursa (job #2021052) | Istoria paginii runda/lets_do_it/clasament | Monitorul de evaluare | Cod sursa (job #2221856) | Cod sursa (job #177506)
Cod sursa(job #177506)
#include <stdio.h>
#define N 101
int n,a[N][N];
int main()
{
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]);
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if (a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]|| !a[i][j])&&i!=j)
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}