Pagini recente » Cod sursa (job #1891698) | Cod sursa (job #2447564) | Cod sursa (job #1269890) | Rating UPB Dragan Jercaianu Mocanu (Asnaeb) | Cod sursa (job #2781443)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int n, a[101][101];
int main ()
{
in >> n;
for (int i = 1;i<=n;++i)
for (int j = 1;j<=n;++j)
in >> 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 ( i!=j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][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)
out << a[i][j] << ' ';
out << '\n';
}
}