Pagini recente » Cod sursa (job #1904054) | Cod sursa (job #1843054) | Cod sursa (job #224247) | Cod sursa (job #3190879) | Cod sursa (job #2726146)
#include <fstream>
using namespace std;
const int N = 100;
int dp[N + 1][N + 1];
int main() {
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
in >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
in >> dp[i][j];
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (dp[i][k] && dp[k][j] && dp[i][j] > dp[i][k] + dp[k][j])
dp[i][j] = dp[i][k] + dp[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
out << dp[i][j] << ' ';
out << '\n';
}
in.close();
out.close();
}