Pagini recente » Cod sursa (job #3165292) | Cod sursa (job #3001782) | Cod sursa (job #2163446) | Cod sursa (job #3235493) | Cod sursa (job #2943193)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define INF 1000000000
int n, i, j, k;
int dp[102][102];
int main()
{
f >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
f >> dp[i][j];
if (!dp[i][j] && i != j) {
dp[i][j] = INF;
}
}
}
for (k = 1; k <= n; k++) {
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (dp[i][j] > dp[i][k] + dp[k][j]) {
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (dp[i][j] == INF)
dp[i][j] = 0;
g << dp[i][j] << ' ';
}
g << '\n';
}
f.close();
g.close();
return 0;
}