Pagini recente » Cod sursa (job #2584522) | Cod sursa (job #2033310) | Cod sursa (job #2283639) | Cod sursa (job #1721206) | Cod sursa (job #1469130)
#include <iostream>
#include <fstream>
using namespace std;
const int nmax = 105;
int mat[nmax][nmax], n;
int main()
{
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int i, j, k;
fin >> n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin >> mat[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if (mat[i][k] && mat[k][j] && (mat[i][j] > mat[i][k] + mat[k][j] || !mat[i][j]) && i != j)
mat[i][j]=mat[i][k]+mat[k][i];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout << mat[i][j] << " ";
fout << "\n";
}
fin.close();
fout.close();
return 0;
}