Pagini recente » Cod sursa (job #2481552) | Cod sursa (job #3037932) | Istoria paginii utilizator/ericutzdevil | Diferente pentru monthly-2012/runda-9/solutii intre reviziile 19 si 28 | Cod sursa (job #2794953)
#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(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i!=j && d[i][k]!=0 && d[k][j]!=0 && (d[i][j]>d[i][k]+d[k][j] || d[i][j]==0))
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;
}