Pagini recente » Cod sursa (job #3174675) | Cod sursa (job #465196) | Cod sursa (job #288920) | Cod sursa (job #272520) | Cod sursa (job #1756934)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[104][104],n;
void read()
{
int i,j;
fin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
fin>>d[i][j];
}
int main()
{
int i,j,k;
read();
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]>d[i][k]+d[k][j] || !d[i][j]) && i!=j) 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';
}
}