Pagini recente » Cod sursa (job #2105020) | Cod sursa (job #252649) | Cod sursa (job #3123943) | Cod sursa (job #240932) | Cod sursa (job #2215706)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n, 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] && i != j && (a[i][j] > a[i][k] + a[k][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';
}
}