Cod sursa(job #2781068)
| Utilizator | Data | 8 octombrie 2021 13:38:44 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<cstdio>
#define I 1000000
int d[101][101],n,i,j,k;
int main()
{
freopen("royfloyd.in","r",stdin),freopen("royfloyd.out","w",stdout),scanf("%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j) {
scanf("%d",&d[i][j]);
if(!d[i][j])
d[i][j]=I;
}
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(d[i][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
for(i=1;i<=n;++i,printf("\n"))
for(j=1;j<=n;++j)
printf("%d ",(i==j||d[i][j]==I?0:d[i][j]));
return 0;
}
