Pagini recente » Cod sursa (job #454841) | Cod sursa (job #2463943) | Cod sursa (job #977663) | Cod sursa (job #936926) | Cod sursa (job #936431)
Cod sursa(job #936431)
#include <fstream>
using namespace std;
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
int a[n][n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
fin >> a[i][j];
for (int k = 0; k < n; ++k)
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n-1; ++j)
fout << a[i][j] << ' ';
fout << a[i][n-1] << '\n';
}
return 0;
}