Pagini recente » Cod sursa (job #1389933) | Cod sursa (job #2700969) | Cod sursa (job #2861142) | Cod sursa (job #1589554) | Cod sursa (job #2443379)
#include<bits/stdc++.h>
#pragma gcc optimize("O3")
#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define len(a) (int) (a).size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const int nmax=1025;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
ios_base::sync_with_stdio(0); cin.tie(0);
int n,a[101][101];
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>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(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || (a[i][j]==0 && i!=j)))
a[i][j]=a[i][k]+a[k][j];
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) cout<<a[i][j]<<" ";
cout<<"\n";
}
}