Pagini recente » Cod sursa (job #1988734) | Cod sursa (job #482210) | Cod sursa (job #1494113) | Cod sursa (job #455377) | Cod sursa (job #1988399)
#include <iostream>
#include <fstream>
#define oo (1 << 20)
#define NMAX 105
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[NMAX][NMAX], n;
int main(int argc, char* argv[]) {
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
in >> a[i][j];
if (i != j && a[i][j] == 0)
a[i][j] = oo;
}
in.close();
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][j] > a[i][k] + a[k][j])
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";
}
out.close();
return 0;
}