Pagini recente » Cod sursa (job #1938804) | Cod sursa (job #433944) | Cod sursa (job #1683406) | Cod sursa (job #1596421) | Cod sursa (job #153392)
Cod sursa(job #153392)
#include <cstdio>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector< vi > vii;
typedef vector<string> vs;
typedef vector<double> vd;
typedef pair<int, int> ii;
#define PB push_back
#define SZ(v) v.size()
#define ALL(v) (v).begin(), (v).end()
#define FORIT(i,c) for (typeof((c).end()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i,n) for (int i = 0; i<(n); ++i)
#define FORE(i,n) for (int i = 0; i<=(n); ++i)
#define FORI(i,n1,n2) for (int i = n1; i<(n2); ++i)
#define FORIE(i,n1,n2) for (int i = n1; i<=(n2); ++i)
#define FORV(i,v) for (unsigned int i = 0; i<SZ(v); ++i)
#define INF 0x3f3f3f3f
#define EPS 1e-9
#define NMAX 100
int N;
int A[NMAX][NMAX];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &N);
FOR(i,N)
FOR(j,N)
{
scanf("%d", &A[i][j]);
if (A[i][j] == 0)
A[i][j] = INF;
}
FOR(k,N)
FOR(i,N)
FOR(j,N)
if (i!=j)
A[i][j] = min(A[i][j], A[i][k]+A[k][j]);
FOR(i,N)
{
FOR(j,N)
{
if (A[i][j] != INF)
printf("%d ", A[i][j]);
else
printf("0 ");
}
printf("\n");
}
return 0;
}