Pagini recente » Cod sursa (job #2439192) | Cod sursa (job #2830743) | Cod sursa (job #501317) | Monitorul de evaluare | Cod sursa (job #2182732)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,x,c[101][101],i,j;
void royfloyd ()
{
int i,j,k;
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (c[i][k]+c[k][j]<c[i][j]&&i!=j)
{
c[i][j]=c[i][k]+c[k][j];
}
}
}
}
}
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
f>>x;
c[i][j]=x;
if (c[i][j]==0&&i!=j)
{
c[i][j]=INT_MAX;
}
}
}
royfloyd();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
g<<c[i][j]<<" ";
}
g<<'\n';
}
return 0;
}