Pagini recente » Cod sursa (job #2426984) | Cod sursa (job #72838) | Monitorul de evaluare | Cod sursa (job #3277009) | Cod sursa (job #642067)
Cod sursa(job #642067)
#include<fstream>
using namespace std;
int d[1010][1010];
int main()
{
int i, n, j, k, l, m;
ifstream f("royfloyd.in");
ofstream h("royfloyd.out");
f>>n;
for (l=1; l<=n; l++)
for (m=1; m<=n; m++)
{
f>>d[l][m];
if (d[l][m]==0 && l!=m)
d[l][m]=0x3f3f3f3f;
}
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (d[i][k]+d[k][j]<d[i][j])
d[i][j]=d[i][k]+d[k][j];
for (l=1; l<=n; l++)
{ for (m=1; m<=n; m++)
{
if (d[l][m]==0x3f3f3f3f)
h<<"0 ";
else
h<<d[l][m]<<" ";
}
h<<'\n';
}
f.close();
h.close();
return 0;
}