Pagini recente » Cod sursa (job #298009) | Cod sursa (job #155939) | Cod sursa (job #2032026) | Cod sursa (job #589787) | Cod sursa (job #1809331)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");
int n, nod[101][101], veri[101][101];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>nod[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(nod[i][j]>nod[i][k]+nod[k][j] and i!=j)
nod[i][j]=nod[i][k]+nod[k][j];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<nod[i][j]<<' ';
fout<<'\n';
}
return 0;
}