Cod sursa(job #143773)
Utilizator | Mircea Dima blasterz | Data | 26 februarie 2008 20:49:46 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
int a[101][101],n;
inline int min(int a, int b)
{
if(a<b) return a;
return b;
}
int main()
{
int i, j,k;
freopen("royfloyd.in","r",stdin);
scanf("%d\n", &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)
a[i][j]=min(a[i][j], a[i][k]+a[k][j]);
freopen("royfloyd.out","w",stdout);
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}