Pagini recente » Cod sursa (job #3005406) | Cod sursa (job #2595538) | Cod sursa (job #2867547) | Cod sursa (job #1717061) | Cod sursa (job #1357113)
#include <fstream>
#define DMAX 110
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
void citire();
void rez();
void afisare();
int n, m[DMAX][DMAX];
int main()
{
citire();
rez();
afisare();
fin.close();
fout.close();
return 0;
}
void citire()
{
int i, j;
fin>> n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
fin>> m[i][j];
}
void rez()
{
int i, j, k;
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (m[i][j] > m[i][k] + m[k][j] && m[i][k] && m[k][j])
m[i][j] = m[i][k] + m[k][j];
}
void afisare()
{
int i, j;
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
fout<< m[i][j]<<' ';
fout<< '\n';
}
}