Pagini recente » Cod sursa (job #1185758) | Cod sursa (job #2001263) | Cod sursa (job #1335837) | Cod sursa (job #571859) | Cod sursa (job #3311853)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main(){
int n;
fin >> n;
int minimumDistanceMatrix[101][101];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> minimumDistanceMatrix[i][j];
for(int k = 1; k <= n; k++){
for(int i = 1; i <= n; i++)
for(int j = 0; 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++)
fout << minimumDistanceMatrix[i][j] << " ";
fout << endl;
}
return 0;
}