Pagini recente » Cod sursa (job #2774223) | Cod sursa (job #2093958) | Cod sursa (job #466071) | Cod sursa (job #990017) | Cod sursa (job #2519942)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, G[1002][1002];
int D[1002][1002];
int main() {
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
fin >> G[i][j];
D[i][j] = G[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 && i != k && j != k) {
if (D[i][k] + D[k][j] < D[i][j])
D[i][j] = D[i][k] + D[k][j];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
{
fout << D[i][j] << " ";
}
fout << endl;
}
}