Pagini recente » Cod sursa (job #2460995) | Cod sursa (job #1864121) | Cod sursa (job #370893) | Cod sursa (job #623625) | Cod sursa (job #2494259)
#include <iostream>
#include <fstream>
using namespace std;
#define nMax 101
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int Cost[nMax][nMax];
void RoyFloyd(int N) {
int k, i, j;
for (k = 1; k <= N; k++)
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
if (Cost[i][j] > Cost[i][k] + Cost[k][j]) Cost[i][j] = Cost[i][k] + Cost[k][j];
}
int main()
{
int N, i, j;
fin >> N;
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
fin >> Cost[i][j];
RoyFloyd(N);
for (i = 1; i <= N; i++) {
for (j = 1; j <= N; j++)
fout << Cost[i][j] << ' ';
fout << '\n';
}
}