Pagini recente » Cod sursa (job #1256334) | Cod sursa (job #1539106) | Cod sursa (job #636196) | Cod sursa (job #2597484) | Cod sursa (job #1856120)
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 110;
int main(){
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, d[maxn][maxn];
f >> n;
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
f >> d[i][j]; } }
for(int k = 0; k < n; ++k){
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
if(i != j && j != k && i != k && d[i][k] && d[k][j] &&
(d[i][j] == 0 || d[i][j] > d[i][k] + d[k][j])){
d[i][j] = d[i][k] + d[k][j]; } } } }
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
g << d[i][j] << ' '; }
g << '\n'; }
return 0; }