Pagini recente » Cod sursa (job #1971113) | Cod sursa (job #2953495) | Cod sursa (job #2750693) | Cod sursa (job #2369668) | Cod sursa (job #1370492)
#include <fstream>
#define nmax 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,A[nmax][nmax];
int main()
{
int i,j,k;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>A[i][j];
//Roy-Floyd
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i != j && A[i][k] && A[k][j] && (A[i][j] > A[i][k] + A[k][j] || !A[i][j])) A[i][j] = A[i][k] + A[k][j];
// Afisare
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<A[i][j]<<' ';
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}