Pagini recente » Cod sursa (job #3278541) | Cod sursa (job #368634) | Rating reus adriana (adrianaqt) | Cod sursa (job #1849551) | Cod sursa (job #156234)
Cod sursa(job #156234)
#include <stdio.h>
#define nmax 105
int n, i, j, k;
int a[nmax][nmax], v[nmax][nmax];
inline int min(int a, int b)
{
if(a > b) return b;
else return a;
}
int main()
{
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", &a[i][j]);
v[i][j] = a[i][j];
if(a[i][j] == 0) a[i][j] = 10000;
}
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]);
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
if(v[i][j] == 0) a[i][j] = 0;
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}