Pagini recente » Cod sursa (job #1479774) | Cod sursa (job #1507458) | Cod sursa (job #1507453) | Cod sursa (job #1790293) | Cod sursa (job #2337037)
#include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
int a[2][102][102];
void roy(int n)
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[k%2][i][j]=min(a[(k-1)%2][i][j],a[(k-1)%2][i][k]+a[(k-1)%2][k][j]);
}
int main()
{
int i,j,n;
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[0][i][j]);
roy(n);
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
printf("%d ",a[n%2][i][j]);
printf("\n");
}
return 0;
}