Pagini recente » Cod sursa (job #2391039) | Cod sursa (job #42507) | Cod sursa (job #1638000) | Cod sursa (job #1378211) | Cod sursa (job #556015)
Cod sursa(job #556015)
#include<stdio.h>
#define chestie "royfloyd.in"
#define alta_chestie "royfloyd.out"
#define N 101
int n;
int a[N][N];
void eu_citesc_cu_greu()
{
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void eu_ma_chinui()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k] + a[k][j] < a[i][j])
a[i][j] = a[i][k] + a[k][j];
}
void finaly_eu_afisez_nu_fara_dificultati()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen(chestie,"r",stdin);
freopen(alta_chestie,"w",stdout);
eu_citesc_cu_greu();
eu_ma_chinui();
finaly_eu_afisez_nu_fara_dificultati();
return 0;
}