Pagini recente » Cod sursa (job #1326144) | Cod sursa (job #3236141) | Cod sursa (job #1287413) | Clasament Summer Challenge 2009, Runda 2 | Cod sursa (job #832960)
Cod sursa(job #832960)
#include <stdio.h>
int M[100][100];
int i,j,k,n;
int main(int argc, char* argv[])
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&M[i][j]);
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++){
if( M[i][k] != 0 && M[k][j] != 0 &&
M[i][j] > (M[i][k] + M[k][j]) )
M[i][j] = M[i][k] + M[k][j];
}
for(i=0;i<n;i++){
for(j=0;j<n;j++)
printf("%d ",M[i][j]);
printf("\n");
}
return 0;
}