Pagini recente » Cod sursa (job #2928091) | Cod sursa (job #3040941) | Cod sursa (job #2277702) | Arhiva de probleme | Cod sursa (job #2390941)
#include <bits/stdc++.h>
using namespace std;
#define N 110
int n, dp[N][N];
int main(){
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
cin >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++){
cin >> dp[i][j];
if (!dp[i][j]) dp[i][j] = 1e9;
}
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for (int i=1; i<=n; i++, cout << '\n')
for (int j=1; j<=n; j++) cout << dp[i][j] << ' ';
return 0;
}