Pagini recente » Borderou de evaluare (job #1749448) | Borderou de evaluare (job #2696656) | Borderou de evaluare (job #1916897) | Borderou de evaluare (job #1657978) | Cod sursa (job #3289346)
#include <fstream>
using namespace std;
const int N = 100;
int mat[N+1][N+1];
int main(){
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
in >> n;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
in >> mat[i][j];
}
}
for (int k = 1; k <= n; k++){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (mat[i][j] > mat[i][k] + mat[k][j]){
mat[i][j] = mat[i][k] + mat[k][j];
}
}
}
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
out << mat[i][j] << " ";
}
out << "\n";
}
in.close();
out.close();
return 0;
}