Pagini recente » Cod sursa (job #2199096) | Cod sursa (job #2017641) | Cod sursa (job #256940) | Cod sursa (job #1647524) | Cod sursa (job #1387540)
#include <fstream>
using namespace std;
ifstream is("royfloyd.in");
ofstream os("royfloyd.out");
int a[101][101], sol[101][101];
int n;
int main()
{
is >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
is >> a[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (a[i][k] != 0 && a[k][j] != 0 && i != j)
if (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0)
a[i][j] = a[i][k] + a[k][j];
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
os << a[i][j] << ' ';
os << '\n';
}
is.close();
os.close();
return 0;
}