Pagini recente » Cod sursa (job #326682) | Cod sursa (job #1461439) | infoarena - te ajutam sa devii olimpic! | Cod sursa (job #2243145) | Cod sursa (job #158101)
Cod sursa(job #158101)
#include <stdio.h>
#define MAXN 101
int v[MAXN][MAXN],n;
void leeroyjenkins()
{
int i,j,k;
for (k=0; k<n; k++)
for (i=0; i<n; i++)
for (j=0; j<n; j++)
if (v[i][k] && v[k][j] && (v[i][k]+v[k][j]<v[i][j] || !v[i][j]) && i!=j)
v[i][j]=v[i][k]+v[k][j];
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int i,j;
scanf("%d",&n);
for (i=0; i<n; i++)
for (j=0; j<n; j++)
scanf("%d",&v[i][j]);
leeroyjenkins();
for (i=0; i<n; i++)
{
for (j=0; j<n-1; j++)
printf("%d ",v[i][j]);
printf("%d\n",v[i][n-1]);
}
fclose(stdin);
fclose(stdout);
return 0;
}