Pagini recente » Cod sursa (job #835639) | Cod sursa (job #3040885) | Cod sursa (job #1446753) | Cod sursa (job #2671835) | Cod sursa (job #2592695)
#include <fstream>
using namespace std;
int c[128][128];
void royFloyd(int n) {
for(int i = 1; i <= n; ++ i) {
for(int j = 1; j <= n; ++ j) {
for(int k = 1; k <= n; ++ k) {
if(i != j && j != k && i != k) {
if(c[i][j] > c[i][k] + c[k][j]) {
c[i][j] = c[i][k] + c[k][j];
}
}
}
}
}
}
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 >> c[i][j];
royFloyd(N);
for (int i = 1; i <= N; ++ i) {
for (int j = 1; j <= N; ++ j)
out << c[i][j] << ' ';
out << '\n';
}
return 0;
}