Pagini recente » Monitorul de evaluare | Cod sursa (job #999703) | Cod sursa (job #902474) | Cod sursa (job #2333162) | Cod sursa (job #3303540)
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[101][101];
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> d[i][j];
if (d[i][j] == 0 && i != j)
{
d[i][j] = INT_MAX;
}
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
d[i][j]=min(d[k][j]+d[i][k],d[i][j]);
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<d[i][j]<<" ";
}
fout<<'\n';
}
}