Pagini recente » Cod sursa (job #922681) | Cod sursa (job #2474572) | Cod sursa (job #1167233) | Cod sursa (job #2684458) | Cod sursa (job #2780728)
#include <bits/stdc++.h>
#define NMAX 103
using namespace std;
int dp[NMAX][NMAX];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n;
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> dp[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(i != j && dp[i][k] && dp[k][j])
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j] );
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
cout << dp[i][j] << ' ';
cout << '\n';
}
return 0;
}