Pagini recente » Cod sursa (job #319105) | Istoria paginii runda/eusebiuoji2016cls9/clasament | Cod sursa (job #1458811) | Cod sursa (job #1357794) | Cod sursa (job #2335713)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
unsigned d[101][101];
int main()
{
unsigned n;
fi>>n;
for(unsigned i=1;i<=n;i++)
for(unsigned j=1;j<=n;j++)
fi>>d[i][j];
for(unsigned k=1;k<=n;k++)
for(unsigned i=1;i<=n;i++)
for(unsigned j=1;j<=n;j++)
if((d[i][j]>d[i][k]+d[k][j]||!d[i][j])&&d[i][k]&&d[k][j]&&i!=j)
d[i][j]=d[i][k]+d[k][j];
for(unsigned i=1;i<=n;i++)
{for(unsigned j=1;j<=n;j++)
fo<<d[i][j]<<" ";
fo<<'\n';}
return 0;
}