Pagini recente » Cod sursa (job #2588509) | Borderou de evaluare (job #1685220) | Cod sursa (job #2715505) | Cod sursa (job #2803233) | Cod sursa (job #2424111)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int n;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
cin >> n;
int a[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][k] + a[k][j] < a[i][j]) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << a[i][j] << " ";
}
cout << "\n";
}
return 0;
}