Pagini recente » Cod sursa (job #1601354) | Cod sursa (job #1619259) | Cod sursa (job #1608217) | Cod sursa (job #3171698) | Cod sursa (job #2700445)
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double
int32_t main() {
startt;
//freopen("royfloyd.in", "r", stdin);
//freopen("royfloyd.out", "w", stdout);
int n;
cin >> n;
int a[n+1][n+1];
int d[105][105] = {0};
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
cin >> a[i][j];
d[i][j] = a[i][j];
}
}
for (int k = 0; k < n; k++)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (d[i][k] > 0 && d[k][j] > 0 && i != j && (d[i][k] + d[k][j] < d[i][j] || d[i][j] == 0))
{
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
cout << d[i][j] << " ";
}
cout << endl;
}
}