Pagini recente » Cod sursa (job #2660396) | Cod sursa (job #67411) | Cod sursa (job #196066) | Cod sursa (job #621006) | Cod sursa (job #3192629)
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define chad char
#define mod 1'000'000'007
#define dim 100005
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200002
#define simaimult 1e17
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define pli pair<ll,int>
#define pil pair<int,ll>
#define piii pair<int,pair<int,int> >
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
ll c[102][102];
void floyd_war()
{
for(int i=1; i<=n; i++)
{
for(int nod1=1; nod1<=n; nod1++)
{
for(int nod2=1; nod2<=n; nod2++)
if(c[nod1][i]+c[i][nod2]<c[nod1][nod2])
c[nod1][nod2]=c[nod1][i]+c[i][nod2];
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
fin >> c[i][j];
if(!c[i][j])
c[i][j]=INT_MAX;
}
floyd_war();
for(int i=1; i<=n; i++,fout << "\n")
for(int j=1; j<=n; j++)
{
if(i==j)
{
fout << 0 << " ";
continue;
}
if(c[i][j]<INT_MAX)
fout << c[i][j] << " ";
else
fout << 0 << " ";
}
return 0;
}