Pagini recente » Cod sursa (job #1237095) | Cod sursa (job #1301322) | Cod sursa (job #1388425) | Cod sursa (job #603235) | Cod sursa (job #2139899)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, d[101][101];
const int INF=100000;
int main()
{
in >> n ;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
{
in>>d[i][j];
if (i!=j&&d[i][j]==0) d[i][j]=INF;
}
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (d[i][k]!=INF&&d[k][j]!=INF&&i!=k&&k!=j&&i!=j&&(d[i][k]+d[k][j]<d[i][j]))
d[i][j]=d[i][k]+d[k][j];
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
out<<d[i][j]<<" ";
out<<'\n';
}
return 0;
}