Pagini recente » Cod sursa (job #2683893) | Cod sursa (job #2422092) | Cod sursa (job #2254952) | Cod sursa (job #2872220) | Cod sursa (job #1616070)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, i, j, k;
int M[101][101];
int main()
{
fin>>n;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
fin>>M[i][j];
}
}
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
if (M[i][j]>M[i][k]+M[k][j])
{
M[i][j]=M[i][k]+M[k][j];
}
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
fout<<M[i][j]<<" ";
}
fout<<'\n';
}
return 0;
}