Pagini recente » Cod sursa (job #2392305) | Cod sursa (job #153226) | Cod sursa (job #3042196) | Cod sursa (job #2331267) | Cod sursa (job #1415025)
#include <stdio.h>
#define N 100
void use_node(int k, int n, int a[][N])
{
int i, j;
for(i = 0; i < n; i++)
for(j = 0; j < n; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
int main(void)
{
int a[N][N];
int i, j, k;
int n;
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", &a[i][j]);
for(k = 0; k < n; k++)
use_node(k, n, a);
for(i = 0; i < n; i++)
{
for(j = 0; j < n; j++)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}