Pagini recente » Cod sursa (job #2555623) | Cod sursa (job #3271408) | Borderou de evaluare (job #664345) | Cod sursa (job #2466097) | Cod sursa (job #892688)
Cod sursa(job #892688)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int D[101][101],n,i,j,z;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>D[i][j];
for(z=1;z<=n;z++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(D[i][z]!=0 &&D[z][j]!=0 && (D[i][z]+D[z][j]<D[i][j]|| D[i][j]!=0) && i!=j)
D[i][j]=D[i][z]+D[z][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<D[i][j]<<" ";
fout<<"\n";
}
}