Pagini recente » Cod sursa (job #1459652) | Cod sursa (job #2677819) | Cod sursa (job #2581352) | Cod sursa (job #1419447) | Cod sursa (job #861397)
Cod sursa(job #861397)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,x[101][101],i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>x[i][j];
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(i!=j&&i!=k&&j!=k&&x[i][k]!=0&&x[k][j]!=0)
if(x[i][j]==0)
x[i][j]=x[i][k]+x[k][j];
else
x[i][j]=min(x[i][j],x[i][k]+x[k][j]);
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
g<<x[i][j]<<' ';
g<<'\n';
}
g.close();
return 0;
}