Cod sursa(job #708758)
Utilizator | Data | 7 martie 2012 10:06:59 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#define NMax 121
long a[NMax][NMax],n;
int main()
{
for(long i=1;i<=n;i++)
for(long j=1;j<=n;j++)
scanf("%ld",&a[i][j]);
for(long i=1;i<=n;i++)
for(long j=1;j<=n;j++)
for(long k=1;k<=n;k++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(long i=1;i<=n;i++)
{
for(long j=1;j<=n;j++)
printf("%ld ",a[i][j]);
printf("\n");
}
return 0;
}