Pagini recente » Cod sursa (job #84054) | Cod sursa (job #2121658) | Cod sursa (job #1846908) | Cod sursa (job #2205308) | Cod sursa (job #412195)
Cod sursa(job #412195)
#include <stdio.h>
long n;
long graf[200][200];
int main ()
{
freopen ("royfloyd.in", "rt", stdin);
freopen ("royfloyd.out", "wt", stdout);
scanf("%ld", &n);
for (long i = 1; i <= n; ++i)
for (long j = 1; j <= n; ++j)
{
scanf("%ld", &graf[i][j]);
}
for (long i = 1; i <= n; ++i)
for (long j = 1; j <= n; ++j)
for (long k = 1; k <= n; ++k)
{
if (i != k && graf[i][j] && graf[j][k] && (graf[i][j] + graf[j][k] < graf[i][k] || !graf[i][k]))
graf[i][k] = graf[i][j] + graf[j][k];
}
for (long i = 1; i <= n; ++i)
{
for (long j = 1; j <= n; ++j)
{
printf("%ld ", graf[i][j]);
}
printf("\n");
}
return 0;
}