Pagini recente » Cod sursa (job #1751591) | Rating iwdecxiv ikjwiyi (enpdbybviwq) | Cod sursa (job #1692890) | Cod sursa (job #2421168) | Cod sursa (job #2425803)
#include <iostream>
#include <istream>
using namespace std;
int m[101][101], n;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> m[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 0; j <= n; j++)
if ((m[i][j] == 0 || m[i][j] > m[i][k] + m[k][j]) && m[i][k] && m[i][k] && m[k][j] && i != j)
m[i][j] = m[i][k] + m[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
out << m[i][j] << " ";
out << '\n';
}
return 0;
}