Cod sursa(job #2154715)
| Utilizator | Data | 7 martie 2018 10:52:35 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <cstdio>
#define INF 2000000000
using namespace std;
int a[102][102];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n,i,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
//if(!a[i][j])
//a[i][j]=INF;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j]||(!a[i][j]&&i!=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");}
return 0;
}
