Pagini recente » Cod sursa (job #2947490) | Cod sursa (job #929690) | Cod sursa (job #2680628) | Cod sursa (job #435307) | Cod sursa (job #1756933)
#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 (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
fout<<d[i][j]<<" ";
fout<<'\n';
}
}