Pagini recente » Cod sursa (job #494638) | Cod sursa (job #2932967) | Cod sursa (job #2407169) | Cod sursa (job #82077) | Cod sursa (job #2794929)
#include <fstream>
//#include <iostream>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
long long n,i,j,k,a[260][260],d[260][260],nr;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
cin>>a[i][j];
d[i][j]=a[i][j];
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
for(k=1;k<=n;k++)
{
if(a[i][j]!=0 && i!=j && d[i][k]!=0 && d[k][j]!=0 && d[i][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
cout<<d[i][j]<<' ';
}
cout<<'\n';
}
return 0;
}