Pagini recente » Cod sursa (job #2454799) | Cod sursa (job #192292) | Cod sursa (job #1972414) | Cod sursa (job #3208748) | Cod sursa (job #2756652)
#include <cstdio>
#include <vector>
using namespace std;
vector<vector<int>> A, DP;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int N;
scanf("%d", &N);
A.resize(N, vector<int>(N));
DP.resize(N, vector<int>(N));
const int INF = 0x3f3f3f3f;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
scanf("%d", &A[i][j]);
DP[i][j] = A[i][j];
if (A[i][j] == 0)
DP[i][j] = INF;
}
for (int k = 0; k < N; ++k)
for (int i = 0; i < N; ++i)
if (i != k)
for (int j = 0; j < N; ++j)
if (j != k && j != i)
DP[i][j] = min(DP[i][j], DP[i][k] + DP[k][j]);
for (auto it : DP) {
for (auto jt: it)
if (jt >= INF)
printf("0 ");
else
printf("%d ", jt);
printf("\n");
}
return 0;
}