Pagini recente » Cod sursa (job #1391949) | Cod sursa (job #288619) | Cod sursa (job #1474596) | Cod sursa (job #1849933) | Cod sursa (job #2911581)
//ajungi de la un nod i la un nod j printr-un nod k
#include <fstream>
#include <climits>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
const int INF = 1e9;
const int N = 100;
int dp[N + 1][N + 1];
int n;
void roy_floyd()
{
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]);
}
int main()
{
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
cin >> dp[i][j];
if (i != j && !dp[i][j])
dp[i][j] = INF;
}
roy_floyd();
for (int i = 1; i <= n; ++i, cout << '\n')
for (int j = 1; j <= n; ++j)
cout << dp[i][j] << ' ';
return 0;
}