Pagini recente » Cod sursa (job #2289666) | Cod sursa (job #421488) | Cod sursa (job #215828) | Cod sursa (job #424921) | Cod sursa (job #2600736)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N;
int D[105][105];
int main()
{
fin >> N;
int i,j;
for (i=1;i<=N;++i)
{
for (j=1;j<=N;++j)
{
fin >> D[i][j];
}
}
int k;
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] && i!=k && j!=k)
{
D[i][j]=D[i][k]+D[k][j];
}
}
}
}
for (i=1;i<=N;++i)
{
for (j=1;j<=N;++j)
{
fout << D[i][j] << " ";
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}