Pagini recente » Cod sursa (job #2699374) | Cod sursa (job #2152233) | Cod sursa (job #629596) | Cod sursa (job #2723033) | Cod sursa (job #2168217)
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[101][101];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
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=1;i<=n;++i){
for(int j=1;j<=n;++j){
printf ("%d ",a[i][j]);
}
printf("\n");
}
}