Pagini recente » Cod sursa (job #653558) | Rating Cruceanu (CalinCruceanu3576) | Cod sursa (job #2083359) | Cod sursa (job #2058041) | Cod sursa (job #1423112)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N, V[110][110];
int main()
{
fin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
fin >> V[i][j];
}
}
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
{
if (i != j)
{
for (int k = 1; k <= N; k++)
{
if (k != i && k != j)
{
if (V[i][k] && V[k][j] && (V[i][k] + V[k][j] < V[i][j] || !V[i][j])) {
V[i][j] = V[i][k] + V[k][j];
}
}
}
}
}
}
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++) {
fout << V[i][j] << ' ';
}
fout << '\n';
}
fout.close();
return 0;
}