Pagini recente » Borderou de evaluare (job #168045) | Cod sursa (job #152418) | Cod sursa (job #2485544) | Cod sursa (job #1728069) | Cod sursa (job #2220314)
#include <cstdio>
using namespace std;
int n, c[101][101];
int main()
{
FILE *in, *out;
in = freopen("royfloyd.in", "r", stdin);
out = freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
scanf("%d", &c[i][j]);
fclose(in);
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (c[i][k] && c[k][j] && (!c[i][j] || c[i][j] > c[i][k] + c[k][j]) && i != j) c[i][j] = c[i][k] + c[k][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) printf("%d ", c[i][j]);
printf("\n");
}
fclose(out);
return 0;
}