Pagini recente » Cod sursa (job #1517379) | Cod sursa (job #1777717) | Cod sursa (job #1518789) | Diferente pentru problema/suma6 intre reviziile 19 si 6 | Cod sursa (job #1988739)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, M[101][101];
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fin >> M[i][j];
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (M[i][k] + M[k][j] < M[i][j])
M[i][j] = M[i][k] + M[k][j];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
fout << M[i][j] << " ";
fout << "\n";
}
return 0;
}