Pagini recente » Cod sursa (job #1195023) | Cod sursa (job #1182140) | Diferente pentru utilizator/aetheryon intre reviziile 3 si 4 | Cod sursa (job #349431) | Cod sursa (job #3311859)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main() {
int n;
fin >> n;
int minimumDistanceMatrix[101][101];
int MAX_VALUE = 1000 * 100 * 100 + 1;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++) {
int x;
fin >> x;
if (x != 0 || i == j)
minimumDistanceMatrix[i][j] = x;
else
minimumDistanceMatrix[i][j] = MAX_VALUE;
}
}
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
minimumDistanceMatrix[i][j] = min(minimumDistanceMatrix[i][j],
minimumDistanceMatrix[i][k] + minimumDistanceMatrix[k][j]);
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++) {
if(minimumDistanceMatrix[i][j] != MAX_VALUE)
fout << minimumDistanceMatrix[i][j] << " ";
else
fout << 0 << " ";
}
fout << endl;
}
return 0;
}