Pagini recente » Cod sursa (job #2347505) | Cod sursa (job #157623) | Cod sursa (job #326774) | Cod sursa (job #2092388) | Cod sursa (job #2557559)
#include <fstream>
#define N 102
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int dr[N][N];
int main()
{
int n;
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>dr[i][j];
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(dr[i][k] && dr[k][j] && i!=k && j!=k && dr[i][k]+dr[k][j]<dr[i][j])
dr[i][j]=dr[i][k]+dr[k][j];
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
g<<dr[i][j]<<' ';
g<<'\n';
}
f.close();
g.close();
return 0;
}