Pagini recente » Cod sursa (job #1424804) | Monitorul de evaluare | Cod sursa (job #495464) | Cod sursa (job #1940048) | Cod sursa (job #2032809)
#include <cstdio>
using namespace std;
int m[105][105];
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",&m[i][j]);
if(i!=j&&m[i][j]==0)
m[i][j]=1000000000;
}
}
for(int k=1;k<=n;++k)
{
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
if(m[i][j]>m[i][k]+m[k][j])
m[i][j]=m[i][k]+m[k][j];
}
}
}
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j)
{
printf("%d ",m[i][j]);
}
printf("\n");
}
return 0;
}