Pagini recente » Cod sursa (job #1777358) | Cod sursa (job #1152246) | Cod sursa (job #2275661) | Cod sursa (job #2823151) | Cod sursa (job #1514871)
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100;
const int INF = numeric_limits<int>::max() / 4;
int D[MAX_N + 1][MAX_N + 1];
int N;
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
in >> N;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= N; ++j)
{
in >> D[i][j];
if (D[i][j] == 0)
D[i][j] = INF;
}
for (int k = 1; k <= N; ++k)
for (int i = 1; i <= N; ++i)
if (i != k)
for (int j = 1; j <= N; ++j)
if (j != k && i != j)
if (D[i][j] > D[i][k] + D[k][j])
D[i][j] = D[i][k] + D[k][j];
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= N; ++j)
{
if (D[i][j] == INF)
D[i][j] = 0;
out << D[i][j] << " ";
}
out << "\n";
}
return 0;
}