Pagini recente » Cod sursa (job #1673233) | Cod sursa (job #841894) | Cod sursa (job #2695437) | Cod sursa (job #1286849) | Cod sursa (job #1399091)
#include <bits/stdc++.h>
using namespace std;
int n, i, j, k, a[110][110];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
scanf("%d", &a[i][j]);
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j && i != k && j != k)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
printf("%d ", a[i][j]);
printf("\n");
}
return 0;
}