Pagini recente » Cod sursa (job #755332) | Cod sursa (job #1948865) | Cod sursa (job #1600074) | Cod sursa (job #1266591) | Cod sursa (job #1165268)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int N = 105;
int n, a[N][N];
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 (i != j && a[i][k] && a[k][j] && (a[i][k] + a[k][j] < a[i][j] || !a[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";
}
}