Pagini recente » Cod sursa (job #2382738) | Cod sursa (job #1248009) | Cod sursa (job #2850924) | Cod sursa (job #1865048) | Cod sursa (job #2180963)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i, j, n,d[101][101], sol[101][101],h;
int main()
{
fin>>n;
for(i=1;i<=n;i++) for(j=1;j<=n;j++) fin>>d[i][j];
for(i=1;i<=n;i++) for(j=1;j<=n;j++)
{
sol[i][j]=10000000;
if(d[i][j]!=0)
sol[i][j]=d[i][j];
}
for(h=1;h<=n;h++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i!=j&&j!=h&&h!=i&&sol[i][h]!=0&&sol[h][j]!=0)
sol[i][j]=min(sol[i][j], sol[i][h]+sol[h][j]);
}
for(i=1;i<=n;i++){for(j=1;j<=n;j++)
if(sol[i][j]!=10000000)
fout<<sol[i][j]<<" ";
else
fout<<"0 ";
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}