Pagini recente » Cod sursa (job #2650120) | Cod sursa (job #381405) | Cod sursa (job #2272985) | Cod sursa (job #365676) | Cod sursa (job #1969082)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define nmax 105
int n,i,j,k,a[nmax][nmax];
void rf()
{
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(i!=j and a[i][k] and a[k][j] and (a[i][k]+a[k][j]<a[i][j] or !a[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];
}
rf();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
return 0;
}