Pagini recente » Cod sursa (job #87163) | Cod sursa (job #1735489) | Cod sursa (job #1950247) | Cod sursa (job #329550) | Cod sursa (job #2645362)
#include <cstdio>
using namespace std;
int main() {
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
int n, i, j, k;
scanf("%d", &n);
int distances[n+1][n+1];
for(i=0; i<=n; ++i)
for(j=0; j<=n; ++j)
distances[i][j] = 0;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
scanf("%d", &distances[i][j]);
for(j=1; j<=n; ++j)
for(i=1; i<=n; ++i)
for(k=1; k<=n; ++k)
if (i!=k)
if (distances[i][j] && distances[j][k])
if (distances[i][j] + distances[j][k] < distances[i][k] || distances[i][k] == 0)
distances[i][k] = distances[i][j] + distances[j][k];
for(i=1;i<=n; ++i) {
for(j=1; j<=n; ++j)
printf("%d ", distances[i][j]);
printf("\n");
}
return 0;
}