Pagini recente » Cod sursa (job #1807278) | Cod sursa (job #1653370) | Cod sursa (job #478991) | Cod sursa (job #3218050) | Cod sursa (job #2572900)
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;
const int DMAX = 110;
ll M[DMAX][DMAX];
int n;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int i,j,k;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
fin>>M[i][j];
if(!M[i][j] && i!= j)
M[i][j]=2e9;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(M[j][k] > M[j][i]+M[i][k])
M[j][k]=M[j][i]+M[i][k];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
if(M[i][j] < 2e9)
fout<<M[i][j]<<' ';
else
fout<<"0 ";
fout<<'\n';
}
return 0;
}