Pagini recente » Monitorul de evaluare | Arhiva de probleme | Arhiva de probleme | Arhiva de probleme | Cod sursa (job #527056)
Cod sursa(job #527056)
#include<cstdio>
using namespace std;
int n,i,j,k,v[120][120];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
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",&v[i][j]);
}
void solve()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j)continue;
if(v[i][k]&&v[k][j])
if(!v[i][j])
v[i][j]=v[i][k]+v[k][j];
else
v[i][j]=(v[i][j]<v[i][k]+v[k][j])?v[i][j]:v[i][k]+v[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%d ",v[i][j]);
printf("\n");
}
}