Pagini recente » Borderou de evaluare (job #2666603) | Cod sursa (job #2264601) | Cod sursa (job #1997447) | Atasamentele paginii Profil HaiducStefania | Cod sursa (job #3311855)
#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++) {
if(minimumDistanceMatrix[i][k] != 0 && minimumDistanceMatrix[k][j] != 0)
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;
}