Pagini recente » Cod sursa (job #2752110) | Cod sursa (job #1896139) | Cod sursa (job #894310) | Cod sursa (job #543063) | Cod sursa (job #612894)
Cod sursa(job #612894)
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[128][128];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n;
scanf("%d",&n);
for (int i = 1 ; i <= n ; ++i)
for (int j = 1 ; j <= n ; ++j)
scanf("%d",&a[i][j]);
for (int k = 1 ; k <= n ; ++k)
for (int i = 1 ; i <= n ; ++i)
for (int j = 1; j <= n ; ++j)
a[i][j] = min(a[i][j],a[i][k] + a[k][j]);
for (int i = 0 ; i < n ; ++i)
{
for (int j = 0 ; j < n ; ++j)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}