Pagini recente » Cod sursa (job #525043) | Cod sursa (job #1535185) | Cod sursa (job #1475669) | Cod sursa (job #133333) | Cod sursa (job #860670)
Cod sursa(job #860670)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[101][101],i,j;
void RoyFloyd ()
{
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][k]>0 && a[k][j]>0 && ( a[i][j]>a[i][k]+a[k][j] || a[i][j]==0) && i!=j) a[i][j]=a[i][k]+a[k][j];
}
int main ()
{
f>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
f>>a[i][j];
RoyFloyd();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}