Pagini recente » Cod sursa (job #2454182) | Cod sursa (job #3279680) | Cod sursa (job #2142923) | Cod sursa (job #1101213) | Cod sursa (job #2763107)
#include <bits/stdc++.h>
#include <list>
#include <ext/pb_ds/assoc_container.hpp>
#define FOR(i , n) for(int i = 0 ; i < (n) ; i++)
#define N 201
#define apare printf("apare");
#define endl "\n"
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int , int> pii;
const int inf = 1e6;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen("royfloyd.in" , "r" , stdin);
freopen("royfloyd.out" , "w" , stdout);
int n;
cin >> n;
vector<vector<int>> sequence( n , vector<int>(n , 0));
FOR(i , n){
FOR(j , n){
cin >> sequence[i][j];
if(sequence[i][j] == 0)
sequence[i][j] = inf;
}
}
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
for(int k = 0 ; k < n ; k++){
if(i != j && j != k && i != k)
sequence[i][j] = min(sequence[i][j] , sequence[i][k] + sequence[k][j]);
}
}
}
FOR(i , n){
FOR(j , n){
if(sequence[i][j] == inf)
cout << "0 ";
else
cout << sequence[i][j] << " ";
}
cout << endl;
}
return 0;
}