Pagini recente » Cod sursa (job #3254037) | Cod sursa (job #1497105) | Cod sursa (job #986944) | Cod sursa (job #2913053) | Cod sursa (job #1681498)
#include <bits/stdc++.h>
#define maxN 105
using namespace std;
int a[maxN][maxN];
int n,i,j,k;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d\n", &n);
for(i=1; i <= n; i++)
for(j=1; j <= n; j++)
scanf("%d", &a[i][j]);
for(k=1; k <= n; k++)
for(i=1; i <= n; i++)
for(j=1; j <= n; j++)
if(i != j)
if(a[i][k] && a[k][j] &&(a[i][k]+a[k][j] < a[i][j] || !a[i][j]))
a[i][j]=a[i][k]+a[k][j];
for(i=1; i <= n; i++, printf("\n"))
for(j=1; j <= n; j++)
printf("%d ", a[i][j]);
return 0;
}