Pagini recente » Cod sursa (job #2665673) | Cod sursa (job #1586478) | Cod sursa (job #2314786) | Cod sursa (job #1028819) | Cod sursa (job #2969344)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
void solve(){
int n;
cin >> n;
int a[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
cin >> a[i][j];
}
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
cout << a[i][j] << ' ';
cout << '\n';
}
}
int main(){
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}