Cod sursa(job #1989908)
| Utilizator | Data | 9 iunie 2017 15:27:43 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<cstdio>
const int nmax=105;
int a[105][105];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int x,y,n,i,k,j;
scanf("%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
scanf("%d",&a[i][j]);
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(i!=j&&a[i][k]&&a[k][j]&&(a[i][j]==0||a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
printf("%d ",a[i][j]);
printf("\n");
}
}
