Pagini recente » Cod sursa (job #3198869) | Cod sursa (job #1214287) | Cod sursa (job #1941227) | Cod sursa (job #2348798) | Cod sursa (job #2377671)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, dp[101][101];
int main() {
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] && i != j && (!dp[i][j] || dp[i][k] + dp[k][j] < dp[i][j]))
dp[i][j] = dp[i][k] + dp[k][j];
for (int i = 1; i <= n; i++, out << '\n')
for (int j = 1; j <= n; j++)
out << dp[i][j] << ' ';
return 0;
}