Pagini recente » Cod sursa (job #1503597) | Cod sursa (job #3000728) | Cod sursa (job #2612123) | Cod sursa (job #2424441) | Cod sursa (job #2698654)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[101][101], p[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])p[i][j] = i;
else
{
if(i!=j)d[i][j] = 1001;
}
}
}
for(int k=1; k<=n; ++k)
{
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
{
if(d[i][j]>d[i][k] + d[k][j] )
{
d[i][j] = d[i][k] + d[k][j];
p[i][j] = p[k][j];
}
}
}
}
for(int i =1; i<=n; ++i)
{
for(int j =1; j<=n; ++j)
{
if(d[i][j]==1001)fout<<0<<' ';
else fout<<d[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}