Pagini recente » Cod sursa (job #1807892) | Cod sursa (job #2634649) | Cod sursa (job #2968794) | Cod sursa (job #720900) | Cod sursa (job #1785607)
#include <iostream>
#include <cstdio>
using namespace std;
int a[101][101], b[101][101], n;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
{
scanf("%d", &a[i][j]);
b[i][j] = a[i][j];
}
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
for(int k = 0; k < n; k++)
if(a[i][k] != 0 && a[k][j] != 0 && a[i][k] + a[k][j] < b[i][j])
b[i][j] = a[i][k] + a[k][j];
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
printf("%d ", b[i][j]);
printf("\n");
}
return 0;
}