Pagini recente » Istoria paginii runda/rar17/clasament | Clasament oni-2009-ix | Istoria paginii runda/arhiva-utcn | Istoria paginii runda/preoji2014_1 | Cod sursa (job #2642333)
#include <fstream>
#define NMAX 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dist[NMAX][NMAX], N;
void read() {
fin >> N;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
fin >> dist[i][j];
}
}
}
void royfloyd() {
for (int k = 1; k <= N; ++k) {
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
if (dist[i][j] > dist[i][k] + dist[k][j]) {
dist[i][j] = dist[i][k] + dist[k][j];
}
}
}
}
}
void afis() {
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
fout << dist[i][j] << " ";
}
fout << "\n";
}
}
int main()
{
read();
royfloyd();
afis();
return 0;
}