Pagini recente » Cod sursa (job #2375158) | Cod sursa (job #1650817) | Statistici Not Available (iacovlad) | Cod sursa (job #1383404) | Cod sursa (job #462178)
Cod sursa(job #462178)
#include <cstdio>
int mat[105][105],n;
inline int minim(int a,int b) {
if(a>b) return b;
else return a;
}
void floyd_warshall() {
int i,j,k;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
for(k=1; k<=n; k++)
mat[j][k]=minim(mat[j][k],mat[i][k]+mat[j][i]);
}
int main() {
int i,j;
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",&mat[i][j]);
floyd_warshall();
for(i=1; i<=n; i++) {
for(j=1; j<=n; j++) printf("%d ",mat[i][j]);
printf("\n");
}
return 0;
}