Pagini recente » Cod sursa (job #1407566) | Monitorul de evaluare | Cod sursa (job #1883745) | Cod sursa (job #823747) | Cod sursa (job #771828)
Cod sursa(job #771828)
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[110][110];
int main()
{
int i,j,k;
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]);
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&i!=k&&j!=k) 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++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}