Pagini recente » Cod sursa (job #1450229) | Cod sursa (job #644027) | Cod sursa (job #2379492) | Cod sursa (job #1865390) | Cod sursa (job #2550011)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int inf = (1 << 30);
int main()
{
int n;
f >> n;
vector <vector <long long >> dp(n + 1, vector <long long> (n + 1));
for (int i = 1; i <= n; ++ i)
for (int j = 1; j <= n; ++ j)
{
f >> dp[i][j];
if (i != j && dp[i][j] == 0)
dp[i][j] = inf;
}
for (int k = 1; k <= n; ++ k)
for (int i = 1; i <= n; ++ i)
for (int j = 1; j <= n; ++ j)
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)
g << dp[i][j] << " ";
g << '\n';
}
}