Pagini recente » Cod sursa (job #30695) | Cod sursa (job #418370) | Cod sursa (job #813513) | Borderou de evaluare (job #2105087) | Cod sursa (job #2510288)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main() {
int n, a[205][205];
in>>n;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
in>>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(i != j && a[i][k] != 0 && a[k][j] != 0 && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0)) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
out<<a[i][j]<<" ";
}
out<<"\n";
}
return 0;
}