Pagini recente » Cod sursa (job #580713) | Cod sursa (job #1713605) | Cod sursa (job #2466515) | Cod sursa (job #2164627) | Cod sursa (job #1047734)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int N, i, j, x, y, z, d[100][100];
int minimum(int a, int b){
if(a < b){
return a;
}
return b;
}
int main(){
in >> N;
for(i = 1; i <= N; i++){
for(j = 1; j <= N; j++){
in >> d[i][j];
}
}
for(z = 1; z <= N; z++){
for(x = 1; x <= N; x++){
for(y = 1; y <= N; y++){
d[x][y] = minimum(d[x][z] + d[z][y], d[x][y]);
}
}
}
for(i = 1; i <= N; i++){
for(j = 1; j <= N; j++){
out << d[i][j] << " ";
}
out << "\n";
}
}