Pagini recente » Cod sursa (job #1235580) | Cod sursa (job #728936) | Cod sursa (job #1506512) | Cod sursa (job #255844) | Cod sursa (job #1736788)
#include <fstream>
#define nmax 105
using namespace std;
short a[nmax][nmax];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
short i,j,k,n;
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f>>a[i][j];
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][j]))&&a[i][k]&&a[k][j]&&(i!=j))
{
a[i][j]=a[i][k]+a[k][j];
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<'\n';
}
f.close();
g.close();
return 0;
}