Pagini recente » Borderou de evaluare (job #2912785) | Cod sursa (job #1941901) | Cod sursa (job #1790276) | Borderou de evaluare (job #2783283) | Cod sursa (job #2343511)
#include <climits>
#include <fstream>
#define DMAX 110
std::ifstream fin("royfloyd.in");
std::ofstream fout("royfloyd.out");
int n;
int dp[DMAX][DMAX];
inline int min(int x, int y) {
return x < y ? x : y;
}
int main() {
int cost;
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
fin >> cost;
dp[i][j] = cost;
if (!dp[i][j])
dp[i][j] = INT_MAX;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j)
if (dp[i][k] != INT_MAX && dp[k][j] != INT_MAX)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
if (i == j)
fout << "0 ";
else
fout << dp[i][j] << ' ';
fout << '\n';
}
fout.close();
return 0;
}