Pagini recente » Cod sursa (job #2290521) | Cod sursa (job #38926) | Cod sursa (job #852360) | Cod sursa (job #354103) | Cod sursa (job #2538171)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,k,n,d[105][105];
int main()
{
fin >> n;
for (i=1;i<=n;i++) for (j=1;j<=n;j++)
{
fin >> d[i][j];
if (i!=j && d[i][j]==0) d[i][j]=2000000005;
}
for (k=1;k<=n;k++) for (i=1;i<=n;i++) for (j=1;j<=n;j++) if (k!=i && k!=j && i!=j)
{
if (d[i][k]+d[k][j]<d[i][j]) d[i][j]=d[i][k]+d[k][j];
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (d[i][j]==2000000005) d[i][j]=0;
fout << d[i][j] << " ";
}
fout << "\n";
}
return 0;
}