Cod sursa(job #167189)
| Utilizator | Data | 29 martie 2008 10:13:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.04 kb |
#include <cstdio>
#define Nmax 101
int n,a[Nmax][Nmax];
void floyd()
{
int i, j, k;
for (k = 0; k < n; k++)
for (i = 0; i < n; i++)
for (j = 0; 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=0; i<n; i++)
{
for(int j=0 ;j<n; j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i=0; i<=n; i++)
for(int j=0; j<n; j++)
scanf("%d",a[i] + j);
floyd();
return 0;
}
