Pagini recente » Cod sursa (job #1108018) | Cod sursa (job #3214697) | Cod sursa (job #2653624) | Cod sursa (job #101719) | Cod sursa (job #1677933)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int a[101][101];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
fin >> 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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
fout << a[i][j] << ' ';
fout << '\n';
}
fin.close();
fout.close();
return 0;
}