Pagini recente » Cod sursa (job #1165303) | Cod sursa (job #1976470) | Cod sursa (job #169374) | Cod sursa (job #1643431) | Cod sursa (job #400724)
Cod sursa(job #400724)
#include <fstream>
#include <algorithm>
using namespace std;
const int NMAX = 101;
int main()
{
short i, j, k, N;
int a[NMAX][NMAX];
ifstream f1("royfloyd.in");
freopen("royfloyd.out", "w", stdout);
f1 >> N;
for (i = 0; i != N; ++i)
for (j = 0; j != N; ++j)
f1 >> a[i][j];
for (k = 0; k != N; ++k)
for (i = 0; i != N; ++i)
for (j = 0 ; j != N; ++j)
if (a[i][k] && a[k][j] && i != j)
a[i][j] = std::min(a[i][k] + a[k][j], a[i][j]);
for (i = 0; i != N; ++i) {
for (j = 0; j != N; ++j)
printf("%d ", a[i][j]);
printf("\n");
}
}